{"as_of":"2026-08-21T13:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:96f469eb90a2cb7b094b812df408106b434a666093c376ba171531f7c210776d","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T04:59:34.692515Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.09163/citation-record","integrity":"/paper/2607.09163/integrity","json":"/paper/2607.09163/citation-record.json","paper":"/paper/2607.09163"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T04:59:34.692515Z","title":null,"venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.09163","last_updated":"2026-07-10T07:34:57Z","snapshot_observed_at":"2026-08-15T23:08:40.757486Z","submitted_at":"2026-07-10T07:34:57Z","title":"Beyond F5 and GVW: The Proper-Cover Algorithm for Fast Ideal Basis Computation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-13T04:59:34.692515Z"},"links":{"citing_paper":"/paper/2607.09163"},"observation_digest":"sha256:cafc24592125a70c62e157a668d7d34ed4e2c16cbbc61b278273a03c816ed685","observation_id":"7f2d18bb-b5f4-43d6-99bb-c5a766e01a2b","resolution":{"observed_at":"2026-07-13T04:59:34.692515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jsc.2011.05.004","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Arri and J","venue":"Journal of Symbolic Computation","work_id":"6a01a529-76f3-4361-be5f-d22a80432241","year":2011},"citing_paper":{"arxiv_id":"2607.09163","last_updated":"2026-07-10T07:34:57Z","snapshot_observed_at":"2026-08-15T23:08:40.757486Z","submitted_at":"2026-07-10T07:34:57Z","title":"Beyond F5 and GVW: The Proper-Cover Algorithm for Fast Ideal Basis Computation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-13T04:59:34.692515Z"},"links":{"citing_paper":"/paper/2607.09163"},"observation_digest":"sha256:c5ffcbe62e1dea048eb878c7539fc930a3c362238cb760a79a7afe9f6ef0aeaf","observation_id":"ff1c30fa-96c9-4368-ae47-459bb1561766","resolution":{"observed_at":"2026-07-13T05:09:24.982127Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[{"edge_observation":{"observed_at":"2026-07-13T06:30:08.542308+00:00","source":"paper_reference_links","state":"open"},"event_date":"2017-01-13","event_type":"correction","notice_doi":"10.1016/j.jsc.2016.12.002","provenance":{"observed_at":"2026-07-11T03:17:28.846397+00:00","source":"crossref","source_record_id":"10.1016/j.jsc.2016.12.002->10.1016/j.jsc.2011.05.004:correction"}}],"reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T04:59:34.692515Z","title":"Buchberger, An algorithm for finding the basis elements of the residue class ring of a zero-dimensional polynomial ideal, Journal of Symbolic Computation, 41 (2006), no","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.09163","last_updated":"2026-07-10T07:34:57Z","snapshot_observed_at":"2026-08-15T23:08:40.757486Z","submitted_at":"2026-07-10T07:34:57Z","title":"Beyond F5 and GVW: The Proper-Cover Algorithm for Fast Ideal Basis Computation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-13T04:59:34.692515Z"},"links":{"citing_paper":"/paper/2607.09163"},"observation_digest":"sha256:897967c61a6bfe4650a1cac43dca3d1c4d6d9b7d4f9b98e8b53d7b38a75689b9","observation_id":"c73706a3-f661-48a9-ac4f-3b742b1cdda4","resolution":{"observed_at":"2026-07-13T04:59:34.692515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T04:59:34.692515Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.09163","last_updated":"2026-07-10T07:34:57Z","snapshot_observed_at":"2026-08-15T23:08:40.757486Z","submitted_at":"2026-07-10T07:34:57Z","title":"Beyond F5 and GVW: The Proper-Cover Algorithm for Fast Ideal Basis Computation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-13T04:59:34.692515Z"},"links":{"citing_paper":"/paper/2607.09163"},"observation_digest":"sha256:8ce4bb109860c0bf147ade24e6ed8c928abddee46c5c7123703093a90163ce4a","observation_id":"bd5f7a83-2864-4620-a315-d1ca91602835","resolution":{"observed_at":"2026-07-13T04:59:34.692515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T04:59:34.692515Z","title":"Faugère, A new efficient algorithm for computing Gröbner bases (F4), Journal of Pure and Applied Algebra, 139 (1999), 61–88","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.09163","last_updated":"2026-07-10T07:34:57Z","snapshot_observed_at":"2026-08-15T23:08:40.757486Z","submitted_at":"2026-07-10T07:34:57Z","title":"Beyond F5 and GVW: The Proper-Cover Algorithm for Fast Ideal Basis Computation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-13T04:59:34.692515Z"},"links":{"citing_paper":"/paper/2607.09163"},"observation_digest":"sha256:58b148f5fbea51669085e7e4de266bad68ff3b2f2cc5690484a9c2acd2a73f2f","observation_id":"e20ccdc6-e18e-4a11-bc92-91e1001cc052","resolution":{"observed_at":"2026-07-13T04:59:34.692515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T04:59:34.692515Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.09163","last_updated":"2026-07-10T07:34:57Z","snapshot_observed_at":"2026-08-15T23:08:40.757486Z","submitted_at":"2026-07-10T07:34:57Z","title":"Beyond F5 and GVW: The Proper-Cover Algorithm for Fast Ideal Basis Computation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-13T04:59:34.692515Z"},"links":{"citing_paper":"/paper/2607.09163"},"observation_digest":"sha256:c02ba78b70ff029f01be4101640721b2eb756c5cc478f8d83ef3565536709f9f","observation_id":"d5e86819-5b8f-4b53-afbb-995209fcba2b","resolution":{"observed_at":"2026-07-13T04:59:34.692515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T04:59:34.692515Z","title":"Eder and T","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.09163","last_updated":"2026-07-10T07:34:57Z","snapshot_observed_at":"2026-08-15T23:08:40.757486Z","submitted_at":"2026-07-10T07:34:57Z","title":"Beyond F5 and GVW: The Proper-Cover Algorithm for Fast Ideal Basis Computation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-13T04:59:34.692515Z"},"links":{"citing_paper":"/paper/2607.09163"},"observation_digest":"sha256:6384dc881d3120e2888a26be208dff922238f92f81ea2223afc21015bf009366","observation_id":"0cdf909e-ab2f-4b86-a3bd-62c6975941ce","resolution":{"observed_at":"2026-07-13T04:59:34.692515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jsc.2016.07.031","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Eder and J.-C","venue":"Journal of Symbolic Computation","work_id":"51121878-d8a1-4e94-8ed9-881849cd9a94","year":2017},"citing_paper":{"arxiv_id":"2607.09163","last_updated":"2026-07-10T07:34:57Z","snapshot_observed_at":"2026-08-15T23:08:40.757486Z","submitted_at":"2026-07-10T07:34:57Z","title":"Beyond F5 and GVW: The Proper-Cover Algorithm for Fast Ideal Basis Computation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-13T04:59:34.692515Z"},"links":{"citing_paper":"/paper/2607.09163"},"observation_digest":"sha256:4374c37bb7f92b9dcfdcdf85f181b9ffce346f799832ae356e554ef3f5774a0c","observation_id":"b5e6a51c-5294-4766-a6ca-fc35b5be4c87","resolution":{"observed_at":"2026-07-13T05:09:24.985385Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:52.986666+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:52.986666+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T04:59:34.692515Z","title":"Eder and J","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.09163","last_updated":"2026-07-10T07:34:57Z","snapshot_observed_at":"2026-08-15T23:08:40.757486Z","submitted_at":"2026-07-10T07:34:57Z","title":"Beyond F5 and GVW: The Proper-Cover Algorithm for Fast Ideal Basis Computation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-13T04:59:34.692515Z"},"links":{"citing_paper":"/paper/2607.09163"},"observation_digest":"sha256:51d738b889f5f5931ff70e30e9a66a044f670bc392b00ac4e9436b84809d69aa","observation_id":"943d4431-e083-4f60-a3d0-a1fe82669e3d","resolution":{"observed_at":"2026-07-13T04:59:34.692515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11786-019-00432-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Francis and T","venue":"Mathematics in Computer Science","work_id":"b8b44360-9cf6-4362-864c-cb1801df8d54","year":2020},"citing_paper":{"arxiv_id":"2607.09163","last_updated":"2026-07-10T07:34:57Z","snapshot_observed_at":"2026-08-15T23:08:40.757486Z","submitted_at":"2026-07-10T07:34:57Z","title":"Beyond F5 and GVW: The Proper-Cover Algorithm for Fast Ideal Basis Computation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-13T04:59:34.692515Z"},"links":{"citing_paper":"/paper/2607.09163"},"observation_digest":"sha256:9464c6bd2822b9954ea271828ca653960cf07f4eb950b24b991c36e7e5eca4f7","observation_id":"09aa0d66-bd09-473f-8dd2-df1448dbdde5","resolution":{"observed_at":"2026-07-13T05:09:24.978346Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-07-13T09:19:53.229326+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T09:19:53.229326+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T04:59:34.692515Z","title":"Faugère, P","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2607.09163","last_updated":"2026-07-10T07:34:57Z","snapshot_observed_at":"2026-08-15T23:08:40.757486Z","submitted_at":"2026-07-10T07:34:57Z","title":"Beyond F5 and GVW: The Proper-Cover Algorithm for Fast Ideal Basis Computation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-13T04:59:34.692515Z"},"links":{"citing_paper":"/paper/2607.09163"},"observation_digest":"sha256:83a389e0443ed6413dd99d908fc3da85362ea79a640e300c3922d7e67074ee61","observation_id":"aaac34d0-e8e6-493b-a7c5-2515b92f2c03","resolution":{"observed_at":"2026-07-13T04:59:34.692515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T04:59:34.692515Z","title":"Lazard, Solving zero-dimensional algebraic systems, Journal of Symbolic Computation, 13 (1992), no","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.09163","last_updated":"2026-07-10T07:34:57Z","snapshot_observed_at":"2026-08-15T23:08:40.757486Z","submitted_at":"2026-07-10T07:34:57Z","title":"Beyond F5 and GVW: The Proper-Cover Algorithm for Fast Ideal Basis Computation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-13T04:59:34.692515Z"},"links":{"citing_paper":"/paper/2607.09163"},"observation_digest":"sha256:ad9943c43a222816d0bed2098612dd5ba5c0b3d1be2e52efd1b4a49185d03028","observation_id":"a7478d4c-34c5-40ef-aeb7-05382478b199","resolution":{"observed_at":"2026-07-13T04:59:34.692515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T04:59:34.692515Z","title":"von zur Gathen and J","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.09163","last_updated":"2026-07-10T07:34:57Z","snapshot_observed_at":"2026-08-15T23:08:40.757486Z","submitted_at":"2026-07-10T07:34:57Z","title":"Beyond F5 and GVW: The Proper-Cover Algorithm for Fast Ideal Basis Computation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-13T04:59:34.692515Z"},"links":{"citing_paper":"/paper/2607.09163"},"observation_digest":"sha256:bad769fef1fba32734ab193a9eec1aa2d2df62c275875f878b087f1abe1f1f2d","observation_id":"9a7ed706-9cb3-47ee-b36d-ed7d6ed5d213","resolution":{"observed_at":"2026-07-13T04:59:34.692515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T04:59:34.692515Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.09163","last_updated":"2026-07-10T07:34:57Z","snapshot_observed_at":"2026-08-15T23:08:40.757486Z","submitted_at":"2026-07-10T07:34:57Z","title":"Beyond F5 and GVW: The Proper-Cover Algorithm for Fast Ideal Basis Computation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-13T04:59:34.692515Z"},"links":{"citing_paper":"/paper/2607.09163"},"observation_digest":"sha256:b38edf6ff058694a2489d7ff2c0fe0411b9672609d48a8ab58440646528dd7d0","observation_id":"3ad4bb54-a71a-4cdb-a9fc-e4123bed2651","resolution":{"observed_at":"2026-07-13T04:59:34.692515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.03482","last_updated":"2025-01-03T15:43:40Z","snapshot_observed_at":"2026-08-16T18:53:17.870474Z","submitted_at":"2021-01-10T06:29:49Z","title":"The Proper Basis for Polynomial Ideals","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.03482","snapshot_observed_at":"2026-07-13T04:59:34.692515Z","title":"Ma, A new type of bases for zero-dimensional ideals, arXiv:2101.03482v1, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.09163","last_updated":"2026-07-10T07:34:57Z","snapshot_observed_at":"2026-08-15T23:08:40.757486Z","submitted_at":"2026-07-10T07:34:57Z","title":"Beyond F5 and GVW: The Proper-Cover Algorithm for Fast Ideal Basis Computation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-13T04:59:34.692515Z"},"links":{"cited_paper":"/paper/2101.03482","citing_paper":"/paper/2607.09163"},"observation_digest":"sha256:dece14fc9fe68b8b7bbdacd4c6605af2e095c4307de75161a1d63a58951240c1","observation_id":"bf6057d3-9738-4dc7-b399-16bb36712bd4","resolution":{"observed_at":"2026-07-13T04:59:34.692515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T04:59:34.692515Z","title":null,"venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.09163","last_updated":"2026-07-10T07:34:57Z","snapshot_observed_at":"2026-08-15T23:08:40.757486Z","submitted_at":"2026-07-10T07:34:57Z","title":"Beyond F5 and GVW: The Proper-Cover Algorithm for Fast Ideal Basis Computation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-13T04:59:34.692515Z"},"links":{"citing_paper":"/paper/2607.09163"},"observation_digest":"sha256:0ee431a995dac945a72528833f8ef9e36ec95212fc9cb714114b7c456a38cb4b","observation_id":"46979bcb-bf8d-4ee9-ba61-35427289a8b2","resolution":{"observed_at":"2026-07-13T04:59:34.692515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.09163","last_updated":"2026-07-10T07:34:57Z","latest_version":1,"primary_category":"cs.SC","snapshot_observed_at":"2026-08-15T23:08:40.757486Z","submitted_at":"2026-07-10T07:34:57Z","title":"Beyond F5 and GVW: The Proper-Cover Algorithm for Fast Ideal Basis Computation"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":3,"verified_fuzzy":0},"total_outbound_references":16},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2607.09163."}