{"as_of":"2026-08-18T04:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7658a85c7e32dabaf0d4d70961358d6de1d68c57a86cf57c66bb2fa37c1432d8","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T00:23:12.706172Z","state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2608.00768/citation-record","integrity":"/paper/2608.00768/integrity","json":"/paper/2608.00768/citation-record.json","paper":"/paper/2608.00768"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1304.1628","last_updated":"2013-04-05T07:43:51Z","snapshot_observed_at":"2026-08-15T00:22:31.737584Z","submitted_at":"2013-04-05T07:43:51Z","title":"Pattern-Based Constraint Satisfaction and Logic Puzzles","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1304.1628","snapshot_observed_at":"2026-08-05T00:23:11.851862Z","title":"CoRR abs/1304.1628(2013)","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2608.00768","last_updated":"2026-08-01T17:01:10Z","snapshot_observed_at":"2026-08-17T23:09:55.901202Z","submitted_at":"2026-08-01T17:01:10Z","title":"Taming the Search Space: Solving and Generating Hitori and Binairo Puzzles","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T00:23:11.851862Z"},"links":{"cited_paper":"/paper/1304.1628","citing_paper":"/paper/2608.00768"},"observation_digest":"sha256:dfc4c67392f0db564e61d5d074973500f25a914b27d79366dfac7c6acb1062d2","observation_id":"c05c02d1-bca8-4c69-9fac-a7461bf055fc","resolution":{"observed_at":"2026-08-05T00:23:11.851862Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:23:14.469499Z","title":"ACM Computing Surveys (CSUR)38(4), 12–es (2006)","venue":null,"work_id":"c80e6fb3-e0ab-4baa-943c-3e4c8bf461b4","year":2006},"citing_paper":{"arxiv_id":"2608.00768","last_updated":"2026-08-01T17:01:10Z","snapshot_observed_at":"2026-08-17T23:09:55.901202Z","submitted_at":"2026-08-01T17:01:10Z","title":"Taming the Search Space: Solving and Generating Hitori and Binairo Puzzles","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T00:23:11.924098Z"},"links":{"citing_paper":"/paper/2608.00768"},"observation_digest":"sha256:5a6e5852a5d91dae3fa163ba1fd77d0636b0d89961e884bc180ee03a5d0cca08","observation_id":"25e6e4c1-f652-42cb-92be-2c9d04330ebf","resolution":{"observed_at":"2026-08-05T00:23:14.582333Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:23:14.322126Z","title":"In: Maple in Mathematics Education and Research","venue":null,"work_id":"6e4efe66-a832-4840-8f17-1f3b1a327af3","year":2020},"citing_paper":{"arxiv_id":"2608.00768","last_updated":"2026-08-01T17:01:10Z","snapshot_observed_at":"2026-08-17T23:09:55.901202Z","submitted_at":"2026-08-01T17:01:10Z","title":"Taming the Search Space: Solving and Generating Hitori and Binairo Puzzles","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T00:23:12.005613Z"},"links":{"citing_paper":"/paper/2608.00768"},"observation_digest":"sha256:588b3c4e6fe3dca9c0f173890acff9072357a0adbafcd0fc53a8f84e84a6af6f","observation_id":"dd1c2897-6d13-4a7f-aee4-e8f178ea417f","resolution":{"observed_at":"2026-08-05T00:23:14.397315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:23:14.183510Z","title":"Journal of Computing Sciences in Colleges28(3), 21–28 (2013)","venue":null,"work_id":"0b622695-bff8-4167-8655-158edeb2b0c3","year":2013},"citing_paper":{"arxiv_id":"2608.00768","last_updated":"2026-08-01T17:01:10Z","snapshot_observed_at":"2026-08-17T23:09:55.901202Z","submitted_at":"2026-08-01T17:01:10Z","title":"Taming the Search Space: Solving and Generating Hitori and Binairo Puzzles","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T00:23:12.080426Z"},"links":{"citing_paper":"/paper/2608.00768"},"observation_digest":"sha256:011d8b585f100e9cc246c1c6828718f67ffa9bc3a2998a3ec45b16be0c5a266a","observation_id":"2697351b-b35f-4d38-a726-4bacdc13fa77","resolution":{"observed_at":"2026-08-05T00:23:14.263603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:23:14.053314Z","title":null,"venue":null,"work_id":"e468d7bc-2cd7-4359-8e6d-9d28b2975f76","year":2012},"citing_paper":{"arxiv_id":"2608.00768","last_updated":"2026-08-01T17:01:10Z","snapshot_observed_at":"2026-08-17T23:09:55.901202Z","submitted_at":"2026-08-01T17:01:10Z","title":"Taming the Search Space: Solving and Generating Hitori and Binairo Puzzles","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T00:23:12.147456Z"},"links":{"citing_paper":"/paper/2608.00768"},"observation_digest":"sha256:d3050a73257f39d1c10bbd79e68c6e740b78dbcf6b7603bd5feda9c320c3eb40","observation_id":"3985c2af-dd25-420d-b51e-00ae2e625c7a","resolution":{"observed_at":"2026-08-05T00:23:14.124785Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:23:13.910276Z","title":null,"venue":null,"work_id":"648f4cfa-fc7c-4cd5-b1b9-725733ae1dc8","year":2009},"citing_paper":{"arxiv_id":"2608.00768","last_updated":"2026-08-01T17:01:10Z","snapshot_observed_at":"2026-08-17T23:09:55.901202Z","submitted_at":"2026-08-01T17:01:10Z","title":"Taming the Search Space: Solving and Generating Hitori and Binairo Puzzles","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T00:23:12.231717Z"},"links":{"citing_paper":"/paper/2608.00768"},"observation_digest":"sha256:185b0d35b8c574141ea90b72bc4c484d80df190fde54a1d6876fb307c02cf4f2","observation_id":"4b3c03ae-0083-40f0-9a1f-d65c7c1f9a43","resolution":{"observed_at":"2026-08-05T00:23:13.957287Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:23:13.743675Z","title":"Bachelor’s thesis, Radboud University (2021)","venue":null,"work_id":"84e34e89-1e31-4adf-b29e-f629ea28a16e","year":2021},"citing_paper":{"arxiv_id":"2608.00768","last_updated":"2026-08-01T17:01:10Z","snapshot_observed_at":"2026-08-17T23:09:55.901202Z","submitted_at":"2026-08-01T17:01:10Z","title":"Taming the Search Space: Solving and Generating Hitori and Binairo Puzzles","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T00:23:12.316985Z"},"links":{"citing_paper":"/paper/2608.00768"},"observation_digest":"sha256:e5598ac81679ba29dc4c807f9339b4eb73bdc27e41c392f409f7353eea59803a","observation_id":"09b88971-dd93-4800-99fa-f722334bb23d","resolution":{"observed_at":"2026-08-05T00:23:13.813543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:23:13.628866Z","title":"AI magazine 13(1), 32–32 (1992)","venue":null,"work_id":"fe5480d6-5b4b-4ad1-838e-7789cb4e3e1c","year":1992},"citing_paper":{"arxiv_id":"2608.00768","last_updated":"2026-08-01T17:01:10Z","snapshot_observed_at":"2026-08-17T23:09:55.901202Z","submitted_at":"2026-08-01T17:01:10Z","title":"Taming the Search Space: Solving and Generating Hitori and Binairo Puzzles","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T00:23:12.372271Z"},"links":{"citing_paper":"/paper/2608.00768"},"observation_digest":"sha256:bd1c2f02a2c64d8f42ea085cefb7397ec989e9eb1601e5e3c2d28f29a5bbb277","observation_id":"3a57789e-595d-454f-80a7-858c9d9fb9c8","resolution":{"observed_at":"2026-08-05T00:23:13.670758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:23:13.515527Z","title":"https://norvig.com/sudoku.html (2009), accessed: 2025-02-18","venue":null,"work_id":"0f53f8a9-1b1b-4e04-9797-cdb01531cc8f","year":2009},"citing_paper":{"arxiv_id":"2608.00768","last_updated":"2026-08-01T17:01:10Z","snapshot_observed_at":"2026-08-17T23:09:55.901202Z","submitted_at":"2026-08-01T17:01:10Z","title":"Taming the Search Space: Solving and Generating Hitori and Binairo Puzzles","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T00:23:12.427139Z"},"links":{"citing_paper":"/paper/2608.00768"},"observation_digest":"sha256:241802bd4002055cd5dadf13e895ee8101f824bfdaa4cb806dcbb3a1dc4e47a7","observation_id":"773d97ef-5745-43b4-b440-df155e040ada","resolution":{"observed_at":"2026-08-05T00:23:13.557600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.14294","last_updated":"2025-08-19T22:21:44Z","snapshot_observed_at":"2026-08-13T19:18:06.476678Z","submitted_at":"2025-08-19T22:21:44Z","title":"Explaining Hitori Puzzles: Neurosymbolic Proof Staging for Sequential Decisions","version":1},"cited_work":{"arxiv_id":"2508.14294","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.14294","snapshot_observed_at":"2026-08-05T00:23:12.812020Z","title":"Explaining Hitori Puzzles: Neurosymbolic Proof Staging for Sequential Decisions","venue":"cs.AI","work_id":"562c3595-74ae-4408-8d3c-22fa63968769","year":2025},"citing_paper":{"arxiv_id":"2608.00768","last_updated":"2026-08-01T17:01:10Z","snapshot_observed_at":"2026-08-17T23:09:55.901202Z","submitted_at":"2026-08-01T17:01:10Z","title":"Taming the Search Space: Solving and Generating Hitori and Binairo Puzzles","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T00:23:12.478126Z"},"links":{"cited_paper":"/paper/2508.14294","citing_paper":"/paper/2608.00768"},"observation_digest":"sha256:1d6df76ea432c2336d0c03ee4c47978c14b943f89e73eba0f142c990bf23eb3c","observation_id":"a455aded-6e27-4c37-8918-e88bf2b5f108","resolution":{"observed_at":"2026-08-05T00:23:12.900552Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:23:13.345215Z","title":"Elsevier (2006) Taming the Search Space 15","venue":null,"work_id":"b5d0cf83-cb00-48b7-8f0d-0c23c4b6477b","year":2006},"citing_paper":{"arxiv_id":"2608.00768","last_updated":"2026-08-01T17:01:10Z","snapshot_observed_at":"2026-08-17T23:09:55.901202Z","submitted_at":"2026-08-01T17:01:10Z","title":"Taming the Search Space: Solving and Generating Hitori and Binairo Puzzles","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T00:23:12.517671Z"},"links":{"citing_paper":"/paper/2608.00768"},"observation_digest":"sha256:e96e6d46bc9faf05337b0891fa80bf34a774a39f8c61aa6f0a7c5bd8663a37d1","observation_id":"95bd2d57-2ea9-4e7c-890b-276c2030204e","resolution":{"observed_at":"2026-08-05T00:23:13.422329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:23:13.236474Z","title":"Journal of Information Processing25, 695–707 (2017)","venue":null,"work_id":"0eb6640e-5513-451b-9f1e-ba5e72c09bb4","year":2017},"citing_paper":{"arxiv_id":"2608.00768","last_updated":"2026-08-01T17:01:10Z","snapshot_observed_at":"2026-08-17T23:09:55.901202Z","submitted_at":"2026-08-01T17:01:10Z","title":"Taming the Search Space: Solving and Generating Hitori and Binairo Puzzles","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T00:23:12.578359Z"},"links":{"citing_paper":"/paper/2608.00768"},"observation_digest":"sha256:0c29099b9ff9ecdd17561b8eb56b2e5da4da879ac0be8ae8cb933ac19496ccca","observation_id":"e4971d2e-ff88-4602-89cf-0c81c7f5e213","resolution":{"observed_at":"2026-08-05T00:23:13.282788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:23:13.100545Z","title":"Mathematics in Computer Science11, 515–526 (2017)","venue":null,"work_id":"b8a88dbc-93c1-429f-a056-836788208f14","year":2017},"citing_paper":{"arxiv_id":"2608.00768","last_updated":"2026-08-01T17:01:10Z","snapshot_observed_at":"2026-08-17T23:09:55.901202Z","submitted_at":"2026-08-01T17:01:10Z","title":"Taming the Search Space: Solving and Generating Hitori and Binairo Puzzles","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T00:23:12.639922Z"},"links":{"citing_paper":"/paper/2608.00768"},"observation_digest":"sha256:543d2d238df59fbd7549aa124cb6bb54e738fc59a330622801ede9e6cb7f1a59","observation_id":"5329b8df-251f-4584-b19b-6314c26aa2b7","resolution":{"observed_at":"2026-08-05T00:23:13.170017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T00:23:13.004638Z","title":"In: Foundations of artificial intelli- gence, vol","venue":null,"work_id":"34042582-5648-4348-b9dc-550c217833cb","year":2006},"citing_paper":{"arxiv_id":"2608.00768","last_updated":"2026-08-01T17:01:10Z","snapshot_observed_at":"2026-08-17T23:09:55.901202Z","submitted_at":"2026-08-01T17:01:10Z","title":"Taming the Search Space: Solving and Generating Hitori and Binairo Puzzles","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T00:23:12.706172Z"},"links":{"citing_paper":"/paper/2608.00768"},"observation_digest":"sha256:62b007098c14c2e06b923a1e4f606982961103223ab4030240e13e77b11b48cd","observation_id":"9af76f61-103c-4782-a7f9-524c70a76903","resolution":{"observed_at":"2026-08-05T00:23:13.032911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.00768","last_updated":"2026-08-01T17:01:10Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-17T23:09:55.901202Z","submitted_at":"2026-08-01T17:01:10Z","title":"Taming the Search Space: Solving and Generating Hitori and Binairo Puzzles"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":3,"verified_exact":0,"verified_fuzzy":10},"total_outbound_references":14},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 0 inbound Pith citation observations for arXiv:2608.00768."}