{"as_of":"2026-08-09T23:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d2c8e5dae0254d58eb1b4fb07d66be129efc4224425ebcd3989a0eb4c6f28c6a","coverage":[{"denominator":8,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T03:42:52.435680Z","state":"measured"},{"denominator":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"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.11709/citation-record","integrity":"/paper/2607.11709/integrity","json":"/paper/2607.11709/citation-record.json","paper":"/paper/2607.11709"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.07198","last_updated":"2025-02-11T02:43:13Z","snapshot_observed_at":"2026-08-08T13:27:46.525537Z","submitted_at":"2025-02-11T02:43:13Z","title":"The Affine Tamari Lattice","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.07198","snapshot_observed_at":"2026-07-14T03:42:52.435680Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11709","last_updated":"2026-07-13T15:37:31Z","snapshot_observed_at":"2026-08-03T22:52:05.407524Z","submitted_at":"2026-07-13T15:37:31Z","title":"Computing Tools for Translation-Invariant Total Orders","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-14T03:42:52.435680Z"},"links":{"cited_paper":"/paper/2502.07198","citing_paper":"/paper/2607.11709"},"observation_digest":"sha256:da187e9bc804bdb357cde7d517c60f684a063403b8acda034092662230c53d19","observation_id":"19da87f3-f4fb-4e14-8158-c136499a7efd","resolution":{"observed_at":"2026-07-14T03:42:52.435680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05875","last_updated":"2025-02-09T12:24:03Z","snapshot_observed_at":"2026-08-08T17:32:26.643018Z","submitted_at":"2025-02-09T12:24:03Z","title":"Extended weak order for the affine symmetric group","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05875","snapshot_observed_at":"2026-07-14T03:42:52.435680Z","title":"Barkley.Extended weak order for the affine symmetric group","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11709","last_updated":"2026-07-13T15:37:31Z","snapshot_observed_at":"2026-08-03T22:52:05.407524Z","submitted_at":"2026-07-13T15:37:31Z","title":"Computing Tools for Translation-Invariant Total Orders","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-14T03:42:52.435680Z"},"links":{"cited_paper":"/paper/2502.05875","citing_paper":"/paper/2607.11709"},"observation_digest":"sha256:6d3743c16483ed5f8f3abc7ff7b03a6ce729ecfd6da00316e94aae3fa949d77d","observation_id":"da2eef92-57f9-4c9c-b912-bc97a82214d2","resolution":{"observed_at":"2026-07-14T03:42:52.435680Z","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-14T03:42:52.435680Z","title":"Barkley and David E Speyer.Affine extended weak order is a lattice","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11709","last_updated":"2026-07-13T15:37:31Z","snapshot_observed_at":"2026-08-03T22:52:05.407524Z","submitted_at":"2026-07-13T15:37:31Z","title":"Computing Tools for Translation-Invariant Total Orders","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-14T03:42:52.435680Z"},"links":{"citing_paper":"/paper/2607.11709"},"observation_digest":"sha256:47b95ad746edeea77bda0465a7ea9310dece3e005df8556b6a25107255621bbd","observation_id":"e7d27e55-ba74-4047-bfbb-f7f83bd4c9fa","resolution":{"observed_at":"2026-07-14T03:42:52.435680Z","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.5070/c64264235.url:","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T03:50:12.857448Z","title":"Combinatorial descriptions of biclosed sets in affine type","venue":null,"work_id":"3c3eb1e5-c97a-4b18-a514-d5995f4e7ab2","year":2024},"citing_paper":{"arxiv_id":"2607.11709","last_updated":"2026-07-13T15:37:31Z","snapshot_observed_at":"2026-08-03T22:52:05.407524Z","submitted_at":"2026-07-13T15:37:31Z","title":"Computing Tools for Translation-Invariant Total Orders","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-14T03:42:52.435680Z"},"links":{"citing_paper":"/paper/2607.11709"},"observation_digest":"sha256:c0f5dc02b355677f5c5326ed12d7e3daa4f065f8a1bc82c075c4ca6e9d1a27e5","observation_id":"d38c519f-8e0b-4671-aaef-6104bc607d4f","resolution":{"observed_at":"2026-07-14T03:50:12.859074Z","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-07-14T05:21:54.550715+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T05:21:54.550715+00:00","source":"openalex_status_cache"},{"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-07-14T03:42:52.435680Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.11709","last_updated":"2026-07-13T15:37:31Z","snapshot_observed_at":"2026-08-03T22:52:05.407524Z","submitted_at":"2026-07-13T15:37:31Z","title":"Computing Tools for Translation-Invariant Total Orders","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-14T03:42:52.435680Z"},"links":{"citing_paper":"/paper/2607.11709"},"observation_digest":"sha256:773b72def620430d8d4435c94d7753dd11aa975f65ac35049c93e53af6e3122e","observation_id":"6d848594-447f-41a2-98eb-4ae089d354b3","resolution":{"observed_at":"2026-07-14T03:42:52.435680Z","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-14T03:42:52.435680Z","title":"Algorithm 97: Shortest path","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2607.11709","last_updated":"2026-07-13T15:37:31Z","snapshot_observed_at":"2026-08-03T22:52:05.407524Z","submitted_at":"2026-07-13T15:37:31Z","title":"Computing Tools for Translation-Invariant Total Orders","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-14T03:42:52.435680Z"},"links":{"citing_paper":"/paper/2607.11709"},"observation_digest":"sha256:270b73a5b1068830fa7dd4067ce62eee67af73dea115f91bdf57be46cf0ec9d5","observation_id":"39a3485b-3fd1-4cfe-8bf6-e4bf15a4cfed","resolution":{"observed_at":"2026-07-14T03:42:52.435680Z","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-14T03:42:52.435680Z","title":"On inversion sets and the weak order in Coxeter groups","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.11709","last_updated":"2026-07-13T15:37:31Z","snapshot_observed_at":"2026-08-03T22:52:05.407524Z","submitted_at":"2026-07-13T15:37:31Z","title":"Computing Tools for Translation-Invariant Total Orders","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-14T03:42:52.435680Z"},"links":{"citing_paper":"/paper/2607.11709"},"observation_digest":"sha256:f5e6402dd168d04c7833da2b08973b1e95d77d01ae38368f014a803d7f3ba06a","observation_id":"61cc425b-343c-46d4-8962-83026abdda01","resolution":{"observed_at":"2026-07-14T03:42:52.435680Z","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-14T03:42:52.435680Z","title":"A theorem on Boolean Matrices","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2607.11709","last_updated":"2026-07-13T15:37:31Z","snapshot_observed_at":"2026-08-03T22:52:05.407524Z","submitted_at":"2026-07-13T15:37:31Z","title":"Computing Tools for Translation-Invariant Total Orders","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-14T03:42:52.435680Z"},"links":{"citing_paper":"/paper/2607.11709"},"observation_digest":"sha256:4ee941ae131b65aad6d39a3e5f28d8fe4a2e1b85efd3d5fd0a4e350d14d92fe3","observation_id":"130e6082-78af-4fb5-a49e-0b8d4e3884f8","resolution":{"observed_at":"2026-07-14T03:42:52.435680Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.11709","last_updated":"2026-07-13T15:37:31Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-03T22:52:05.407524Z","submitted_at":"2026-07-13T15:37:31Z","title":"Computing Tools for Translation-Invariant Total Orders"},"reference_resolution":{"displayed":8,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":8},"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 8 of 8 outbound references and 0 inbound Pith citation observations for arXiv:2607.11709."}