{"as_of":"2026-08-19T20:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:364c1a183c86c034e8ba5391a072be4bc0d390d1aa4166b2e1f925a7c6d60df4","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T18:09:16.296125Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2501.11697/citation-record","integrity":"/paper/2501.11697/integrity","json":"/paper/2501.11697/citation-record.json","paper":"/paper/2501.11697"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:09:16.864659Z","title":"Vulnerability of scheduled networks and a generalization of menger's theorem","venue":null,"work_id":"2ca1bbbf-299d-4257-a33e-a7fc7b42d15f","year":1996},"citing_paper":{"arxiv_id":"2501.11697","last_updated":"2025-01-20T19:22:08Z","snapshot_observed_at":"2026-08-19T01:04:44.802141Z","submitted_at":"2025-01-20T19:22:08Z","title":"Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-10T18:09:16.218473Z"},"links":{"citing_paper":"/paper/2501.11697"},"observation_digest":"sha256:f2c2d4a33e3806cf2f1feb11b8c69f757127e9ef0b97621552d3a9ae0c4bae6d","observation_id":"5377a607-b393-43ab-b8b3-3c02ccaef03e","resolution":{"observed_at":"2026-08-10T18:09:16.868582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-10T18:09:16.853300Z","title":"Complexity of connected components in evolving graphs and the computation of multicast trees in dynamic networks","venue":null,"work_id":"ccd5820e-39e1-4a78-aaca-bea7519b03b7","year":2003},"citing_paper":{"arxiv_id":"2501.11697","last_updated":"2025-01-20T19:22:08Z","snapshot_observed_at":"2026-08-19T01:04:44.802141Z","submitted_at":"2025-01-20T19:22:08Z","title":"Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-10T18:09:16.222814Z"},"links":{"citing_paper":"/paper/2501.11697"},"observation_digest":"sha256:9e9765beff6b1f8dce620e1c67ef12b6b1fbe57f8df7277f03af0644218a9adc","observation_id":"17e064e4-a67d-4611-a171-a9800fd6132e","resolution":{"observed_at":"2026-08-10T18:09:16.857964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-10T18:09:16.841467Z","title":"A problem with telephones","venue":null,"work_id":"8bef324c-4a1b-40ff-a29b-bba0e2ab7756","year":1981},"citing_paper":{"arxiv_id":"2501.11697","last_updated":"2025-01-20T19:22:08Z","snapshot_observed_at":"2026-08-19T01:04:44.802141Z","submitted_at":"2025-01-20T19:22:08Z","title":"Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-10T18:09:16.226522Z"},"links":{"citing_paper":"/paper/2501.11697"},"observation_digest":"sha256:06326880814127f8ded5512b30cdca370d23d2f0d4a93890c37c1292049cb9f9","observation_id":"2932f1e4-ec47-4929-a027-cef0f1b52e14","resolution":{"observed_at":"2026-08-10T18:09:16.845406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.06260","snapshot_observed_at":"2026-08-10T18:09:16.230562Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs, December 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.11697","last_updated":"2025-01-20T19:22:08Z","snapshot_observed_at":"2026-08-19T01:04:44.802141Z","submitted_at":"2025-01-20T19:22:08Z","title":"Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T18:09:16.230562Z"},"links":{"cited_paper":"/paper/2312.06260","citing_paper":"/paper/2501.11697"},"observation_digest":"sha256:5c22443164a160bd90599996fe7550a3151cb0bb06bb9551402b73d524e2b653","observation_id":"95d73971-e5ab-4c9d-b977-d5bf9dee090e","resolution":{"observed_at":"2026-08-10T18:09:16.230562Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1012.0009","last_updated":"2012-02-17T20:51:42Z","snapshot_observed_at":"2026-08-15T05:01:31.972992Z","submitted_at":"2010-11-30T21:03:42Z","title":"Time-Varying Graphs and Dynamic Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1012.0009","snapshot_observed_at":"2026-08-10T18:09:16.234813Z","title":"Time- Varying Graphs and Dynamic Networks , February 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.11697","last_updated":"2025-01-20T19:22:08Z","snapshot_observed_at":"2026-08-19T01:04:44.802141Z","submitted_at":"2025-01-20T19:22:08Z","title":"Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T18:09:16.234813Z"},"links":{"cited_paper":"/paper/1012.0009","citing_paper":"/paper/2501.11697"},"observation_digest":"sha256:f4e9a2dc3dc064a51cadc82082815b4017fef738b673d7f1e3c7a8e020f8261c","observation_id":"5ddfae1d-54b1-4bd1-a423-d6f1a47c9221","resolution":{"observed_at":"2026-08-10T18:09:16.234813Z","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-10T18:09:16.239248Z","title":"Sharp Thresholds in Random Simple Temporal Graphs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.11697","last_updated":"2025-01-20T19:22:08Z","snapshot_observed_at":"2026-08-19T01:04:44.802141Z","submitted_at":"2025-01-20T19:22:08Z","title":"Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-10T18:09:16.239248Z"},"links":{"citing_paper":"/paper/2501.11697"},"observation_digest":"sha256:1def3988d626cdaffd1490faadb2aee0e266fc6dda78d59648e6944baa2e1a71","observation_id":"556567ed-f1ca-40ff-bbf4-7ba327e212a1","resolution":{"observed_at":"2026-08-10T18:09:16.239248Z","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":"2024.11443","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:09:16.692533Z","title":"Simple, strict, proper, happy: A study of reachability in temporal graphs","venue":null,"work_id":"30e49d31-a19e-4c63-b6b0-fe95d1d1a918","year":2024},"citing_paper":{"arxiv_id":"2501.11697","last_updated":"2025-01-20T19:22:08Z","snapshot_observed_at":"2026-08-19T01:04:44.802141Z","submitted_at":"2025-01-20T19:22:08Z","title":"Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-10T18:09:16.243266Z"},"links":{"citing_paper":"/paper/2501.11697"},"observation_digest":"sha256:5733d9bc5d7425d77c7c01d1d7876dc5aa187c4013431ee6a27ec9e2f1eb1da7","observation_id":"5c85ee7d-2062-4597-bf9d-ddc46f7bad1e","resolution":{"observed_at":"2026-08-10T18:09:16.697737Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-10T18:09:16.246655Z","title":"Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.11697","last_updated":"2025-01-20T19:22:08Z","snapshot_observed_at":"2026-08-19T01:04:44.802141Z","submitted_at":"2025-01-20T19:22:08Z","title":"Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-10T18:09:16.246655Z"},"links":{"citing_paper":"/paper/2501.11697"},"observation_digest":"sha256:48416523c43cdeb9db1567bb5aec1435494acfcfb41bab8f76801061b4a4cb1d","observation_id":"1350b7f5-6439-471d-bee5-95735e7a650a","resolution":{"observed_at":"2026-08-10T18:09:16.246655Z","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-10T18:09:16.250507Z","title":"On Inefficiently Connecting Temporal Networks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.11697","last_updated":"2025-01-20T19:22:08Z","snapshot_observed_at":"2026-08-19T01:04:44.802141Z","submitted_at":"2025-01-20T19:22:08Z","title":"Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-10T18:09:16.250507Z"},"links":{"citing_paper":"/paper/2501.11697"},"observation_digest":"sha256:0dcde2be32468c82a44ec12c169ced1538abf60bd25c7ccdaa8b6a506566c34d","observation_id":"ec1246bf-34bf-4541-85c7-e09224c7271e","resolution":{"observed_at":"2026-08-10T18:09:16.250507Z","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-10T18:09:16.830175Z","title":"On computing large temporal (unilateral) connected components","venue":null,"work_id":"6d1cb8b1-f697-4056-b91e-b2b173c91f6c","year":2023},"citing_paper":{"arxiv_id":"2501.11697","last_updated":"2025-01-20T19:22:08Z","snapshot_observed_at":"2026-08-19T01:04:44.802141Z","submitted_at":"2025-01-20T19:22:08Z","title":"Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-10T18:09:16.254778Z"},"links":{"citing_paper":"/paper/2501.11697"},"observation_digest":"sha256:45b9a53bd6ba8993b664521aaf729f32e097c6f2ee031a12d25f8794d6e5ed30","observation_id":"3e3f7dc3-0692-47c7-975f-578f1daf9834","resolution":{"observed_at":"2026-08-10T18:09:16.834083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-10T18:09:16.258154Z","title":"Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.11697","last_updated":"2025-01-20T19:22:08Z","snapshot_observed_at":"2026-08-19T01:04:44.802141Z","submitted_at":"2025-01-20T19:22:08Z","title":"Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-10T18:09:16.258154Z"},"links":{"citing_paper":"/paper/2501.11697"},"observation_digest":"sha256:82f492f70d533b42472234097cf4fd5a8aaf8b8fc8b1faa5e88353bc56b40883","observation_id":"d0ce515b-d411-49f2-b0e2-e97793947ac1","resolution":{"observed_at":"2026-08-10T18:09:16.258154Z","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-10T18:09:16.819296Z","title":"Temporal graph classes: A view through temporal separators","venue":null,"work_id":"95cbbdfb-e8b0-43d5-8324-995a0217d646","year":2020},"citing_paper":{"arxiv_id":"2501.11697","last_updated":"2025-01-20T19:22:08Z","snapshot_observed_at":"2026-08-19T01:04:44.802141Z","submitted_at":"2025-01-20T19:22:08Z","title":"Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-10T18:09:16.261587Z"},"links":{"citing_paper":"/paper/2501.11697"},"observation_digest":"sha256:238b15eaf8ac2e4141d1fb5b18013925f9b960cb6856eeaedb56fe4234c6fda7","observation_id":"27beb972-11d6-41e9-a669-c6b6371d1d6c","resolution":{"observed_at":"2026-08-10T18:09:16.822810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.05390","last_updated":"2022-01-14T11:03:24Z","snapshot_observed_at":"2026-08-17T08:51:57.023871Z","submitted_at":"2022-01-14T11:03:24Z","title":"Delay-Robust Routes in Temporal Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.05390","snapshot_observed_at":"2026-08-10T18:09:16.265791Z","title":"Delay- Robust Routes in Temporal Graphs , January 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2501.11697","last_updated":"2025-01-20T19:22:08Z","snapshot_observed_at":"2026-08-19T01:04:44.802141Z","submitted_at":"2025-01-20T19:22:08Z","title":"Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-10T18:09:16.265791Z"},"links":{"cited_paper":"/paper/2201.05390","citing_paper":"/paper/2501.11697"},"observation_digest":"sha256:88800e53cd8c4f34b4aec56511f20ec80c4b7227841faeb40130ec2bae7cb72c","observation_id":"ab3c9a6a-8caa-455d-a3fc-49e07de4da41","resolution":{"observed_at":"2026-08-10T18:09:16.265791Z","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-10T18:09:16.809041Z","title":"Minimal strong digraphs","venue":null,"work_id":"2b1994a7-e6ab-4f88-881b-e5d100c076e6","year":2012},"citing_paper":{"arxiv_id":"2501.11697","last_updated":"2025-01-20T19:22:08Z","snapshot_observed_at":"2026-08-19T01:04:44.802141Z","submitted_at":"2025-01-20T19:22:08Z","title":"Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-10T18:09:16.269830Z"},"links":{"citing_paper":"/paper/2501.11697"},"observation_digest":"sha256:57640cc0e80f408348429bb1dbdf2ce358c5da10f2d1adfcc5d7a5986de28389","observation_id":"3c6886d4-3c75-462b-9a0f-c4fdbd2af623","resolution":{"observed_at":"2026-08-10T18:09:16.812540Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-10T18:09:16.273625Z","title":"Göbel, J","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2501.11697","last_updated":"2025-01-20T19:22:08Z","snapshot_observed_at":"2026-08-19T01:04:44.802141Z","submitted_at":"2025-01-20T19:22:08Z","title":"Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-10T18:09:16.273625Z"},"links":{"citing_paper":"/paper/2501.11697"},"observation_digest":"sha256:31a98d57271ef2c4c875f600457df00fb1bc6c787d5b5e1b13bb5e7f83cbc040","observation_id":"427c5e3e-f1a6-46f5-ac7d-42f98c5eebd9","resolution":{"observed_at":"2026-08-10T18:09:16.273625Z","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-10T18:09:16.277114Z","title":"Connectivity and Inference Problems for Temporal Networks","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2501.11697","last_updated":"2025-01-20T19:22:08Z","snapshot_observed_at":"2026-08-19T01:04:44.802141Z","submitted_at":"2025-01-20T19:22:08Z","title":"Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-10T18:09:16.277114Z"},"links":{"citing_paper":"/paper/2501.11697"},"observation_digest":"sha256:2da149b7bfe72cd9183f1b6e79b59007e2060cefcac5ea434c653be5f91c65c2","observation_id":"08479155-8355-4884-b47b-c50b91600927","resolution":{"observed_at":"2026-08-10T18:09:16.277114Z","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-10T18:09:16.281519Z","title":"Mertzios, Hendrik Molter, Rolf Niedermeier, and Philipp Zschoche","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.11697","last_updated":"2025-01-20T19:22:08Z","snapshot_observed_at":"2026-08-19T01:04:44.802141Z","submitted_at":"2025-01-20T19:22:08Z","title":"Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-10T18:09:16.281519Z"},"links":{"citing_paper":"/paper/2501.11697"},"observation_digest":"sha256:6205f4d015b9f124e9fee215274eeb4f1d4ea3153f09c1da235404918ecbde15","observation_id":"a595b0c9-0967-4010-b732-6d9795bcd2ea","resolution":{"observed_at":"2026-08-10T18:09:16.281519Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2301.10503","last_updated":"2023-01-25T10:27:11Z","snapshot_observed_at":"2026-08-16T16:00:16.724536Z","submitted_at":"2023-01-25T10:27:11Z","title":"In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?","version":1},"cited_work":{"arxiv_id":"2301.10503","doi":null,"metadata_source":"pith","pith_arxiv_id":"2301.10503","snapshot_observed_at":"2026-08-10T18:09:16.377307Z","title":"In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks?","venue":"cs.DS","work_id":"21acf2e0-810f-488c-8ee0-3f8a749dad30","year":2023},"citing_paper":{"arxiv_id":"2501.11697","last_updated":"2025-01-20T19:22:08Z","snapshot_observed_at":"2026-08-19T01:04:44.802141Z","submitted_at":"2025-01-20T19:22:08Z","title":"Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-10T18:09:16.285344Z"},"links":{"cited_paper":"/paper/2301.10503","citing_paper":"/paper/2501.11697"},"observation_digest":"sha256:936b6e24c38ba282ed034ba0704e526c27f95c8e56cefd8bdff951195bb30483","observation_id":"7f6bc768-1c7c-4cc1-bb1b-66b06eb726ae","resolution":{"observed_at":"2026-08-10T18:09:16.382422Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.06783","last_updated":"2025-01-28T01:43:19Z","snapshot_observed_at":"2026-08-16T18:45:52.283220Z","submitted_at":"2021-02-12T21:39:26Z","title":"The Complexity of Transitively Orienting Temporal Graphs","version":3},"cited_work":{"arxiv_id":"2102.06783","doi":null,"metadata_source":"pith","pith_arxiv_id":"2102.06783","snapshot_observed_at":"2026-08-10T18:09:16.360894Z","title":"The Complexity of Transitively Orienting Temporal Graphs","venue":"cs.DS","work_id":"8acde9da-530b-4ae5-9ebc-b2eecdebccd9","year":2021},"citing_paper":{"arxiv_id":"2501.11697","last_updated":"2025-01-20T19:22:08Z","snapshot_observed_at":"2026-08-19T01:04:44.802141Z","submitted_at":"2025-01-20T19:22:08Z","title":"Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-10T18:09:16.289321Z"},"links":{"cited_paper":"/paper/2102.06783","citing_paper":"/paper/2501.11697"},"observation_digest":"sha256:b7e9ce7688a4a21f2a5e413eb589ad9727b201b454ef6733d81228554c220e46","observation_id":"18cac620-1d99-4458-b9fd-d693cbbe319b","resolution":{"observed_at":"2026-08-10T18:09:16.365671Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.dam.2019.12.012","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T18:09:16.322571Z","title":"A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs","venue":null,"work_id":"cd79fb7a-2132-4c93-93c0-7171309353ca","year":2021},"citing_paper":{"arxiv_id":"2501.11697","last_updated":"2025-01-20T19:22:08Z","snapshot_observed_at":"2026-08-19T01:04:44.802141Z","submitted_at":"2025-01-20T19:22:08Z","title":"Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T18:09:16.292997Z"},"links":{"citing_paper":"/paper/2501.11697"},"observation_digest":"sha256:5ec37ef5e41288861113dec230ba690f4c718e90067f27486fcdb41bcbbddcb2","observation_id":"2ef60e59-d325-44a6-a7b8-bbf2d823d001","resolution":{"observed_at":"2026-08-10T18:09:16.329319Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-10T18:09:16.797784Z","title":"Xuan, Afonso Ferreira, and Aubin Jarry","venue":null,"work_id":"8ce99bc7-2181-4519-a92c-e82d86b40a6b","year":2002},"citing_paper":{"arxiv_id":"2501.11697","last_updated":"2025-01-20T19:22:08Z","snapshot_observed_at":"2026-08-19T01:04:44.802141Z","submitted_at":"2025-01-20T19:22:08Z","title":"Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-10T18:09:16.296125Z"},"links":{"citing_paper":"/paper/2501.11697"},"observation_digest":"sha256:0d28b52c500edc96752b92e8c2c412df4511c36c3d61eb28f5462bc14cab5b4c","observation_id":"d66f406d-a0f6-4e1d-8a79-0f517d6db073","resolution":{"observed_at":"2026-08-10T18:09:16.801957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.11697","last_updated":"2025-01-20T19:22:08Z","latest_version":1,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-19T01:04:44.802141Z","submitted_at":"2025-01-20T19:22:08Z","title":"Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":1,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":9,"verified_exact":2,"verified_fuzzy":7},"total_outbound_references":21},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2501.11697."}