{"as_of":"2026-08-13T04:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:deaee85926c94a6abb104593dc6c7f270b7c230e558f8b8ca989ae016847aa93","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-12T16:57:33.447335Z","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-12T06:34:41.77262+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/2411.13202/citation-record","integrity":"/paper/2411.13202/integrity","json":"/paper/2411.13202/citation-record.json","paper":"/paper/2411.13202"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00493-024-00108-0","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:57:33.669833Z","title":"Combinatorica, 2024","venue":null,"work_id":"6e82b423-d014-447e-9ae5-fa77347957a3","year":2024},"citing_paper":{"arxiv_id":"2411.13202","last_updated":"2024-11-20T11:04:48Z","snapshot_observed_at":"2026-08-13T00:20:26.894256Z","submitted_at":"2024-11-20T11:04:48Z","title":"Strong orientation of a connected graph for a crossing family","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T16:57:33.372607Z"},"links":{"citing_paper":"/paper/2411.13202"},"observation_digest":"sha256:cc68aac393a9c0e82981c7840fb5d1cb9e8e5c46fa7a2922304b4c0779ed75db","observation_id":"6e18eefa-e507-4cdc-a186-9d32ce43eacc","resolution":{"observed_at":"2026-08-12T16:57:33.674248Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[{"edge_observation":{"observed_at":"2026-08-12T18:18:05.243298+00:00","source":"paper_reference_links","state":"open"},"event_date":"2024-08-05","event_type":"correction","notice_doi":"10.1007/s00493-024-00121-3","provenance":{"observed_at":"2026-07-11T03:10:50.572383+00:00","source":"crossref","source_record_id":"10.1007/s00493-024-00121-3->10.1007/s00493-024-00108-0:correction"}}],"reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/22m1506511","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:57:33.655037Z","title":"On packing dijoins in digraphs and weighted digraphs","venue":null,"work_id":"b092c8a5-130e-4934-b2c7-ef93801ef8fc","year":2023},"citing_paper":{"arxiv_id":"2411.13202","last_updated":"2024-11-20T11:04:48Z","snapshot_observed_at":"2026-08-13T00:20:26.894256Z","submitted_at":"2024-11-20T11:04:48Z","title":"Strong orientation of a connected graph for a crossing family","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T16:57:33.378084Z"},"links":{"citing_paper":"/paper/2411.13202"},"observation_digest":"sha256:1b10fbda2d35fb9ebec32061888c4f75dae818f066c5395a4021855be2aa0596","observation_id":"c31d97d5-2e44-49dd-9420-cb9bdf2690ef","resolution":{"observed_at":"2026-08-12T16:57:33.660162Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jctb.2016.04.002","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:57:33.633962Z","title":"Disjoint dijoins","venue":null,"work_id":"d35aebb9-efc0-4eea-ba59-7c9a1ac8b4db","year":2016},"citing_paper":{"arxiv_id":"2411.13202","last_updated":"2024-11-20T11:04:48Z","snapshot_observed_at":"2026-08-13T00:20:26.894256Z","submitted_at":"2024-11-20T11:04:48Z","title":"Strong orientation of a connected graph for a crossing family","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T16:57:33.382877Z"},"links":{"citing_paper":"/paper/2411.13202"},"observation_digest":"sha256:e0fd8832897ea46fa0f8ca78554eeecc24857f4e852d7b8aa39cad1b5d16e72b","observation_id":"2e5c7add-456c-4e1f-a6cc-a562373423ee","resolution":{"observed_at":"2026-08-12T16:57:33.641748Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0012-365x(01)00209-6","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:57:33.607126Z","title":"On dijoins.Discrete Mathematics, 243(1):213– 216, 2002","venue":null,"work_id":"402f874a-9e99-409a-823b-76b548405b4e","year":2002},"citing_paper":{"arxiv_id":"2411.13202","last_updated":"2024-11-20T11:04:48Z","snapshot_observed_at":"2026-08-13T00:20:26.894256Z","submitted_at":"2024-11-20T11:04:48Z","title":"Strong orientation of a connected graph for a crossing family","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T16:57:33.388407Z"},"links":{"citing_paper":"/paper/2411.13202"},"observation_digest":"sha256:025fd4b0039e62379f782bfadc3bc001e764b3e38014d4155c6b62a22e3f27a3","observation_id":"a00736c5-64d3-44a9-b439-6f73836c7be6","resolution":{"observed_at":"2026-08-12T16:57:33.611814Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-031-59835-7_6","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:57:33.578004Z","title":null,"venue":null,"work_id":"c732d988-4e60-48b5-9fc3-ccb9bcf625bb","year":2024},"citing_paper":{"arxiv_id":"2411.13202","last_updated":"2024-11-20T11:04:48Z","snapshot_observed_at":"2026-08-13T00:20:26.894256Z","submitted_at":"2024-11-20T11:04:48Z","title":"Strong orientation of a connected graph for a crossing family","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T16:57:33.393309Z"},"links":{"citing_paper":"/paper/2411.13202"},"observation_digest":"sha256:da72501848c003d50d7e5fc0dd48bf23b93c150a192a3903d17cd34d908e4a8b","observation_id":"e12d4b57-2193-4eae-bae1-ea71d3a0a6b7","resolution":{"observed_at":"2026-08-12T16:57:33.592339Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0167-5060(08)70734-9","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:57:33.557744Z","title":"A min-max relation for submodular functions on graphs","venue":null,"work_id":"99e38e99-569e-4a1e-8923-eeb75962c9ca","year":1977},"citing_paper":{"arxiv_id":"2411.13202","last_updated":"2024-11-20T11:04:48Z","snapshot_observed_at":"2026-08-13T00:20:26.894256Z","submitted_at":"2024-11-20T11:04:48Z","title":"Strong orientation of a connected graph for a crossing family","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T16:57:33.399703Z"},"links":{"citing_paper":"/paper/2411.13202"},"observation_digest":"sha256:607b29141cb37805d9079e2ee6e7a0171ce8ccc3fe67bb790c55915d5bcab5cd","observation_id":"ac554412-c24c-4137-9e37-a29e69728638","resolution":{"observed_at":"2026-08-12T16:57:33.563179Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.dam.2011.09.003","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:57:33.538368Z","title":"Connections in Combinatorial Optimization","venue":null,"work_id":"7ecda24a-0912-438c-b6cd-7e2eada158f0","year":2011},"citing_paper":{"arxiv_id":"2411.13202","last_updated":"2024-11-20T11:04:48Z","snapshot_observed_at":"2026-08-13T00:20:26.894256Z","submitted_at":"2024-11-20T11:04:48Z","title":"Strong orientation of a connected graph for a crossing family","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T16:57:33.404531Z"},"links":{"citing_paper":"/paper/2411.13202"},"observation_digest":"sha256:0aed007cf107c6e287ca1165f1c7ffc766df403a29eaa8799a280626b6796079","observation_id":"79c62583-0a10-4abd-85a4-86a2a5841375","resolution":{"observed_at":"2026-08-12T16:57:33.543411Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:57:33.729910Z","title":"Observations on Woodall’s conjec ture","venue":null,"work_id":"10186c6d-1bc1-4775-a078-e08a241e3881","year":null},"citing_paper":{"arxiv_id":"2411.13202","last_updated":"2024-11-20T11:04:48Z","snapshot_observed_at":"2026-08-13T00:20:26.894256Z","submitted_at":"2024-11-20T11:04:48Z","title":"Strong orientation of a connected graph for a crossing family","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T16:57:33.412676Z"},"links":{"citing_paper":"/paper/2411.13202"},"observation_digest":"sha256:c1232da80a8653084ebf15f845e8ff76a1c87dac1918ce2843e97931125c980a","observation_id":"a02d69a0-2fc8-40ae-935a-5e7b557e5598","resolution":{"observed_at":"2026-08-12T16:57:33.734156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:57:33.418099Z","title":"A counterexample to a conjecture o f Edmonds and Giles","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2411.13202","last_updated":"2024-11-20T11:04:48Z","snapshot_observed_at":"2026-08-13T00:20:26.894256Z","submitted_at":"2024-11-20T11:04:48Z","title":"Strong orientation of a connected graph for a crossing family","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T16:57:33.418099Z"},"links":{"citing_paper":"/paper/2411.13202"},"observation_digest":"sha256:1051877defb7a5f15cceb398c521acf354fcef900b7cc3af9f9054249c371441","observation_id":"553e790b-166a-46b2-be3e-6d88c21a6db2","resolution":{"observed_at":"2026-08-12T16:57:33.418099Z","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-12T16:57:33.715448Z","title":"Combinatorial Optimization: Polyhedra and Efficiency Volume 1","venue":null,"work_id":"85aac17b-95f3-4090-8810-4b2ecd436b04","year":2003},"citing_paper":{"arxiv_id":"2411.13202","last_updated":"2024-11-20T11:04:48Z","snapshot_observed_at":"2026-08-13T00:20:26.894256Z","submitted_at":"2024-11-20T11:04:48Z","title":"Strong orientation of a connected graph for a crossing family","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T16:57:33.423774Z"},"links":{"citing_paper":"/paper/2411.13202"},"observation_digest":"sha256:bcbb87410951daddd78e43af6f303fd4b35969758d924b2508bd40be53b9f889","observation_id":"9d65bbaf-7644-4726-a04a-4fc09e25e013","resolution":{"observed_at":"2026-08-12T16:57:33.720656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:57:33.699540Z","title":"Combinatorial Optimization: Polyhedra and Efficiency Volume 2","venue":null,"work_id":"4d3cb1b1-7492-4f7e-a641-37977ea31fcf","year":2003},"citing_paper":{"arxiv_id":"2411.13202","last_updated":"2024-11-20T11:04:48Z","snapshot_observed_at":"2026-08-13T00:20:26.894256Z","submitted_at":"2024-11-20T11:04:48Z","title":"Strong orientation of a connected graph for a crossing family","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T16:57:33.428561Z"},"links":{"citing_paper":"/paper/2411.13202"},"observation_digest":"sha256:ec5976166076bb173c417f7a025f75bc679b4b3b594e2b32e5f2e60920b68998","observation_id":"1b8a5b5d-172b-4852-8f47-d9b9490b215e","resolution":{"observed_at":"2026-08-12T16:57:33.706365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/0-387-25592-3_8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:57:33.503763Z","title":"Visualizing, finding a nd packing dijoins","venue":null,"work_id":"21b89fd8-3cca-45ff-ae83-9c6353600def","year":null},"citing_paper":{"arxiv_id":"2411.13202","last_updated":"2024-11-20T11:04:48Z","snapshot_observed_at":"2026-08-13T00:20:26.894256Z","submitted_at":"2024-11-20T11:04:48Z","title":"Strong orientation of a connected graph for a crossing family","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T16:57:33.433224Z"},"links":{"citing_paper":"/paper/2411.13202"},"observation_digest":"sha256:fcc6b93f5f0baf0128aeef7b3382f31552396b9949816dad1b0ffc6f1ae02242","observation_id":"9c5ab586-fbca-47c5-bca1-a9c34fa6b40e","resolution":{"observed_at":"2026-08-12T16:57:33.509091Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-12T16:57:33.682983Z","title":"Packing directed joins","venue":null,"work_id":"f9a2e042-d892-4419-9ac6-827e4c1a2506","year":2004},"citing_paper":{"arxiv_id":"2411.13202","last_updated":"2024-11-20T11:04:48Z","snapshot_observed_at":"2026-08-13T00:20:26.894256Z","submitted_at":"2024-11-20T11:04:48Z","title":"Strong orientation of a connected graph for a crossing family","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T16:57:33.441053Z"},"links":{"citing_paper":"/paper/2411.13202"},"observation_digest":"sha256:95f268542866ec713eb4ffec1d93cebc7114eb012a3fb049b34da911bbc305dd","observation_id":"6f370208-d658-4334-b70b-49febd8a2210","resolution":{"observed_at":"2026-08-12T16:57:33.687575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bfb0070416","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:57:33.484328Z","title":null,"venue":null,"work_id":"5db9b1a6-2e79-43b2-aaa0-47e13f93a8f5","year":1978},"citing_paper":{"arxiv_id":"2411.13202","last_updated":"2024-11-20T11:04:48Z","snapshot_observed_at":"2026-08-13T00:20:26.894256Z","submitted_at":"2024-11-20T11:04:48Z","title":"Strong orientation of a connected graph for a crossing family","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T16:57:33.447335Z"},"links":{"citing_paper":"/paper/2411.13202"},"observation_digest":"sha256:83882d4982c843b44def47161937d21b855dd352d6eecb0ffb961497be02a0c5","observation_id":"258e891c-4078-4c69-b133-43e1f093da36","resolution":{"observed_at":"2026-08-12T16:57:33.490441Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.13202","last_updated":"2024-11-20T11:04:48Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-13T00:20:26.894256Z","submitted_at":"2024-11-20T11:04:48Z","title":"Strong orientation of a connected graph for a crossing family"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":9,"verified_fuzzy":4},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 0 inbound Pith citation observations for arXiv:2411.13202."}