{"as_of":"2026-08-20T14:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4352c8c5925f8232e048e8029bf4be19243ea8d4f3b87906679437b4675000ea","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:44:31.518204Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-13T05:00:02.957536Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"cited_work":{"arxiv_id":"2505.14046","doi":"10.48550/arxiv.2505.14046","metadata_source":"arxiv_reference","pith_arxiv_id":"2505.14046","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Exploring","venue":"ArXiv.org","work_id":"3a3258e8-d3f0-4ebe-90f6-d63275032dfd","year":2025},"citing_paper":{"arxiv_id":"2605.11873","last_updated":"2026-05-12T09:51:59Z","snapshot_observed_at":"2026-08-17T11:11:48.016918Z","submitted_at":"2026-05-12T09:51:59Z","title":"Maximizing Reachability via Shifting of Temporal Paths","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-13T05:00:02.957536Z"},"links":{"cited_paper":"/paper/2505.14046","citing_paper":"/paper/2605.11873"},"observation_digest":"sha256:aec0bffe0acfa328dd7d2911f7b3a33f4d1dcc75e812e56ab289045bf8119174","observation_id":"23da5058-5792-46a7-a5b4-aeb39c4fd182","resolution":{"observed_at":"2026-05-13T05:02:16.803297Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.14046/citation-record","integrity":"/paper/2505.14046/integrity","json":"/paper/2505.14046/citation-record.json","paper":"/paper/2505.14046"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.18987","last_updated":"2025-04-10T14:25:43Z","snapshot_observed_at":"2026-08-09T21:41:04.805291Z","submitted_at":"2025-01-31T09:34:44Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","version":2},"cited_work":{"arxiv_id":"2501.18987","doi":null,"metadata_source":"pith","pith_arxiv_id":"2501.18987","snapshot_observed_at":"2026-08-07T15:44:33.756622Z","title":"Better late, then? The hardness of choosing delays to meet passenger demands in temporal graphs","venue":"cs.DS","work_id":"631645c3-e386-48ba-b4dd-f4da2934b8dd","year":2025},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:28.905413Z"},"links":{"cited_paper":"/paper/2501.18987","citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:5a7de18e7f94f90bdffb7f8ba343a01923e56c19ae11d814857c6ee303793a9f","observation_id":"a79fa560-860b-401c-83a8-02a586e91ccd","resolution":{"observed_at":"2026-08-07T15:44:33.888599Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T15:44:39.727251Z","title":"Multi-species temporal network of livestock movements for disease spread.Applied Network Science, 2021.6:1–20","venue":null,"work_id":"e3a91d6f-13ae-4997-b912-e75b19b59a27","year":2021},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:28.992424Z"},"links":{"citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:e4ea407b006a020e347e00d89ab20413910e170e4502f5d2f7f1755d724cead4","observation_id":"7994b7df-0567-494f-b5a2-069de403bb46","resolution":{"observed_at":"2026-08-07T15:44:39.902068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T15:44:39.537354Z","title":"Traveling salesman problems in temporal graphs.Theoretical Computer Science, 2016.634:1–23","venue":null,"work_id":"a170f1aa-268a-4eaa-a53a-8d2c25e69ece","year":2016},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:29.092315Z"},"links":{"citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:674ca85b969cceb9ea5bd8933ac479b9f3f52b7b9135936a8ea321848f9165d7","observation_id":"a3b37e93-3aef-4108-a486-34e37548c49d","resolution":{"observed_at":"2026-08-07T15:44:39.614605Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T15:44:39.375244Z","title":"Optimizing reachability sets in temporal graphs by delaying.Inf","venue":null,"work_id":"5192ddd4-36e8-4f9e-afb0-f5201ad2ebfb","year":2022},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:29.245000Z"},"links":{"citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:35aea01795e9d0dd5ff2fde29875636d39c0c0e0905a40ece18ba12c1e16b905","observation_id":"f00db556-4924-4053-9858-f672d10c4a7a","resolution":{"observed_at":"2026-08-07T15:44:39.419803Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T15:44:38.986766Z","title":"Deleting edges to restrict the size of an epidemic in temporal networks.Journal of Computer and System Sciences, 2021.119:60–77","venue":null,"work_id":"269be88c-da3e-4027-bf8f-447de9f291b1","year":2021},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:29.354958Z"},"links":{"citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:7283e953e2b9f402d979ef604f95c0b0e2acc1d9a626169928b0a2b2289fdb3f","observation_id":"1577d3d2-8d9f-4db7-b75f-af85ec506ebd","resolution":{"observed_at":"2026-08-07T15:44:39.185090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T15:44:38.709660Z","title":"Reducing Reachability in Temporal Graphs: Towards a More Realistic Model of Real-World Spreading Processes","venue":null,"work_id":"5dad2853-d5e0-466a-8057-c7c7afa202b9","year":2022},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:29.464861Z"},"links":{"citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:fddd4c4eb091a1409addcc788fb5aa29bbfad9879449d0b366768d4fc1756c0e","observation_id":"e789a86f-ddb3-4002-9c53-8ac54184b56a","resolution":{"observed_at":"2026-08-07T15:44:38.811236Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T15:44:38.234728Z","title":"Faster Exploration of Some Temporal Graphs","venue":null,"work_id":"d7d78f3e-5a10-4ee4-851d-6a30c0348e64","year":2022},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:29.558145Z"},"links":{"citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:fb5300e02c12e047be33e6d83cbd55eca0f106710d76376cdd1f9117f3ae1c1c","observation_id":"3d84d3cf-ef12-4cbc-8daa-8b493b509d65","resolution":{"observed_at":"2026-08-07T15:44:38.454733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.10110","last_updated":"2023-02-20T17:14:06Z","snapshot_observed_at":"2026-08-16T15:54:03.686102Z","submitted_at":"2023-02-20T17:14:06Z","title":"Kernelizing Temporal Exploration Problems","version":1},"cited_work":{"arxiv_id":"2302.10110","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.10110","snapshot_observed_at":"2026-08-07T15:44:33.340868Z","title":"Kernelizing Temporal Exploration Problems","venue":"cs.CC","work_id":"1fa94036-b30c-4284-a088-2466c56bc152","year":2023},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:29.685009Z"},"links":{"cited_paper":"/paper/2302.10110","citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:9b544a441561e37276cbd10dd1d2cd0726f4113f5da596e8a4d56125924d558a","observation_id":"be0a2abd-91c8-4bb0-8fd0-5979caf87ef1","resolution":{"observed_at":"2026-08-07T15:44:33.544749Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.07140","last_updated":"2024-07-18T07:48:03Z","snapshot_observed_at":"2026-08-16T14:35:33.541690Z","submitted_at":"2023-12-12T10:23:03Z","title":"Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous","version":2},"cited_work":{"arxiv_id":"2312.07140","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.07140","snapshot_observed_at":"2026-08-07T15:44:32.864448Z","title":"Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous","venue":"cs.DS","work_id":"b70a5c5e-0f4b-477c-be9a-52b8ae233e16","year":2023},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:29.774934Z"},"links":{"cited_paper":"/paper/2312.07140","citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:47775aa434068481d6612f62f7d12ec901d73d41e5a09da0acdca826081a9dbb","observation_id":"97e0c8e7-2942-4193-8f0f-c5e9e19d7f47","resolution":{"observed_at":"2026-08-07T15:44:33.042417Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T15:44:37.498424Z","title":"On temporal graph exploration.Journal of Computer and System Sciences, 2021.119:1–18","venue":null,"work_id":"74aed8b3-4381-407c-9360-6f40ebc033c5","year":2021},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:29.904889Z"},"links":{"citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:3e628da433b9dc999964a6390caafcef364fb82221576737df5c5d088d314996","observation_id":"0c3669cf-6feb-471c-bfb4-1f11ed243570","resolution":{"observed_at":"2026-08-07T15:44:37.674124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T15:44:37.256283Z","title":"Two moves per time step make a difference","venue":null,"work_id":"f210d430-348e-4181-8ef2-1755e5539600","year":2019},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:30.017905Z"},"links":{"citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:54ae069ca929582123cf21a4dfad0450ed825945146b6bc278ff6b2a0ba5e2b5","observation_id":"6713425f-1920-4223-9195-f678125e87dd","resolution":{"observed_at":"2026-08-07T15:44:37.357192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T15:44:36.924744Z","title":"Exploration ofk-Edge-Deficient Temporal Graphs","venue":null,"work_id":"1a92b468-3c1b-41ce-9bb3-b3889b32f4df","year":2021},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:30.152830Z"},"links":{"citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:fc0609b6ea4b47db1e6f8305bbe0c9b9676f2f53a1ce0e2f65542c423f46471f","observation_id":"5498e8fb-3abe-4cf7-be61-5497800b909d","resolution":{"observed_at":"2026-08-07T15:44:37.034327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T15:44:36.655534Z","title":"Parameterised temporal exploration problems.Journal of Computer and System Sciences, 2023.135:73–88","venue":null,"work_id":"1115813b-b1e8-443b-a3d0-134907a8b272","year":2023},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:30.254770Z"},"links":{"citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:23e9e8a905bc30aeca9433b1c7000bbe044118b894cc5c98e91ea1a262e97349","observation_id":"b3c01d64-521c-4872-a10e-6f342f951d34","resolution":{"observed_at":"2026-08-07T15:44:36.823309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T15:44:36.356931Z","title":"On exploring always-connected temporal graphs of small pathwidth","venue":null,"work_id":"0f08ed97-c4a0-4d67-8ec5-90dd125acb3d","year":2019},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:30.364748Z"},"links":{"citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:05b43f3c773561fc83e283a26866ddcd3fbbcad37e3f2a6c473f0ba3296e0c44","observation_id":"509a634b-d7f5-4e7a-8c82-db2123e938d6","resolution":{"observed_at":"2026-08-07T15:44:36.484812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T15:44:36.094859Z","title":"The temporal explorer who returns to the base","venue":null,"work_id":"9126f4ef-95ef-4c53-a6d6-da6af77fd0db","year":2021},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:30.450878Z"},"links":{"citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:541e5395e962c18735b6de92c550a26c4bb21f5038b1899833ad708b1af917ce","observation_id":"65e534a7-8c38-42cc-9394-d2c96a762bf0","resolution":{"observed_at":"2026-08-07T15:44:36.174745Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T15:44:35.749023Z","title":"Exploring temporal cycles and grids","venue":null,"work_id":"02397b34-6688-4169-ad9d-cbfc46fcaf41","year":2020},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:30.575448Z"},"links":{"citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:fe4e3d32dcdd07fbeff5fec1513811dc4ea49b89b55e8b913e6ddab823ef2661","observation_id":"70e901bd-6bb6-482a-99e0-c7c0a87cf77d","resolution":{"observed_at":"2026-08-07T15:44:35.895478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T15:44:35.487548Z","title":"Multi-parameter analysis of finding minors and subgraphs in edge-periodic temporal graphs","venue":null,"work_id":"c44c4002-1fb3-4773-9ad1-bbc7d54e8ab9","year":2023},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:30.665867Z"},"links":{"citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:62127519a86ae0b724e3b4ba1a7494a8f33383c0172cde1e4c305408cd7db849","observation_id":"1f3bc127-cc9a-4c9f-9c54-30d0d94f1772","resolution":{"observed_at":"2026-08-07T15:44:35.621601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T15:44:35.223741Z","title":"Parameterized Algorithms for Multi-Label Periodic Temporal Graph Re- alization","venue":null,"work_id":"d600c74b-8fc6-4296-b784-63ea790ffb9f","year":2024},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:30.756137Z"},"links":{"citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:148c96e26506ad3cbd818ff5b80f8ae5b57dae0aa04ba8716e905a5b720a58a5","observation_id":"eb0b44d4-7ce4-4c87-b364-dfe4f75f1bab","resolution":{"observed_at":"2026-08-07T15:44:35.390502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.18513","last_updated":"2025-04-19T17:41:03Z","snapshot_observed_at":"2026-08-20T14:03:19.837798Z","submitted_at":"2024-03-27T12:44:27Z","title":"Realizing temporal transportation trees","version":3},"cited_work":{"arxiv_id":"2403.18513","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.18513","snapshot_observed_at":"2026-08-07T15:44:32.405731Z","title":"Realizing temporal transportation trees","venue":"cs.DS","work_id":"f78d5c95-1977-4c5d-bcf5-357b4a2521a8","year":2024},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:30.831533Z"},"links":{"cited_paper":"/paper/2403.18513","citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:527ac280ea6e2732aa4549f15d7c19b11275c894318fb7222a1a8477578d1419","observation_id":"943860ff-9532-4b5b-af3c-9f6e6a8a6c87","resolution":{"observed_at":"2026-08-07T15:44:32.535581Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-16T11:50:52.626228Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"cited_work":{"arxiv_id":"2504.14258","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.14258","snapshot_observed_at":"2026-08-07T15:44:32.163194Z","title":"Temporal Graph Realization With Bounded Stretch","venue":"cs.DS","work_id":"45f7862d-b7ec-4f56-afe1-dfd290b22309","year":2025},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:30.994957Z"},"links":{"cited_paper":"/paper/2504.14258","citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:b8887be2efc4473eeea69a90dc036caa66a2b1a6ef2663ad5c1f30a8aca7f860","observation_id":"810d3912-9854-4bea-a97a-c374e3fc5e3c","resolution":{"observed_at":"2026-08-07T15:44:32.225102Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.13616","last_updated":"2024-10-29T16:55:19Z","snapshot_observed_at":"2026-08-20T14:03:15.824180Z","submitted_at":"2023-10-20T16:05:58Z","title":"Cop numbers of periodic graphs","version":2},"cited_work":{"arxiv_id":"2310.13616","doi":null,"metadata_source":"pith","pith_arxiv_id":"2310.13616","snapshot_observed_at":"2026-08-07T15:44:31.773179Z","title":"Cop numbers of periodic graphs","venue":"math.CO","work_id":"b4d879dd-1dd7-49b9-ab31-54390b0dc5e8","year":2023},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:31.106768Z"},"links":{"cited_paper":"/paper/2310.13616","citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:0fcef233da2c7fc6d6f582eff79d4c7a6ac846281b2608a28ca2e3e89b2afcd4","observation_id":"a1678bb7-1f08-40cf-a7eb-1fa8bd2e0f42","resolution":{"observed_at":"2026-08-07T15:44:31.914882Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T15:44:34.954770Z","title":"A cop and robber game on edge-periodic temporal graphs","venue":null,"work_id":"5f5462ea-9db1-41ea-9e3a-2447e7024115","year":2024},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:31.222436Z"},"links":{"citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:263054dd16b629ea273d008784dc24e2a8b8ac59243827922e7b4ba0b5ef4773","observation_id":"f42cc6f9-c331-40e7-acb1-46e2276ad1e9","resolution":{"observed_at":"2026-08-07T15:44:35.094032Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T15:44:34.666234Z","title":"Restless Exploration of Periodic Temporal Graphs","venue":null,"work_id":"0d49fdfd-9f08-4cf3-a6ed-18951e57aff5","year":2023},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:31.354892Z"},"links":{"citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:fae240f8d1db89df5c9ef4d7731ba4f29fd5c86675597e03914202cc79d94db5","observation_id":"721795c2-dccc-45f1-85af-f330d948d14d","resolution":{"observed_at":"2026-08-07T15:44:34.757353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T15:44:34.284497Z","title":"On the shortest spanning subtree of a graph and the traveling salesman problem.Proceedings of the American Mathematical society, 1956.7(1):48–50","venue":null,"work_id":"2b675646-e1c8-456c-a3cb-a1b3785d1e6b","year":1956},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:31.447485Z"},"links":{"citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:73c8c90c5788ffd424f175f8e024da9dc01c519102f7d1ab2dae585bb903d9b6","observation_id":"f6b2d917-f7cb-4dd9-83ab-a828a45a08d4","resolution":{"observed_at":"2026-08-07T15:44:34.455088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-07T15:44:34.068614Z","title":"Deterministic Subgraph Detection in Broadcast CONGEST","venue":null,"work_id":"e751da14-7a72-481f-ba2a-4213e7d6d29b","year":2018},"citing_paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T15:44:31.518204Z"},"links":{"citing_paper":"/paper/2505.14046"},"observation_digest":"sha256:940579e3ffe117519e7c1c3b1f4c05671eb909911299818c9f711fa0ad115cd9","observation_id":"975b4195-f498-4827-a539-6fe595a17037","resolution":{"observed_at":"2026-08-07T15:44:34.165849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.14046","last_updated":"2025-05-20T07:44:36Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-07T15:39:34.757966Z","submitted_at":"2025-05-20T07:44:36Z","title":"Exploring Temporal Graphs with Frequent and Regular Edges"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":6,"verified_fuzzy":19},"total_outbound_references":25},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 1 inbound Pith citation observation for arXiv:2505.14046."}