{"as_of":"2026-08-09T15:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1de4e6cdaf7ae05f5f7c181961a29d68a4da3eb1628e1a7596154fd540f76e54","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T04:40:15.709398Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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.13677/citation-record","integrity":"/paper/2607.13677/integrity","json":"/paper/2607.13677/citation-record.json","paper":"/paper/2607.13677"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/0606035","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Alon and M","venue":"SIAM Journal on Algebraic and Discrete Methods","work_id":"f8edfee9-9cf8-4263-95f9-6230570ab083","year":1985},"citing_paper":{"arxiv_id":"2607.13677","last_updated":"2026-07-15T10:18:36Z","snapshot_observed_at":"2026-08-09T06:03:38.637520Z","submitted_at":"2026-07-15T10:18:36Z","title":"Local Certification of Vertex and Edge Connectivity","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T04:40:14.010362Z"},"links":{"citing_paper":"/paper/2607.13677"},"observation_digest":"sha256:671871d311d032104799fbee5660821a210f6bad21d13321f53a1203be619d1f","observation_id":"79fe7a86-566d-4bda-80c5-28acb3c9430a","resolution":{"observed_at":"2026-08-02T04:43:29.018344Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-02T04:40:15.282839Z","title":"[Jae79] F","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2607.13677","last_updated":"2026-07-15T10:18:36Z","snapshot_observed_at":"2026-08-09T06:03:38.637520Z","submitted_at":"2026-07-15T10:18:36Z","title":"Local Certification of Vertex and Edge Connectivity","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T04:40:15.282839Z"},"links":{"citing_paper":"/paper/2607.13677"},"observation_digest":"sha256:8e13b48642fc2ad059e3ab075b91de034ff4a5c97e7250fa19971b5c1fed1760","observation_id":"2188299e-65bc-4214-84f1-4b959a20631a","resolution":{"observed_at":"2026-08-02T04:40:15.282839Z","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-08-02T04:40:14.875534Z","title":"Distributed minimum cut approximation","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.13677","last_updated":"2026-07-15T10:18:36Z","snapshot_observed_at":"2026-08-09T06:03:38.637520Z","submitted_at":"2026-07-15T10:18:36Z","title":"Local Certification of Vertex and Edge Connectivity","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T04:40:14.875534Z"},"links":{"citing_paper":"/paper/2607.13677"},"observation_digest":"sha256:83e51bc5c55a72ef329027a382a7d5d1aac0bf87afbb78f827e471c03e448ffb","observation_id":"62ca39f8-5abf-4215-a232-89258f830d4c","resolution":{"observed_at":"2026-08-02T04:40:14.875534Z","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-08-02T04:40:15.210380Z","title":"1145/3519270.3538429","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.13677","last_updated":"2026-07-15T10:18:36Z","snapshot_observed_at":"2026-08-09T06:03:38.637520Z","submitted_at":"2026-07-15T10:18:36Z","title":"Local Certification of Vertex and Edge Connectivity","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T04:40:15.210380Z"},"links":{"citing_paper":"/paper/2607.13677"},"observation_digest":"sha256:312d2603a944f66da3c2ba332a332619e6fc31db667ce48e6914e56ac4ccb497","observation_id":"44413140-f0de-413d-8522-4bd448508928","resolution":{"observed_at":"2026-08-02T04:40:15.210380Z","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-08-02T04:40:15.382722Z","title":"Proof labeling schemes","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.13677","last_updated":"2026-07-15T10:18:36Z","snapshot_observed_at":"2026-08-09T06:03:38.637520Z","submitted_at":"2026-07-15T10:18:36Z","title":"Local Certification of Vertex and Edge Connectivity","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T04:40:15.382722Z"},"links":{"citing_paper":"/paper/2607.13677"},"observation_digest":"sha256:b75284c2044d6e5d497156db112cd0fa77b9ee67b6056d9dfb32a1b9caf48eac","observation_id":"fc368508-76cd-428c-8c69-8c734a7e7c26","resolution":{"observed_at":"2026-08-02T04:40:15.382722Z","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-08-02T04:40:14.930797Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13677","last_updated":"2026-07-15T10:18:36Z","snapshot_observed_at":"2026-08-09T06:03:38.637520Z","submitted_at":"2026-07-15T10:18:36Z","title":"Local Certification of Vertex and Edge Connectivity","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-02T04:40:14.930797Z"},"links":{"citing_paper":"/paper/2607.13677"},"observation_digest":"sha256:416b5492f466f437390e39b0c7366140dc8155d91a9e64695341f0c0f20d262e","observation_id":"46c41c3e-6596-4d4d-8767-8d7e38c69877","resolution":{"observed_at":"2026-08-02T04:40:14.930797Z","resolver_source":null,"status":"malformed_identifier"},"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-08-02T04:40:15.494131Z","title":"A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph.Algorithmica, 7:583–596, 1992.url:https://api.semanticscholar.org/CorpusID:35970274","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.13677","last_updated":"2026-07-15T10:18:36Z","snapshot_observed_at":"2026-08-09T06:03:38.637520Z","submitted_at":"2026-07-15T10:18:36Z","title":"Local Certification of Vertex and Edge Connectivity","version":1},"reference_index":1960,"source":"pdf_text","source_observed_at":"2026-08-02T04:40:15.494131Z"},"links":{"citing_paper":"/paper/2607.13677"},"observation_digest":"sha256:4f8d51fe4d6299df9d433592241a3e35c37e68e89b7b662c7a85e1ac06dfc3c2","observation_id":"ccd146bd-8f6f-4328-9d68-34c5c08ab887","resolution":{"observed_at":"2026-08-02T04:40:15.494131Z","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-08-02T04:40:14.662821Z","title":"[CPP20] Keren Censor-Hillel, Ami Paz, and Mor Perry","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.13677","last_updated":"2026-07-15T10:18:36Z","snapshot_observed_at":"2026-08-09T06:03:38.637520Z","submitted_at":"2026-07-15T10:18:36Z","title":"Local Certification of Vertex and Edge Connectivity","version":1},"reference_index":1988,"source":"pdf_text","source_observed_at":"2026-08-02T04:40:14.662821Z"},"links":{"citing_paper":"/paper/2607.13677"},"observation_digest":"sha256:1b328bf1296706869bec702fa1432e3c0a99c2052fe856a9ede9b3089b5c0999","observation_id":"4782c89e-87b0-40a1-9f58-aaab7f2278dd","resolution":{"observed_at":"2026-08-02T04:40:14.662821Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4086/toc.2016.v012a019.url:","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T04:43:28.684684Z","title":"Locally checkable proofs in distributed computing","venue":null,"work_id":"8f0e04a0-fa6b-453d-a2ba-597faf028c0d","year":2016},"citing_paper":{"arxiv_id":"2607.13677","last_updated":"2026-07-15T10:18:36Z","snapshot_observed_at":"2026-08-09T06:03:38.637520Z","submitted_at":"2026-07-15T10:18:36Z","title":"Local Certification of Vertex and Edge Connectivity","version":1},"reference_index":1991,"source":"pdf_text","source_observed_at":"2026-08-02T04:40:15.075736Z"},"links":{"citing_paper":"/paper/2607.13677"},"observation_digest":"sha256:04ff1e23186e8e09ea81ef72e9602910c948c9c5e914f17a9ad06ae5e6625c0a","observation_id":"0be37c5f-5ddb-4637-9788-60d5d4cf694a","resolution":{"observed_at":"2026-08-02T04:43:28.790203Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-02T04:40:15.709398Z","title":"Three tree-paths.Journal of Graph Theory, 13(2):175– 188, 1989.doi:https : / / doi","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.13677","last_updated":"2026-07-15T10:18:36Z","snapshot_observed_at":"2026-08-09T06:03:38.637520Z","submitted_at":"2026-07-15T10:18:36Z","title":"Local Certification of Vertex and Edge Connectivity","version":1},"reference_index":1998,"source":"pdf_text","source_observed_at":"2026-08-02T04:40:15.709398Z"},"links":{"citing_paper":"/paper/2607.13677"},"observation_digest":"sha256:711c8a4f53a6880e2f3ef3b1ba504a7d91ebd9664ed51480c0720c2c9b22f13d","observation_id":"dec42174-a493-4f47-8d15-03e0c1cb98b2","resolution":{"observed_at":"2026-08-02T04:40:15.709398Z","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-08-02T04:40:14.429275Z","title":"A tight meta-theorem for LOCAL certification of MSO 2 properties within bounded treewidth graphs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13677","last_updated":"2026-07-15T10:18:36Z","snapshot_observed_at":"2026-08-09T06:03:38.637520Z","submitted_at":"2026-07-15T10:18:36Z","title":"Local Certification of Vertex and Edge Connectivity","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-02T04:40:14.429275Z"},"links":{"citing_paper":"/paper/2607.13677"},"observation_digest":"sha256:eb0e3b25512ee40d5d0426f7489eeaf1edc3492ddec9108d6c58de617f11a46f","observation_id":"31138d96-82cb-44eb-a344-06b761778f7a","resolution":{"observed_at":"2026-08-02T04:40:14.429275Z","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-08-02T04:40:14.730236Z","title":"Algorithms for parallel k-vertex con- nectivity and sparse certificates","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2607.13677","last_updated":"2026-07-15T10:18:36Z","snapshot_observed_at":"2026-08-09T06:03:38.637520Z","submitted_at":"2026-07-15T10:18:36Z","title":"Local Certification of Vertex and Edge Connectivity","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-02T04:40:14.730236Z"},"links":{"citing_paper":"/paper/2607.13677"},"observation_digest":"sha256:fef5475cb9a75613a255b85982ba7fd6c52cfb9aceb0a2f21d8f945b908f417b","observation_id":"0cbb6239-29f2-4e6a-9fac-a943e9101c75","resolution":{"observed_at":"2026-08-02T04:40:14.730236Z","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-08-02T04:40:15.600367Z","title":"Almost-tight distributed minimum cut algo- rithms","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.13677","last_updated":"2026-07-15T10:18:36Z","snapshot_observed_at":"2026-08-09T06:03:38.637520Z","submitted_at":"2026-07-15T10:18:36Z","title":"Local Certification of Vertex and Edge Connectivity","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-02T04:40:15.600367Z"},"links":{"citing_paper":"/paper/2607.13677"},"observation_digest":"sha256:234bb0d064d8fae21598f8cebb103f4a17edd6c5b5ebdadcf43ea51f564105f7","observation_id":"f77508e1-55e0-4989-b23d-80fa03b7dc7b","resolution":{"observed_at":"2026-08-02T04:40:15.600367Z","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-08-02T04:40:14.782422Z","title":"Compact distributed certification of planar graphs","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.13677","last_updated":"2026-07-15T10:18:36Z","snapshot_observed_at":"2026-08-09T06:03:38.637520Z","submitted_at":"2026-07-15T10:18:36Z","title":"Local Certification of Vertex and Edge Connectivity","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-02T04:40:14.782422Z"},"links":{"citing_paper":"/paper/2607.13677"},"observation_digest":"sha256:fec8050045e7e5ef43085a98a7607c00c7bed62d06515aba895375dd95745cd4","observation_id":"5a8269a8-9243-4ff4-9006-928fa7c8336e","resolution":{"observed_at":"2026-08-02T04:40:14.782422Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3086465","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Tight bounds on vertex connectivity under sampling.ACM Trans","venue":"ACM Transactions on Algorithms","work_id":"5f071eb1-2af3-4bba-a9d0-dc56525a2f42","year":2017},"citing_paper":{"arxiv_id":"2607.13677","last_updated":"2026-07-15T10:18:36Z","snapshot_observed_at":"2026-08-09T06:03:38.637520Z","submitted_at":"2026-07-15T10:18:36Z","title":"Local Certification of Vertex and Edge Connectivity","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-02T04:40:14.330324Z"},"links":{"citing_paper":"/paper/2607.13677"},"observation_digest":"sha256:a4b5084d25eac144e41c468cc110b731a691de7c2d2b187508a4a7b48e845a93","observation_id":"bfd7c566-1021-4e21-adae-c34834d45b99","resolution":{"observed_at":"2026-08-02T04:43:28.893255Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08-02T04:40:14.172646Z","title":"Local certification of graph decompositions and applications to minor-free classes.Journal of Parallel and Dis- tributed Computing, 193:104954, 2024.issn: 0743-7315","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.13677","last_updated":"2026-07-15T10:18:36Z","snapshot_observed_at":"2026-08-09T06:03:38.637520Z","submitted_at":"2026-07-15T10:18:36Z","title":"Local Certification of Vertex and Edge Connectivity","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-02T04:40:14.172646Z"},"links":{"citing_paper":"/paper/2607.13677"},"observation_digest":"sha256:35cbe69e3e498c107843d440a0742f860d0e30b31fea318773bd2d10a7a3eaaa","observation_id":"1135a008-1634-4ee8-a68c-88795b78e99d","resolution":{"observed_at":"2026-08-02T04:40:14.172646Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.04934","last_updated":"2026-06-03T14:24:47Z","snapshot_observed_at":"2026-08-09T06:03:18.276018Z","submitted_at":"2026-06-03T14:24:47Z","title":"The local complexity of certifying parity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.04934","snapshot_observed_at":"2026-08-02T04:40:14.274726Z","title":"[BFZ25] Nicolas Bousquet, Laurent Feuilloley, and S´ ebastien Zeitoun","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2607.13677","last_updated":"2026-07-15T10:18:36Z","snapshot_observed_at":"2026-08-09T06:03:38.637520Z","submitted_at":"2026-07-15T10:18:36Z","title":"Local Certification of Vertex and Edge Connectivity","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-02T04:40:14.274726Z"},"links":{"cited_paper":"/paper/2606.04934","citing_paper":"/paper/2607.13677"},"observation_digest":"sha256:93cf8f817443881e1ae90d52d5ee399f802fdef6e92b7fe457a492bb5d9206ff","observation_id":"3f6e6814-4a1b-419e-ab4d-1ad1b01d082a","resolution":{"observed_at":"2026-08-02T04:40:14.274726Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.13677","last_updated":"2026-07-15T10:18:36Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-09T06:03:38.637520Z","submitted_at":"2026-07-15T10:18:36Z","title":"Local Certification of Vertex and Edge Connectivity"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":3,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":3,"verified_fuzzy":0},"total_outbound_references":17},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 0 inbound Pith citation observations for arXiv:2607.13677."}