CTFR 18/574,252 CTFR 100365 DETAILED ACTION Notice of Pre-AIA or AIA Status 07-03-aia AIA 15-10-aia The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA. This Office Action is in response to the Applicant Arguments/REMARKS correspondence filed 04/16/2026. Claims 1-18, 22-23, 27, 30-31, 38, & 40-41 are pending and rejected. Response to arguments starts on pg. 19. Claim Rejections - 35 USC § 103 07-06 AIA 15-10-15 In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. 07-20-aia AIA The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. 07-23-aia AIA The factual inquiries for establishing a background for determining obviousness under 35 U.S.C. 103 are summarized as follows: 1. Determining the scope and contents of the prior art. 2. Ascertaining the differences between the prior art and the claims at issue. 3. Resolving the level of ordinary skill in the pertinent art. 4. Considering objective evidence present in the application indicating obviousness or nonobviousness. 07-21-aia AIA Claims 1-3, 7-13, 17-18, 22-23, 27, 30-31, 38, & 40-41 are rejected under 35 U .S.C. 103 as being unpatentable over Ganesan et al (US20 210250913A1) in view of Belleschi et al (US20210219320A1). Regarding claim 1 ( and method claim 38), Ganesan teaches an apparatus for wireless communication at a first user equipment (UE), comprising: one or more memories (claim 1 processor and memory) ; and one or more processors (claim 1 processor and memory) , coupled to the one or more memories, configured to: receive, on one or more sidelink channels, a set of messages indicating a corresponding set of resource reservations ([0032]-[0034], [0038]-[0039], UE is explicitly configured to listed to other UEs and receive sidelink control messages (SPI/SCI) indicating resources or transmission patterns that are selected and reserved for a time period; each received SPI corresponds to a resource reservation by another UE; UE listens to other UEs and receives sidelink control messages indicating a specific resource or transmission pattern being selected and reserved for a predetermined time period; SPI/SCI is sent on PSCCH and indicates reserved resources/patterns) ; and However, Ganesan fails to teach but Belleschi teaches transmit, to a second UE, a resource information message that indicates a subset of resource reservations of resource reservations of the set of resource reservations ([0039]-[0041], disclosure the receive[Wingdings font/0xE0]process[Wingdings font/0xE0]transmit pattern where a UE receives SCI indicating a candidate set of radio resources, reservation for future transmissions; in response, UE sends a feedback message conveying information about those resources to another UE; the feedback message does not retransmit all received reservations, but instead conveys derived information for a selected portion/set (subset) (candidate set, alternative set, status-indicated set)) . It would have been obvious to a person of ordinary skill in the art, at the effective filing date of the invention, to combine the sidelink resource reservation techniques of Ganesan, which teaches receiving sidelink control messages indicating resources reserved by neighboring UEs, with the resource-processing and feedback mechanisms of Belleschi, which teaches receiving reservation-related sidelink messages and transmitting a second message conveying selected resource information to another UE. Further, Belleschi teaches selecting only a bounded subset of resources from received reservations, which naturally motivates reporting only a subset—preferably those received earlier and within a maximum quality. The motivation to combine the references would be to efficiently coordinate sidelink transmissions by leveraging known sidelink reservation signaling while limiting signaling overhead and collisions through selective reporting of only a bounded, prioritized subset of received resource reservations to neighboring UEs. Regarding claim 2 (and method claim 40), Ganesan fails to teach but Belleschi teaches the apparatus wherein the subset of resource reservations are associated with one or more messages, from the set of messages, that were received earlier than remaining messages, from the set of messages, associated with resource reservations, of the set of resource reservations, not included in the subset of resource reservations ([0034], [0037]-[0039], explicitly describes multiple SCI messages, sensing windows, and prioritization/selection among received reservations; resource selection is performed after excluding and ranking reservations received over time; UE excludes resources indicated by decoded scheduling assignments (SCI) received during the sensing window (temporal ordering); UE selects a candidate set (subset) from remaining resources after processing received SCI) . It would have been obvious to a person of ordinary skill in the art, at the effective filing date of the invention, to combine the sidelink resource reservation techniques of Ganesan, which teaches receiving sidelink control messages indicating resources reserved by neighboring UEs, with the resource-processing and feedback mechanisms of Belleschi, which teaches receiving reservation-related sidelink messages and transmitting a second message conveying selected resource information to another UE. Further, Belleschi teaches selecting only a bounded subset of resources from received reservations, which naturally motivates reporting only a subset—preferably those received earlier and within a maximum quality. The motivation to combine the references would be to efficiently coordinate sidelink transmissions by leveraging known sidelink reservation signaling while limiting signaling overhead and collisions through selective reporting of only a bounded, prioritized subset of received resource reservations to neighboring UEs. Regarding claim 3, Ganesan fails to teach but Belleschi teaches t he apparatus wherein the subset of resource reservations are selected based at least in part on a maximum quantity of resource reservations ([0034], UE selects s subset of resources from the resource pool where the subset may correspond to about 20% of the total resources ; teaches selecting only a limited subset of resources from the resource pool—the subset size is constrained (e.g. a fraction of the total pool) which is functionally equivalent to a maximum quantity threshold) . It would have been obvious to a person of ordinary skill in the art, at the effective filing date of the invention, to combine the sidelink resource reservation techniques of Ganesan, which teaches receiving sidelink control messages indicating resources reserved by neighboring UEs, with the resource-processing and feedback mechanisms of Belleschi, which teaches receiving reservation-related sidelink messages and transmitting a second message conveying selected resource information to another UE. Further, Belleschi teaches selecting only a bounded subset of resources from received reservations, which naturally motivates reporting only a subset—preferably those received earlier and within a maximum quality. The motivation to combine the references would be to efficiently coordinate sidelink transmissions by leveraging known sidelink reservation signaling while limiting signaling overhead and collisions through selective reporting of only a bounded, prioritized subset of received resource reservations to neighboring UEs. Regarding claim 7 (and method claim 41), Ganesan fails to teach but Belleschi teaches t he apparatus wherein the subset of resource reservations are selected based at least in part on a time window ([0034]-[0035], UE performs sensing over a sensing time window preceding resource reselection, and processes reservations (SCI) received within that window; resource exclusion and subset selection are explicitly ties to the time window used for sensing and reservation collection; subset selection is explicitly time-window-based) . It would have been obvious to a person of ordinary skill in the art, at the effective filing date of the invention, to combine the sidelink resource reservation techniques of Ganesan, which teaches receiving sidelink control messages indicating resources reserved by neighboring UEs, with the resource-processing and feedback mechanisms of Belleschi, which teaches receiving reservation-related sidelink messages and transmitting a second message conveying selected resource information to another UE. Further, Belleschi teaches selecting only a bounded subset of resources from received reservations, which naturally motivates reporting only a subset—preferably those received earlier and within a maximum quality. The motivation to combine the references would be to efficiently coordinate sidelink transmissions by leveraging known sidelink reservation signaling while limiting signaling overhead and collisions through selective reporting of only a bounded, prioritized subset of received resource reservations to neighboring UEs. Regarding claim 8, Ganesan fails to teach the apparatus wherein a length of the time window is a preconfigured value stored in the one or more memories. However, Belleschi teaches the apparatus wherein a length of the time window is a preconfigured value stored in the one or more memories ([0035], the sensing time window is describes as configured/predefined and used repeatedly for sensing and selection; sensing time window is discussed as a defined window whose size may be fixed or configured, implying storage as a configuration parameter) . It would have been obvious to a person of ordinary skill in the art, at the effective filing date of the invention, to combine the sidelink resource reservation techniques of Ganesan, which teaches receiving sidelink control messages indicating resources reserved by neighboring UEs, with the resource-processing and feedback mechanisms of Belleschi, which teaches receiving reservation-related sidelink messages and transmitting a second message conveying selected resource information to another UE. Further, Belleschi teaches selecting only a bounded subset of resources from received reservations, which naturally motivates reporting only a subset—preferably those received earlier and within a maximum quality. The motivation to combine the references would be to efficiently coordinate sidelink transmissions by leveraging known sidelink reservation signaling while limiting signaling overhead and collisions through selective reporting of only a bounded, prioritized subset of received resource reservations to neighboring UEs. Regarding claim 9, Ganesan fails to teach the apparatus wherein the one or more processors are further configured to: receive an indication of a length of the time window. However, Belleschi teaches the apparatus wherein the one or more processors are further configured to: receive an indication of a length of the time window ([0032]-[0033], UE operates under network-assisted sidelink operation, where configuration parameters (including sensing behavior) may be signaling by the network; receipt if configuration implicitly includes receiving an indication of sensing-window length; resource selection follows standardized sidelink procedures (mode 4) which rely on configured sensing parameters) . It would have been obvious to a person of ordinary skill in the art, at the effective filing date of the invention, to combine the sidelink resource reservation techniques of Ganesan, which teaches receiving sidelink control messages indicating resources reserved by neighboring UEs, with the resource-processing and feedback mechanisms of Belleschi, which teaches receiving reservation-related sidelink messages and transmitting a second message conveying selected resource information to another UE. Further, Belleschi teaches selecting only a bounded subset of resources from received reservations, which naturally motivates reporting only a subset—preferably those received earlier and within a maximum quality. The motivation to combine the references would be to efficiently coordinate sidelink transmissions by leveraging known sidelink reservation signaling while limiting signaling overhead and collisions through selective reporting of only a bounded, prioritized subset of received resource reservations to neighboring UEs. Regarding claim 10, Ganesan fails to teach the apparatus wherein the one or more processors are further configured to: determine a length of the time window based at least in part on a maximum transmission resource available, a maximum modulation and coding scheme (MCS), a fixed MCS, a network congestion parameter, a traffic pattern, an indication from an application layer of the UE, or a combination thereof. However, Belleschi teaches the apparatus wherein the one or more processors are further configured to: determine a length of the time window based at least in part on a maximum transmission resource available, a maximum modulation and coding scheme (MCS), a fixed MCS, a network congestion parameter, a traffic pattern, an indication from an application layer of the UE, or a combination thereof ([0033]-[0035], reference explains the window size impacts congestion, detection probability, energy consumption, and traffic suitability; further teaches adapting sensing behavior based on traffic type, congestion, and UE capability, which naturally motivates determining window length based on such parameters; larger vs smaller sensing windows trade off congestion detection, latency and energy, directly tying window size to system conditions; selection depends on interference, RSSI, congestion, and traffic behavior) . It would have been obvious to a person of ordinary skill in the art, at the effective filing date of the invention, to combine the sidelink resource reservation techniques of Ganesan, which teaches receiving sidelink control messages indicating resources reserved by neighboring UEs, with the resource-processing and feedback mechanisms of Belleschi, which teaches receiving reservation-related sidelink messages and transmitting a second message conveying selected resource information to another UE. Further, Belleschi teaches selecting only a bounded subset of resources from received reservations, which naturally motivates reporting only a subset—preferably those received earlier and within a maximum quality. The motivation to combine the references would be to efficiently coordinate sidelink transmissions by leveraging known sidelink reservation signaling while limiting signaling overhead and collisions through selective reporting of only a bounded, prioritized subset of received resource reservations to neighboring UEs. Regarding claim 11, Ganesan fails to teach but Belleschi teaches the apparatus wherein the subset of resource reservations are selected based at least in part on signal strengths associated with the set of messages, distances associated with the set of messages, identifiers included in the set of messages, sizes associated with the set of resource reservations, amount of resources reserved with the set of messages, periodicities of the resources reserved with the set of messages, or a combination thereof ([0034], [0039], [0041], explicitly teaches selection/exclusion based on signal strength (RSRP/RSSI), congestion level, resource size/candidate size, periodic reservations, priority identifiers (PPPP); Resources excluded or ranked based on RSRP/RSSI thresholds; SCI includes priority identifiers and reservations for multiple future time slots (periodicity); multi-level indicator reflects interference strength/congestion) . It would have been obvious to a person of ordinary skill in the art, at the effective filing date of the invention, to combine the sidelink resource reservation techniques of Ganesan, which teaches receiving sidelink control messages indicating resources reserved by neighboring UEs, with the resource-processing and feedback mechanisms of Belleschi, which teaches receiving reservation-related sidelink messages and transmitting a second message conveying selected resource information to another UE. Further, Belleschi teaches selecting only a bounded subset of resources from received reservations, which naturally motivates reporting only a subset—preferably those received earlier and within a maximum quality. The motivation to combine the references would be to efficiently coordinate sidelink transmissions by leveraging known sidelink reservation signaling while limiting signaling overhead and collisions through selective reporting of only a bounded, prioritized subset of received resource reservations to neighboring UEs. Regarding claim 12, Ganesan teaches t he apparatus wherein the subset of resource reservations are associated with a retransmission count that satisfies a retransmission threshold ([0030]-[0032], [0040]-[0041], discusses repeated transmissions over reserved resources and mechanisms to improve reliability and avoid collision; while not using the exact phrase “retransmission count,” it discloses multiple transmissions over reserved patterns and conflict handling, implying tracking retransmissions; reservation of resources for multiple future transmissions to improve reliability; conflict resolution and reliability improvement mechanisms that inherently depend on transmission attempts) . Regarding claim 13, Ganesan teaches the apparatus wherein the one or more processors are further configured to: discard, from the one or more memories, stored data associated with resource reservations, from the set of resource reservations, that are associated with a retransmission count that does not satisfy the retransmission threshold ([0038]-[0040], reservation information is maintained only for a predetermined time period and updated based on continued validity; once conditions are no longer met (e.g. collisions, conflicts, expired reservations), the reservation information is no longer retained; reservations are valid for a predetermined time period or expiration and removal; conflict resolution causes outdated or invalid reservations to be superseded or removed) . Regarding claim 17, Ganesan fails to teach but Belleschi teaches the apparatus wherein the subset of resource reservations are associated with a hop count that satisfies a hop count threshold ([0004]-[0006], [0032]-[0034], the reference explicitly addresses multi-UE sidelink scenarios, where messages are received from different transmitted UEs, potentially via intermediate UEs (hidden/exposed node problems); resource status and reservation relevance depend on topological proximity and whether transmissions originate from nearby vs farther UEs, which is the functional equivalent of hop-based relevance filtering) . It would have been obvious to a person of ordinary skill in the art, at the effective filing date of the invention, to combine the sidelink resource reservation techniques of Ganesan, which teaches receiving sidelink control messages indicating resources reserved by neighboring UEs, with the resource-processing and feedback mechanisms of Belleschi, which teaches receiving reservation-related sidelink messages and transmitting a second message conveying selected resource information to another UE. Further, Belleschi teaches selecting only a bounded subset of resources from received reservations, which naturally motivates reporting only a subset—preferably those received earlier and within a maximum quality. The motivation to combine the references would be to efficiently coordinate sidelink transmissions by leveraging known sidelink reservation signaling while limiting signaling overhead and collisions through selective reporting of only a bounded, prioritized subset of received resource reservations to neighboring UEs. Regarding claim 18, Ganesan fails to teach the apparatus wherein the one or more processors are further configured to: discard, from the one or more memories, stored data associated with resource reservations, from the set of resource reservations, that are associated with a hop count that does not satisfy the hop count threshold. However, Belleschi teaches the apparatus wherein the one or more processors are further configured to: discard, from the one or more memories, stored data associated with resource reservations, from the set of resource reservations, that are associated with a hop count that does not satisfy the hop count threshold ([0034], [0040]-[0041], reservations that are determined to be irrelevant (e.g. originating from UEs outside effective interference range are excluded from further consideration; exclusion is discarding stored reservation data that does not meet proximity/topology criteria; hop-count-based irrelevance is simply one topological criterion for exclusion) . It would have been obvious to a person of ordinary skill in the art, at the effective filing date of the invention, to combine the sidelink resource reservation techniques of Ganesan, which teaches receiving sidelink control messages indicating resources reserved by neighboring UEs, with the resource-processing and feedback mechanisms of Belleschi, which teaches receiving reservation-related sidelink messages and transmitting a second message conveying selected resource information to another UE. Further, Belleschi teaches selecting only a bounded subset of resources from received reservations, which naturally motivates reporting only a subset—preferably those received earlier and within a maximum quality. The motivation to combine the references would be to efficiently coordinate sidelink transmissions by leveraging known sidelink reservation signaling while limiting signaling overhead and collisions through selective reporting of only a bounded, prioritized subset of received resource reservations to neighboring UEs. Regarding claim 22, Ganesan fails to teach but Belleschi teaches the apparatus wherein the subset of resource reservations are associated with a quantity of resources/subchannels that satisfies a resource/subchannel threshold ([0026]-[0027], [0034], repeatedly discusses candidate sets, resource pools, and selection of only a limited number of resources from a larger pool; the size of the selected set if bounded, which is directly equivalent to a resource/subchannel quantity threshold; a reservation may cover one or more radio resources, explicitly recognizing reservation size; UE selects a subset of resources from the resource pool, with the subset size constrained (e.g. ~20%); Selecting reservations only if they fit within a bounded subset size inherently applies a resource/subchannel threshold) . It would have been obvious to a person of ordinary skill in the art, at the effective filing date of the invention, to combine the sidelink resource reservation techniques of Ganesan, which teaches receiving sidelink control messages indicating resources reserved by neighboring UEs, with the resource-processing and feedback mechanisms of Belleschi, which teaches receiving reservation-related sidelink messages and transmitting a second message conveying selected resource information to another UE. Further, Belleschi teaches selecting only a bounded subset of resources from received reservations, which naturally motivates reporting only a subset—preferably those received earlier and within a maximum quality. The motivation to combine the references would be to efficiently coordinate sidelink transmissions by leveraging known sidelink reservation signaling while limiting signaling overhead and collisions through selective reporting of only a bounded, prioritized subset of received resource reservations to neighboring UEs. Regarding claim 23, Ganesan fails to teach the apparatus wherein the one or more processors are further configured to: discard, from the one or more memories, stored data associated with resource reservations, from the set of resource reservations, that are associated with a quantity of resources/subchannels that does not satisfy the resource/subchannel threshold. However, Belleschi teaches the apparatus wherein the one or more processors are further configured to: discard, from the one or more memories, stored data associated with resource reservations, from the set of resource reservations, that are associated with a quantity of resources/subchannels that does not satisfy the resource/subchannel threshold ([0034], [0037]- [0039], resources that do not fit within the selected subset are excluded and not retained as candidate resources; exclusions are discarding stored reservation information associated with oversized or non-selected reservations; After ranking and selection, only the subset of candidate resources is retained; other are excluded; SCI-indicated reservations not selected into the candidate set are not used for subsequent transmission decisions; a reservation exceeding the allowed quantity necessarily fails the threshold and is therefore excluded). It would have been obvious to a person of ordinary skill in the art, at the effective filing date of the invention, to combine the sidelink resource reservation techniques of Ganesan, which teaches receiving sidelink control messages indicating resources reserved by neighboring UEs, with the resource-processing and feedback mechanisms of Belleschi, which teaches receiving reservation-related sidelink messages and transmitting a second message conveying selected resource information to another UE. Further, Belleschi teaches selecting only a bounded subset of resources from received reservations, which naturally motivates reporting only a subset—preferably those received earlier and within a maximum quality. The motivation to combine the references would be to efficiently coordinate sidelink transmissions by leveraging known sidelink reservation signaling while limiting signaling overhead and collisions through selective reporting of only a bounded, prioritized subset of received resource reservations to neighboring UEs. Regarding claim 27, Ganesan teaches an apparatus for wireless communication at a network node, comprising: one or more memories (claim 1 processor and memory) ; and one or more processors (claim 1 processor and memory) , coupled to the one or more memories, configured to: But Ganesan fails to teach but Belleschi teaches transmit, to a user equipment (UE), at least one parameter to determine a subset of resource reservations from a set of resource reservations, to include in a resource information message on one or more sidelink channels ([0039]-[0041], disclosure the receive[Wingdings font/0xE0]process[Wingdings font/0xE0]transmit pattern where a UE receives SCI indicating a candidate set of radio resources, reservation for future transmissions; in response, UE sends a feedback message conveying information about those resources to another UE; the feedback message does not retransmit all received reservations, but instead conveys derived information for a selected portion/set (subset) (candidate set, alternative set, status-indicated set)) . It would have been obvious to a person of ordinary skill in the art, at the effective filing date of the invention, to combine the sidelink resource reservation techniques of Ganesan, which teaches receiving sidelink control messages indicating resources reserved by neighboring UEs, with the resource-processing and feedback mechanisms of Belleschi, which teaches receiving reservation-related sidelink messages and transmitting a second message conveying selected resource information to another UE. Further, Belleschi teaches selecting only a bounded subset of resources from received reservations, which naturally motivates reporting only a subset—preferably those received earlier and within a maximum quality. The motivation to combine the references would be to efficiently coordinate sidelink transmissions by leveraging known sidelink reservation signaling while limiting signaling overhead and collisions through selective reporting of only a bounded, prioritized subset of received resource reservations to neighboring UEs. Regarding claim 30, Ganesan fails to teach the apparatus wherein the at least one parameter includes a length of a time window. However, Belleschi teaches the apparatus wherein the at least one parameter includes a length of a time window ([0034]-[0035], UE performs sensing over a sensing time window preceding resource reselection, and processes reservations (SCI) received within that window; resource exclusion and subset selection are explicitly ties to the time window used for sensing and reservation collection; subset selection is explicitly time-window-based) . It would have been obvious to a person of ordinary skill in the art, at the effective filing date of the invention, to combine the sidelink resource reservation techniques of Ganesan, which teaches receiving sidelink control messages indicating resources reserved by neighboring UEs, with the resource-processing and feedback mechanisms of Belleschi, which teaches receiving reservation-related sidelink messages and transmitting a second message conveying selected resource information to another UE. Further, Belleschi teaches selecting only a bounded subset of resources from received reservations, which naturally motivates reporting only a subset—preferably those received earlier and within a maximum quality. The motivation to combine the references would be to efficiently coordinate sidelink transmissions by leveraging known sidelink reservation signaling while limiting signaling overhead and collisions through selective reporting of only a bounded, prioritized subset of received resource reservations to neighboring UEs. Regarding claim 31, Ganesan fails to teach the apparatus wherein the length of the time window is selected from a plurality of preconfigured values stored in the one or more memories. However, Belleschi teaches the apparatus wherein the length of the time window is selected from a plurality of preconfigured values stored in the one or more memories ([0035], the sensing time window is describes as configured/predefined and used repeatedly for sensing and selection; sensing time window is discussed as a defined window whose size may be fixed or configured, implying storage as a configuration parameter) . It would have been obvious to a person of ordinary skill in the art, at the effective filing date of the invention, to combine the sidelink resource reservation techniques of Ganesan, which teaches receiving sidelink control messages indicating resources reserved by neighboring UEs, with the resource-processing and feedback mechanisms of Belleschi, which teaches receiving reservation-related sidelink messages and transmitting a second message conveying selected resource information to another UE. Further, Belleschi teaches selecting only a bounded subset of resources from received reservations, which naturally motivates reporting only a subset—preferably those received earlier and within a maximum quality. The motivation to combine the references would be to efficiently coordinate sidelink transmissions by leveraging known sidelink reservation signaling while limiting signaling overhead and collisions through selective reporting of only a bounded, prioritized subset of received resource reservations to neighboring UEs . Response to Arguments 07-37 AIA Applicant's arguments filed Applicant Arguments/REMARKS have been fully considered but they are not persuasive. Applicant’s arguments have been considered but are not persuasive. Applicant asserts that the pending claims were amended in accordance with the substance of the interview and that the Examiner agreed that the proposed amendments would overcome the applied references (Applicant’s Arguments pg. 1-2). However, the claims currently presented do not appear to include the material limitations discussed during the interview. As reflected in the interview summary, the proposed amendments were directed to features from the specification, including listening to at least one other UEs served by the same base station and at least one other UE served by a neighboring base station to receive sidelink control messages; determining that the UE and another UE have selected or reserved the same resource or transmission pattern for the same time period; and transmitting a message that includes as instruction, such as a command requesting cancellation of a transmission, a command requesting reduced transmission power, CSI-RS configuration information, or a relative timing advance (Examiner Interview Summary pg. 1 for specific Applicant specification paragraphs mentioned). By contrast, amended claim 1 (among the other claims) merely recites transmitting, to a second UE, “a resource information message that indicates a subset of resource reservations of the set of resource reservations. This amendment does not require listening to UEs associated with both a serving base station and a neighboring base station, does not require determining a collision or overlap in which the UE and another UE selected or reserved the same resource or transmission pattern for the same time period, and does not require that the transmitted message include any of the instructed-based content discussed during the interview. Thus, the amendment is not commensurate in scope with the proposed subject matter discussed during the interview and does not incorporate the features that allegedly distinguished over the applied references. Further, the presently recited “resource information message” limitation remains broad. For example, Ganesan teaches sidelink control/SPI messaging indicating selected and reserved resources or transmission patterns, and further teaches listening to other UEs to receive sidelink control messages indicating resources or transmission patterns reserved by those UEs (Ganesan [0032]-[0034], [0038]-[0039]). Belleschi likewise teaches SCI indicating a candidate set of resources, including reservation of that candidate set for further time slots, and feedback/status information regarding the resources (Belleschi [0037]-[0041]. Accordingly, the broad claim language as actually amended does not require the narrower conflict-resolution or instruction-based features discussed during the interview. Accordingly, Applicant’s reliance on the interview is not persuasive. Any indication during the interview that proposed amendments may overcome the applied rejection was based on the proposed inclusion of the narrower features discussed above. Because the claims as actually amended do not recite those features Applicant has not addressed the rejection as applied to the claim language actually pending under its broadest reasonable interpretation. The claim does not require the particular conflict-resolution, cell-edge, same-BS/neighboring-BS listening, overlapping-resource determination, or instruction-based SPI features identified in the interview summary. Therefore, Applicant’s arguments are not commensurate in scope with amended claim 1. For the same reasons, Applicant’s arguments regarding independent claims 27 and 38 are not persuasive to the extent those claims include similarly broad language and likewise omit the narrower features discussed during the interview. The dependent claims are not separately argued with particularity and therefore fall with their respective independent claims. Applicant’s compact prosecution argument is also unpersuasive. The Notice of References Cited and the prior search do not constitute an acknowledgement that no further search or examination may be required after amendment. Rather, the Office may conduct further search or examination when claim amendments or the written record require additional consideration. In any event, the present rejection may be maintained because the pending claims do not include the narrower limitations that formed the basis of the interview discussion. Accordingly, the rejection of claims 1-18, 22-23, 27, 30-31, 38, & 40-41 under 35 USC 103 over Ganesan in view of Belleschi is maintained. Conclusion 07-39 AIA THIS ACTION IS MADE FINAL. Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a). A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action. Any inquiry concerning this communication or earlier communications from the examiner should be directed to MICHAEL WILLIAM ABBATINE whose telephone number is (571)272-0192. The examiner can normally be reached Monday-Friday 0830-1700 EST. Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Nishant Divecha can be reached at (571) 270-3125. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /MICHAEL WILLIAM ABBATINE JR./Examiner, Art Unit 2419 /Nishant Divecha/Supervisory Patent Examiner, Art Unit 2419 Application/Control Number: 18/574,252 Page 2 Art Unit: 2419 Application/Control Number: 18/574,252 Page 3 Art Unit: 2419 Application/Control Number: 18/574,252 Page 4 Art Unit: 2419 Application/Control Number: 18/574,252 Page 5 Art Unit: 2419 Application/Control Number: 18/574,252 Page 6 Art Unit: 2419 Application/Control Number: 18/574,252 Page 7 Art Unit: 2419 Application/Control Number: 18/574,252 Page 8 Art Unit: 2419 Application/Control Number: 18/574,252 Page 9 Art Unit: 2419 Application/Control Number: 18/574,252 Page 10 Art Unit: 2419 Application/Control Number: 18/574,252 Page 11 Art Unit: 2419 Application/Control Number: 18/574,252 Page 12 Art Unit: 2419 Application/Control Number: 18/574,252 Page 13 Art Unit: 2419 Application/Control Number: 18/574,252 Page 14 Art Unit: 2419 Application/Control Number: 18/574,252 Page 15 Art Unit: 2419 Application/Control Number: 18/574,252 Page 16 Art Unit: 2419 Application/Control Number: 18/574,252 Page 17 Art Unit: 2419 Application/Control Number: 18/574,252 Page 18 Art Unit: 2419 Application/Control Number: 18/574,252 Page 19 Art Unit: 2419 Application/Control Number: 18/574,252 Page 20 Art Unit: 2419 Application/Control Number: 18/574,252 Page 21 Art Unit: 2419
Prosecution Insights