CTNF 19/052,369 CTNF 89353 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. Claim Objections 07-29-01 AIA Claim 1 is objected to because of the following informalities: Claim 1 recites the limitation “transmitting the encoded over a channel…” There appears to be an omission of the word “bitstream” after “encoded” . Appropriate correction is required. Double Patenting 08-33 AIA The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the conflicting claims are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg , 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman , 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi , 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum , 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel , 422 F.2d 438, 164 USPQ 619 (CCPA 1970); In re Thorington , 418 F.2d 528, 163 USPQ 644 (CCPA 1969). A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on nonstatutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP § 2146 et seq. for applications not subject to examination under the first inventor to file provisions of the AIA. A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b). The filing of a terminal disclaimer by itself is not a complete reply to a nonstatutory double patenting (NSDP) rejection. A complete reply requires that the terminal disclaimer be accompanied by a reply requesting reconsideration of the prior Office action. Even where the NSDP rejection is provisional the reply must be complete. See MPEP § 804, subsection I.B.1. For a reply to a non-final Office action, see 37 CFR 1.111(a). For a reply to final Office action, see 37 CFR 1.113(c). A request for reconsideration while not provided for in 37 CFR 1.113(c) may be filed after final for consideration. See MPEP §§ 706.07(e) and 714.13. The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The actual filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA/25, or PTO/AIA/26) should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to www.uspto.gov/patents/apply/applying-online/eterminal-disclaimer. 08-36 AIA Claim s 1 – 5 are rejected on the ground of nonstatutory double patenting as being unpatentable over claim s 1 - 5 of U.S. Patent No. 11,792,417 in view of Lin et al. (US 2020/0059651) (hereinafter Lin) . Regarding claim 1 , U.S. Patent No. 11,792,417 claims a method of transmitting an encoded bitstream comprising: encoding a bit stream to be decoded by a compatible decoder, the encoded bitstream including a coded picture, the coded picture including a first contiguous region comprising a first plurality of coding blocks and a second contiguous region comprising a second plurality of coding blocks, the first contiguous region containing common motion, the second contiguous region containing local motion (claim 1, col 20, lines 27 – 32) ; the decoder receiving the encoded bitstream (claim 1, col 20, lines 27 – 32) ; decoding the first contiguous region of the coded picture to reconstruct the common motion by (claim 1, col 20, lines 33 – 34) : for each coding block of the first plurality of coding blocks in the first region, utilize a motion model, the motion model being common to all of the first plurality of coding blocks in the first region, the common motion model being one of translational motion, 4-parameter affine motion, or 6- parameter affine motion (claim 1, col 20, lines 35 – 41) ; if the common motion model is translational motion, construct, for each of the first plurality of coding blocks in the first contiguous region, a merge candidate list including a first candidate which is a motion vector of a neighbor block in the picture, and decode each of the first plurality of coding blocks in the first contiguous region using the merge list by selecting the first candidate for translational motion compensation (claim 1, col 20, lines 42 – 50) ; if the common motion model is 4-parameter affine motion, construct, for each of the first plurality of coding blocks in the first contiguous region, a merge candidate list including a second candidate comprising two control point motion vectors, each being a motion vector of a neighbor block in the picture, and decode each of the first plurality of coding blocks in the first contiguous region using the merge list by selecting the second candidate for 4-parameter affine motion compensation (claim 1, col 20, lines 51 – 60) ; if the common motion model is 6-parameter affine motion, construct, for each of the first plurality of coding blocks in the first contiguous region, a merge candidate list including a third candidate comprising three control point motion vectors, each being a motion vector of a neighbor block in the picture, and decode each of the first plurality of coding blocks in the first contiguous region using the merge list by selecting the third candidate for 6-parameter affine motion compensation (claim 1, col 20, line 61 – col 21, line 3) ; and decoding the second contiguous region of the coded picture to reconstruct the local motion by decoding each of the second plurality of coding blocks in the second contiguous region using individual motion information for each of the second plurality of coding blocks in the second contiguous region (claim 1, col 21, lines 4 – 9) . U.S. Patent No. 11,792,417 does not explicitly claim: -transmitting the encoded over a channel to the compatible decoder. Lin, however, teaches a method of transmitting an encoded bitstream: transmitting the encoded over a channel to the compatible decoder (e.g. Fig. 1 and par. 49: depicting and describing that the system transmits encoded video data to a decoding device, wherein the encoded video data is the equivalent of the encoded bitstream) . It therefore would have been obvious to one of ordinary skill in the art to modify the claims of U.S. Patent No. 11,792,417 by adding the teachings of Lin in order transmit the encoded bitstream over a channel to a compatible decoder. One of ordinary skill in the art would have been motivated to make such a modification because the modification improves coding efficiency. Turning to claim 2 , U.S. Patent No. 11,792,417 and Lin claim all of the limitations of claim 1, as discussed above. U.S. Patent No. 11,792,417 further claims: wherein the bitstream signals motion vector differences to be used with one or more of the first candidate, the second candidate, or third candidate to decode each of the first plurality of coding blocks in the first contiguous region (claim 2, col 21, lines 10 – 14) . Regarding claim 3 , U.S. Patent No. 11,792,417 and Lin claim all of the limitations of claims 1 and 2, as discussed above. U.S. Patent No. 11,792,417 further claims: wherein one of the coding blocks in the first plurality of coding blocks in the first contiguous region is 64x64 or 128x128 (claim 3, col 21, lines 15 – 17) . Turning to claim 4 , U.S. Patent No. 11,792,417 and Lin claim all of the limitations of claim 1, as discussed above. U.S. Patent No. 11,792,417 further claims: wherein the common motion in the first contiguous region is caused by camera motion (claim 5, col 21, lines 21 – 22) . Regarding claim 5 , U.S. Patent No. 11,792,417 and Lin claim all of the limitations of claims 1 - 3, as discussed above. U.S. Patent No. 11,792,417 further claims: wherein the local motion in the second contiguous region is caused by motion of an object in a scene (claim 4, col 21, lines 18 – 20) . 08-34 AIA Claim s 6 – 10 are rejected on the ground of nonstatutory double patenting as being unpatentable over claim s 1 - 5 of U.S. Patent No. 11,792,417 . Although the claims at issue are not identical, they are not patentably distinct from each other because the scope of the patented claims wholly encompasses the scope of the current invention . Current Application U.S. Patent No. 11,792,417 6. A non-transitory computer readable media encoded with instructions for a processor to perform a method of decoding video comprising : receiving a bitstream including a coded picture, the coded picture including a first contiguous region comprising a first plurality of coding blocks and a second contiguous region comprising a second plurality of coding blocks, the first contiguous region containing common motion, the second contiguous region containing local motion ; decoding the first contiguous region of the coded picture to reconstruct the common motion by : for each coding block of the first plurality of coding blocks in the first region, utilize a motion model, the motion model being common to all of the first plurality of coding blocks in the first region, the common motion model being one of translational motion, 4-parameter affine motion, or 6- parameter affine motion ; if the common motion model is translational motion, construct, for each of the first plurality of coding blocks in the first contiguous region, a merge candidate list including a first candidate which is a motion vector of a neighbor block in the picture, and decode each of the first plurality of coding blocks in the first contiguous region using the merge list by selecting the first candidate for translational motion compensation ; if the common motion model is 4-parameter affine motion, construct, for each of the first plurality of coding blocks in the first contiguous region, a merge candidate list including a second candidate comprising two control point motion vectors, each being a motion vector of a neighbor block in the picture, and decode each of the first plurality of coding blocks in the first contiguous region using the merge list by selecting the second candidate for 4-parameter affine motion compensation ; if the common motion model is 6-parameter affine motion, construct, for each of the first plurality of coding blocks in the first contiguous region, a merge candidate list including a third candidate comprising three control point motion vectors, each being a motion vector of a neighbor block in the picture, and decode each of the first plurality of coding blocks in the first contiguous region using the merge list by selecting the third candidate for 6-parameter affine motion compensation; and decoding each of the second plurality of coding blocks in the second contiguous region using individual motion information for each of the second plurality of coding blocks in the second contiguous region, whereby local motion in the second contiguous region is recreated . 1. A decoder, the decoder comprising circuitry configured to: receive a bitstream including a coded picture, the coded picture including a first contiguous region comprising a first plurality of coding blocks and a second contiguous region comprising a second plurality of coding blocks, the first contiguous region containing common motion, the second contiguous region containing local motion ; decode the first contiguous region of the coded picture to reconstruct the common motion by : for each coding block of the first plurality of coding blocks in the first region, utilize a motion model, the motion model being common to all of the first plurality of coding blocks in the first region, the common motion model being one of translational motion, 4-parameter affine motion, or 6-parameter affine motion ; if the common motion model is translational motion, construct, for each of the first plurality of coding blocks in the first contiguous region, a merge candidate list including a first candidate which is a motion vector of a neighbor block in the picture, and decode each of the first plurality of coding blocks in the first contiguous region using the merge list by selecting the first candidate for translational motion compensation ; if the common motion model is 4-parameter affine motion, construct, for each of the first plurality of coding blocks in the first contiguous region, a merge candidate list including a second candidate comprising two control point motion vectors, each being a motion vector of a neighbor block in the picture, and decode each of the first plurality of coding blocks in the first contiguous region using the merge list by selecting the second candidate for 4-parameter affine motion compensation; if the common motion model is 6-parameter affine motion, construct, for each of the first plurality of coding blocks in the first contiguous region, a merge candidate list including a third candidate comprising three control point motion vectors, each being a motion vector of a neighbor block in the picture, and decode each of the first plurality of coding blocks in the first contiguous region using the merge list by selecting the third candidate for 6-parameter affine motion compensation; and decode the second contiguous region of the coded picture to reconstruct the local motion by decoding each of the second plurality of coding blocks in the second contiguous region using individual motion information for each of the second plurality of coding blocks in the second contiguous region. 7. The non-transitory computer readable medium of claim 6, wherein the bitstream signals motion vector differences to be used with one or more of the first candidate, the second candidate, or third candidate to decode each of the first plurality of coding blocks in the first contiguous region . 2. The decoder of claim 1, wherein the bitstream signals motion vector differences to be used with one or more of the first candidate, the second candidate, or third candidate to decode each of the first plurality of coding blocks in the first contiguous region . 8. The non-transitory computer readable medium of claim 7, wherein one of the coding blocks in the first plurality of coding blocks in the first contiguous region is 64x64 or 128x128 . 3. The decoder of claim 2, wherein one of the coding blocks in the first plurality of coding blocks in the first contiguous region is 64×64 or 128×128 . 9. The non-transitory computer readable medium of claim 6, wherein the common motion in the first contiguous region is caused by camera motion . 5. The decoder of claim 1, wherein the common motion in the first contiguous region is caused by camera motion . 10. The non-transitory computer readable medium of claim 9, wherein the local motion in the second contiguous region is caused by motion of an object in a scene . 4. The decoder of claim 3, wherein the local motion in the second contiguous region is caused by motion of an object in a scene . 08-36 AIA Claim s 1 - 5 rejected on the ground of nonstatutory double patenting as being unpatentable over claim s 1 - 5 of U.S. Patent No. 12,244,841 in view of Lin et al. (US 2020/0059651) (hereinafter Lin) . Regarding claim 1 , U.S. Patent No. 12,244,841 claims a method of transmitting an encoded bitstream comprising: encoding a bit stream to be decoded by a compatible decoder, the encoded bitstream including a coded picture, the coded picture including a first contiguous region comprising a first plurality of coding blocks and a second contiguous region comprising a second plurality of coding blocks, the first contiguous region containing common motion, the second contiguous region containing local motion (claim 1, col 21, lines 11 – 18) ; the decoder receiving the encoded bitstream (claim 1, col 21, lines 19 - 21) ; decoding the first contiguous region of the coded picture to reconstruct the common motion by (claim 1, col 21, lines 22 – 23) : for each coding block of the first plurality of coding blocks in the first region, utilize a motion model, the motion model being common to all of the first plurality of coding blocks in the first region, the common motion model being one of translational motion, 4-parameter affine motion, or 6- parameter affine motion (claim 1, col 21, lines 24 – 30) ; if the common motion model is translational motion, construct, for each of the first plurality of coding blocks in the first contiguous region, a merge candidate list including a first candidate which is a motion vector of a neighbor block in the picture, and decode each of the first plurality of coding blocks in the first contiguous region using the merge list by selecting the first candidate for translational motion compensation (claim 1, col 21, lines 31 – 39) ; if the common motion model is 4-parameter affine motion, construct, for each of the first plurality of coding blocks in the first contiguous region, a merge candidate list including a second candidate comprising two control point motion vectors, each being a motion vector of a neighbor block in the picture, and decode each of the first plurality of coding blocks in the first contiguous region using the merge list by selecting the second candidate for 4-parameter affine motion compensation (claim 1, col 21, line 40 – col 22, line 9) ; if the common motion model is 6-parameter affine motion, construct, for each of the first plurality of coding blocks in the first contiguous region, a merge candidate list including a third candidate comprising three control point motion vectors, each being a motion vector of a neighbor block in the picture, and decode each of the first plurality of coding blocks in the first contiguous region using the merge list by selecting the third candidate for 6-parameter affine motion compensation (claim 1, col 22, lines 10 – 20) ; and decoding the second contiguous region of the coded picture to reconstruct the local motion by decoding each of the second plurality of coding blocks in the second contiguous region using individual motion information for each of the second plurality of coding blocks in the second contiguous region (claim 1, col 22, lines 21 – 27) . U.S. Patent No. 12,244,841 does not explicitly claim: -transmitting the encoded over a channel to the compatible decoder. Lin, however, teaches a method of transmitting an encoded bitstream: transmitting the encoded over a channel to the compatible decoder (e.g. Fig. 1 and par. 49: depicting and describing that the system transmits encoded video data to a decoding device, wherein the encoded video data is the equivalent of the encoded bitstream) . It therefore would have been obvious to one of ordinary skill in the art to modify the claims of U.S. Patent No. 12,244,841 by adding the teachings of Lin in order transmit the encoded bitstream over a channel to a compatible decoder. One of ordinary skill in the art would have been motivated to make such a modification because the modification improves coding efficiency. Turning to claim 2 , U.S. Patent No. 12,244,841 and Lin claim all of the limitations of claim 1, as discussed above. U.S. Patent No. 12,244,841 further claims: wherein the bitstream signals motion vector differences to be used with one or more of the first candidate, the second candidate, or third candidate to decode each of the first plurality of coding blocks in the first contiguous region (claim 2, col 22, lines 28 – 32) . Regarding claim 3 , U.S. Patent No. 12,244,841 and Lin claim all of the limitations of claims 1 and 2, as discussed above. U.S. Patent No. 12,244,841 further claims: wherein one of the coding blocks in the first plurality of coding blocks in the first contiguous region is 64x64 or 128x128 (claim 3, col 22, lines 33 – 35) . Turning to claim 4 , U.S. Patent No. 12,244,841 and Lin claim all of the limitations of claim 1, as discussed above. U.S. Patent No. 12,244,841 further claims: wherein the common motion in the first contiguous region is caused by camera motion (claim 4, col 22, lines 36 – 37) . Regarding claim 5 , U.S. Patent No. 12,244,841 and Lin claim all of the limitations of claims 1 - 3, as discussed above. U.S. Patent No. 12,244,841 further claims: wherein the local motion in the second contiguous region is caused by motion of an object in a scene (claim 5, col 22, lines 38 – 40) . 08-34 AIA Claim s 6 – 10 are rejected on the ground of nonstatutory double patenting as being unpatentable over claim s 1 - 5 of U.S. Patent No. 12,244,841 . Although the claims at issue are not identical, they are not patentably distinct from each other because the scope of the patented claims wholly encompass the scope of the current invention . Current Application U.S. Patent No. 12,244,841 6. A non-transitory computer readable media encoded with instructions for a processor to perform a method of decoding video comprising : receiving a bitstream including a coded picture, the coded picture including a first contiguous region comprising a first plurality of coding blocks and a second contiguous region comprising a second plurality of coding blocks, the first contiguous region containing common motion, the second contiguous region containing local motion ; decoding the first contiguous region of the coded picture to reconstruct the common motion by : for each coding block of the first plurality of coding blocks in the first region, utilize a motion model, the motion model being common to all of the first plurality of coding blocks in the first region, the common motion model being one of translational motion, 4-parameter affine motion, or 6- parameter affine motion ; if the common motion model is translational motion, construct, for each of the first plurality of coding blocks in the first contiguous region, a merge candidate list including a first candidate which is a motion vector of a neighbor block in the picture, and decode each of the first plurality of coding blocks in the first contiguous region using the merge list by selecting the first candidate for translational motion compensation ; if the common motion model is 4-parameter affine motion, construct, for each of the first plurality of coding blocks in the first contiguous region, a merge candidate list including a second candidate comprising two control point motion vectors, each being a motion vector of a neighbor block in the picture, and decode each of the first plurality of coding blocks in the first contiguous region using the merge list by selecting the second candidate for 4-parameter affine motion compensation ; if the common motion model is 6-parameter affine motion, construct, for each of the first plurality of coding blocks in the first contiguous region, a merge candidate list including a third candidate comprising three control point motion vectors, each being a motion vector of a neighbor block in the picture, and decode each of the first plurality of coding blocks in the first contiguous region using the merge list by selecting the third candidate for 6-parameter affine motion compensation; and decoding each of the second plurality of coding blocks in the second contiguous region using individual motion information for each of the second plurality of coding blocks in the second contiguous region, whereby local motion in the second contiguous region is recreated . 1. A video encoder having circuitry configured to : encode a bit stream to be decoded by a compatible decoder, the encoded bitstream including a coded picture, the coded picture including a first contiguous region comprising a first plurality of coding blocks and a second contiguous region comprising a second plurality of coding blocks, the first contiguous region containing common motion, the second contiguous region containing local motion ; the decoder receiving the encoded bitstream being configured to: receive the encoded bitstream ; decode the first contiguous region of the coded picture to reconstruct the common motion by: for each coding block of the first plurality of coding blocks in the first region, utilize a motion model, the motion model being common to all of the first plurality of coding blocks in the first region, the common motion model being one of translational motion, 4-parameter affine motion, or 6-parameter affine motion; if the common motion model is translational motion, construct, for each of the first plurality of coding blocks in the first contiguous region, a merge candidate list including a first candidate which is a motion vector of a neighbor block in the picture, and decode each of the first plurality of coding blocks in the first contiguous region using the merge list by selecting the first candidate for translational motion compensation; if the common motion model is 4-parameter affine motion, construct, for each of the first plurality of coding blocks in the first contiguous region, a merge candidate list including a second candidate comprising two control point motion vectors, each being a motion vector of a neighbor block in the picture, and decode each of the first plurality of coding blocks in the first contiguous region using the merge list by selecting the second candidate for 4-parameter affine motion compensation; if the common motion model is 6-parameter affine motion, construct, for each of the first plurality of coding blocks in the first contiguous region, a merge candidate list including a third candidate comprising three control point motion vectors, each being a motion vector of a neighbor block in the picture, and decode each of the first plurality of coding blocks in the first contiguous region using the merge list by selecting the third candidate for 6-parameter affine motion compensation; and decode the second contiguous region of the coded picture to reconstruct the local motion by decoding each of the second plurality of coding blocks in the second contiguous region using individual motion information for each of the second plurality of coding blocks in the second contiguous region . 7. The non-transitory computer readable medium of claim 6, wherein the bitstream signals motion vector differences to be used with one or more of the first candidate, the second candidate, or third candidate to decode each of the first plurality of coding blocks in the first contiguous region . 2. The encoder of claim 1, wherein the bitstream signals motion vector differences to be used with one or more of the first candidate, the second candidate, or third candidate to decode each of the first plurality of coding blocks in the first contiguous region . 8. The non-transitory computer readable medium of claim 7, wherein one of the coding blocks in the first plurality of coding blocks in the first contiguous region is 64x64 or 128x128 . 3. The encoder of claim 2 , wherein one of the coding blocks in the first plurality of coding blocks in the first contiguous region is 64×64 or 128×128 . 9. The non-transitory computer readable medium of claim 6, wherein the common motion in the first contiguous region is caused by camera motion . 4. The encoder of claim 1, wherein the common motion in the first contiguous region is caused by camera motion . 10. The non-transitory computer readable medium of claim 9, wherein the local motion in the second contiguous region is caused by motion of an object in a scene . 5. The encoder of claim 3, wherein the local motion in the second contiguous region is caused by motion of an object in a scene . Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to SHANIKA M BRUMFIELD whose telephone number is (571)270-3700. The examiner can normally be reached M-F 8:30 - 5 PM AWS. 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, David Czekaj can be reached at 571-272-7327. 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. SHANIKA M. BRUMFIELD Examiner Art Unit 2487 /SHANIKA M BRUMFIELD/Examiner, Art Unit 2487 /Dave Czekaj/Supervisory Patent Examiner, Art Unit 2487 Application/Control Number: 19/052,369 Page 2 Art Unit: 2487 Application/Control Number: 19/052,369 Page 3 Art Unit: 2487 Application/Control Number: 19/052,369 Page 4 Art Unit: 2487 Application/Control Number: 19/052,369 Page 5 Art Unit: 2487 Application/Control Number: 19/052,369 Page 6 Art Unit: 2487 Application/Control Number: 19/052,369 Page 7 Art Unit: 2487 Application/Control Number: 19/052,369 Page 8 Art Unit: 2487 Application/Control Number: 19/052,369 Page 9 Art Unit: 2487 Application/Control Number: 19/052,369 Page 10 Art Unit: 2487 Application/Control Number: 19/052,369 Page 11 Art Unit: 2487 Application/Control Number: 19/052,369 Page 12 Art Unit: 2487 Application/Control Number: 19/052,369 Page 13 Art Unit: 2487 Application/Control Number: 19/052,369 Page 14 Art Unit: 2487 Application/Control Number: 19/052,369 Page 15 Art Unit: 2487 Application/Control Number: 19/052,369 Page 16 Art Unit: 2487 Application/Control Number: 19/052,369 Page 17 Art Unit: 2487 Application/Control Number: 19/052,369 Page 18 Art Unit: 2487 Application/Control Number: 19/052,369 Page 19 Art Unit: 2487 Application/Control Number: 19/052,369 Page 20 Art Unit: 2487 Application/Control Number: 19/052,369 Page 21 Art Unit: 2487 Application/Control Number: 19/052,369 Page 22 Art Unit: 2487 Application/Control Number: 19/052,369 Page 23 Art Unit: 2487 Application/Control Number: 19/052,369 Page 24 Art Unit: 2487 Application/Control Number: 19/052,369 Page 25 Art Unit: 2487 Application/Control Number: 19/052,369 Page 26 Art Unit: 2487 Application/Control Number: 19/052,369 Page 27 Art Unit: 2487 Application/Control Number: 19/052,369 Page 28 Art Unit: 2487 Application/Control Number: 19/052,369 Page 29 Art Unit: 2487 Application/Control Number: 19/052,369 Page 30 Art Unit: 2487 Application/Control Number: 19/052,369 Page 31 Art Unit: 2487 Application/Control Number: 19/052,369 Page 32 Art Unit: 2487 Application/Control Number: 19/052,369 Page 33 Art Unit: 2487
Prosecution Insights