{"as_of":"2026-08-21T02:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:76de7dedf128400496df8c736bb0e2d8158c8c886a466a80cda8d62c13c982b9","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T12:09:16.652414Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"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-08-07T15:44:30.994957Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T15:44:32.163194Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","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:227f8d1f92c87a62362913449f5a60c2107c888376dade5ddd5cd59031692399","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"}}],"links":{"evidence":"/evidence","html":"/paper/2504.14258/citation-record","integrity":"/paper/2504.14258/integrity","json":"/paper/2504.14258/citation-record.json","paper":"/paper/2504.14258"},"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-16T12:09:17.177080Z","title":"Nearly tight low stretch spanning trees","venue":null,"work_id":"1f20573c-382d-4478-93af-d31f2519d6b8","year":2008},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.489881Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:df53635f037008903cbd94a1197c891f3623ad187292424ae3f898f59bf2a84c","observation_id":"9bdcc114-9371-4a2a-983f-6a643f0b2cca","resolution":{"observed_at":"2026-08-16T12:09:17.180817Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:09:16.494463Z","title":"Using petal-decompositions to build a low stretch spanning tree","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.494463Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:02fc06fef09bdf2e8e346e70e5cd4092348d43ef089a78848dba6e2d13be636b","observation_id":"bb9ce004-9c88-45c7-b92f-6d6dc852cb31","resolution":{"observed_at":"2026-08-16T12:09:16.494463Z","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-16T12:09:17.158036Z","title":"Mertzios, and Paul G Spirakis","venue":null,"work_id":"0b1029d6-20ea-4cf2-a6f1-61eabc62306d","year":2017},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.498721Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:3dc4bb39a4524304bfcc656bc7d3ab73dfc02ab3eeb8814c52b76606993d13a9","observation_id":"09d5d9ff-526c-4f20-a279-7fd11877ba3c","resolution":{"observed_at":"2026-08-16T12:09:17.162298Z","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-16T12:09:17.145271Z","title":"Multi-parameter analysis of finding minors and subgraphs in edge-periodic temporal graphs","venue":null,"work_id":"c8b5f438-2981-4801-84d8-e99668f7ebb4","year":2023},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.503281Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:d3f9078f2f79b7d4bc545d39ed6c69956ec6639167d54fa5977ecde3ae2a865c","observation_id":"650d8166-d12c-49bc-bddd-7fcc8b3857cf","resolution":{"observed_at":"2026-08-16T12:09:17.150461Z","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-16T12:09:17.132046Z","title":"Sparse temporal spanners with low stretch","venue":null,"work_id":"c8698f04-acd4-4515-a22a-8ea6ee26fe53","year":2022},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.507087Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:335991a6064148107980a48710d1f42a9730d8f30d5b47edf57a8f4b6f21f5d2","observation_id":"0324ecca-d77a-40e8-a8f9-544793e08c4e","resolution":{"observed_at":"2026-08-16T12:09:17.136833Z","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-16T12:09:17.119376Z","title":"On the realization of a (p, s) -digraph with prescribed degrees","venue":null,"work_id":"025bbfed-0a6e-416c-b2f7-419a7aa43fe2","year":1966},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.510909Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:b3f074b7a7c1881d5ec260ec6d9248b6c278ce5cfc25eaaa9c7a17a1ac84ab50","observation_id":"65337104-753c-40d3-8e71-225e83fab1c8","resolution":{"observed_at":"2026-08-16T12:09:17.123687Z","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-16T12:09:17.106268Z","title":"Fast algorithms for constructing t-spanners and paths with stretch t","venue":null,"work_id":"1cbad353-bf51-4d9d-bd02-760127835f5c","year":1998},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.514558Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:08f4a3ee3da5482ff1521ddad422aab71867617336b4a6ace89058c4029f19c8","observation_id":"75c294e4-2bfd-434f-aaba-83548f9f632f","resolution":{"observed_at":"2026-08-16T12:09:17.110597Z","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-16T12:09:17.093956Z","title":"The monadic second-order logic of graphs","venue":null,"work_id":"7c570b72-7ec8-45a1-9851-11a37caf1650","year":1990},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.518065Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:8874effccd52cb306c688163e66b467ed55018184ac362ff77ce706cf05ac155","observation_id":"4c98dbaf-8e07-4786-9703-6a3c870435bf","resolution":{"observed_at":"2026-08-16T12:09:17.097946Z","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-16T12:09:17.081660Z","title":"Graph structure and monadic second-order logic: a language-theoretic approach , volume 138","venue":null,"work_id":"85f2e689-3390-448d-87e0-a5e0ee073dd0","year":2012},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.521353Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:eb27d5556712d9242b11b29c56e2d45c3222e983a56095cd9454588972f908f9","observation_id":"9509427e-0381-464b-947a-89126ffb3708","resolution":{"observed_at":"2026-08-16T12:09:17.085853Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:09:16.525392Z","title":"Fomin, Lukasz Kowalik, Daniel Lokshtanov, D \\' a niel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.525392Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:cd3eca0d0f4eb6ad32044dcdbe9e4e1ca00ec0b7f6d71ef7f932ea7e1d1a8719","observation_id":"1db3f702-7fd8-475f-b7bd-ac17ae09b9db","resolution":{"observed_at":"2026-08-16T12:09:16.525392Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.13616","snapshot_observed_at":"2026-08-16T12:09:16.528710Z","title":"Copnumbers of periodic graphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.528710Z"},"links":{"cited_paper":"/paper/2310.13616","citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:a7a4c09fe81f1455d1631421d67e4b21ba2aace906efb1e277b421e0d2ea379a","observation_id":"796eb2a9-d6ab-4ee6-a937-4dceeded90be","resolution":{"observed_at":"2026-08-16T12:09:16.528710Z","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-16T12:09:17.062246Z","title":"Cops & robber on periodic temporal graphs: Characterization and improved bounds","venue":null,"work_id":"0b383153-3b6c-418e-a6eb-3ebeb5fb1708","year":2023},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.533426Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:6f333442b184b50398a2f2510a77c8894f66575860a972b49b2bd0646fa9a428","observation_id":"b5199d71-b050-4db4-813c-a736d4a8292d","resolution":{"observed_at":"2026-08-16T12:09:17.066027Z","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-16T12:09:17.050301Z","title":"Optimizing reachability sets in temporal graphs by delaying","venue":null,"work_id":"d17e3acd-cafc-4bae-affc-fb18fe62202a","year":2022},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.536772Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:3c5cc1174ef53c1f109b5625c385543dedce52ab5ca88a5bd30d6e8ae368708a","observation_id":"bf1d48a6-39b3-4a7f-9f67-f02da9a42111","resolution":{"observed_at":"2026-08-16T12:09:17.054535Z","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-16T12:09:17.037638Z","title":"Graph Theory, 5th Edition , volume 173 of Graduate Texts in Mathematics","venue":null,"work_id":"df96f8df-b035-407f-bff2-ba010b565659","year":2016},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.540423Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:759b795adaf4a82752ca9642bb3fb560bc89609ba9ae4277d3a26bf8d1acfb30","observation_id":"3f8a20b6-c2f1-4ff0-bf06-1c50121ca4f5","resolution":{"observed_at":"2026-08-16T12:09:17.042053Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:09:16.543881Z","title":"Spielman, and Shang - Hua Teng","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.543881Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:559dc474e9b8a9435b63cbfd7b25c82f6a431770cbd711ee8a60ba36b03cdcb9","observation_id":"9dce3062-e4ff-449b-87e7-7c83a24142ff","resolution":{"observed_at":"2026-08-16T12:09:16.543881Z","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-16T12:09:17.017603Z","title":"Approximating minimum max-stretch spanning trees on unweighted graphs","venue":null,"work_id":"b127567b-a861-45c6-b992-3fe947e09959","year":2008},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.547443Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:4d50c8c81d556d080c5e447e691553082429a689bff6343bf7f95d521983564d","observation_id":"9b72e913-9319-4a2e-ba7a-d8909c579c87","resolution":{"observed_at":"2026-08-16T12:09:17.022476Z","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-16T12:09:17.006477Z","title":"Mertzios, and Viktor Zamaraev","venue":null,"work_id":"a5c0a658-9dee-45d9-8c4c-1f7b00fb209a","year":2021},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.550930Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:19b64c550a6bf2f386c5f9e12635c9aa8d7c6f1ba3c220232f6c44a81c14799e","observation_id":"9988199b-4b64-4fed-9e47-ea8c391de70b","resolution":{"observed_at":"2026-08-16T12:09:17.009914Z","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-16T12:09:16.995369Z","title":"Assigning times to minimise reachability in temporal graphs","venue":null,"work_id":"560367a4-5faf-4447-9371-02c1838a597c","year":2021},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.555331Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:88299f9dc325a4d967be6d6cb702e374cc8c831bc8fb2a10c84e0235197f6c7b","observation_id":"91572686-9b14-40a2-91bd-0c5f59d3bbcd","resolution":{"observed_at":"2026-08-16T12:09:16.999734Z","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-16T12:09:16.982568Z","title":"Graphs with prescribed degrees of vertices","venue":null,"work_id":"89f5aaef-8b21-4ca8-a2bb-52654e23c09f","year":1960},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.558669Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:820ff6ba4b97afb151bddc5edfb65cace8b6b7b290ff3631c5a3eeb2d38de7b9","observation_id":"c08748d3-7f7d-44fe-9fa7-369caff56ff7","resolution":{"observed_at":"2026-08-16T12:09:16.987184Z","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":"2503.15771","last_updated":"2025-03-20T01:07:39Z","snapshot_observed_at":"2026-08-16T12:48:25.939196Z","submitted_at":"2025-03-20T01:07:39Z","title":"Recognizing and Realizing Temporal Reachability Graphs","version":1},"cited_work":{"arxiv_id":"2503.15771","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.15771","snapshot_observed_at":"2026-08-16T12:09:16.691510Z","title":"Recognizing and Realizing Temporal Reachability Graphs","venue":"cs.CC","work_id":"fc73792c-e2c4-42f6-920a-2be0f4eef436","year":2025},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.562430Z"},"links":{"cited_paper":"/paper/2503.15771","citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:c249063047cb8d823974ea026916bbf3de9b6728694cb4adf7622f0b7479b198","observation_id":"92a1c6f4-48ea-4df1-9483-3647b56d3b65","resolution":{"observed_at":"2026-08-16T12:09:16.697605Z","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-16T12:09:16.970660Z","title":"Spooner, and Petra Wolf","venue":null,"work_id":"bb10cd0a-e542-4523-94d0-830cee7e8e22","year":2024},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.566275Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:cfc96a4e5e6910e76554aee600679de7f44b3c0f14f2638e85aaa5267736398a","observation_id":"5fb229e2-ac5c-4cbc-a449-a4df2b100a09","resolution":{"observed_at":"2026-08-16T12:09:16.974598Z","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-16T12:09:16.958760Z","title":"Parameterized algorithms for multi-label periodic temporal graph realization","venue":null,"work_id":"7452f1f9-a58c-45a4-80fa-47f8e6470f32","year":2024},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.570765Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:c96b8c1c5b77f48fe6f0ec3ed1209ac8117e3b2a0e16d3125f1fa8d58a01484f","observation_id":"db58902a-3d75-48f7-ab5c-c13aff51c2fa","resolution":{"observed_at":"2026-08-16T12:09:16.962714Z","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-16T12:09:16.947236Z","title":"Fellows, Fedor V","venue":null,"work_id":"acccaa34-df75-4ced-9dde-20114347aad1","year":2012},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.574828Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:0866c4450ddf424b25f38a24cd05e4ffd725922868c516b68b9e48aa827ace4f","observation_id":"c94ed5d4-8534-432c-9db6-875c25986619","resolution":{"observed_at":"2026-08-16T12:09:16.951475Z","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-16T12:09:16.935039Z","title":"Temporal graph classes: A view through temporal separators","venue":null,"work_id":"a9eac3a1-e286-4e8c-89b3-5fd3d5edc5ec","year":2020},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.578553Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:78ce56f430a1bd7fffaf0fbf00ebeb090739d488456d8557e947ac3d610943d3","observation_id":"b34f0c9b-ce51-4360-aa27-b5b3ec7437ee","resolution":{"observed_at":"2026-08-16T12:09:16.939337Z","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-16T12:09:16.921125Z","title":"Label-connected graphs and the gossip problem","venue":null,"work_id":"08dd7bd0-2452-4747-b454-d51ee43070d6","year":1991},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.581960Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:12c4957f83d1eab2d33e2a2d5ac6404fd1055148677ca9b4a0c6eed58ef45027","observation_id":"454e58ef-e40c-413f-b0f7-99d86bc191f4","resolution":{"observed_at":"2026-08-16T12:09:16.925328Z","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-16T12:09:16.907587Z","title":"Local search for string problems: Brute-force is essentially optimal","venue":null,"work_id":"3def4ead-be32-4d7b-847e-99e5eb6a2471","year":2014},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.585748Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:6d4a430b2f79654bbd8928d8b289625aa81a377b7fe364c216a1c0940f388fbe","observation_id":"aeaa5d87-b3d8-48b4-934b-357126d76533","resolution":{"observed_at":"2026-08-16T12:09:16.911817Z","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-16T12:09:16.893559Z","title":"Louis Hakimi","venue":null,"work_id":"6fb6c387-2e59-44c7-88b4-43503c921580","year":1962},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.589849Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:0e849d27b9146498e62e72a315d33df2fa651e0b20a6e728beb4c75408bf551a","observation_id":"ca30e2ee-d761-403c-935e-439c10302d14","resolution":{"observed_at":"2026-08-16T12:09:16.898730Z","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-16T12:09:16.879869Z","title":"Louis Hakimi and Stephen S","venue":null,"work_id":"99155b6b-6eef-4fdd-b3e2-be3025733113","year":1965},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.593949Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:03250bf47c013de11175286516e290a19415e3d894d2022c8131e575b3ca4b84","observation_id":"e80b2a88-3d60-45a4-aafa-5dc08442fa21","resolution":{"observed_at":"2026-08-16T12:09:16.884764Z","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-16T12:09:16.867858Z","title":null,"venue":null,"work_id":"47cfb41c-85ed-47b2-bf49-871a3fe516ef","year":1972},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.597654Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:b7f93fe71ff2f72b8ef6933754dc026bc5fc6b39d08e9a50a66389db03028de4","observation_id":"6c5e571c-5000-4376-b14f-5e4cfa435c91","resolution":{"observed_at":"2026-08-16T12:09:16.871882Z","resolver_source":"raw_fallback","status":"unresolved"},"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-16T12:09:16.856602Z","title":"Kleinberg, and Amit Kumar","venue":null,"work_id":"b9d38924-f94f-40d7-b63b-4b5442a3fe17","year":2002},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.601407Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:38757957857d1d4502747f7a7f4e2a1d030b8aea288f6760f0f1ba999d479ebf","observation_id":"d96e014c-7981-4758-8412-6b6757f08971","resolution":{"observed_at":"2026-08-16T12:09:16.860882Z","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-16T12:09:16.845919Z","title":"Mertzios, Hendrik Molter, and Paul G","venue":null,"work_id":"e803686d-0757-4eb1-b968-cbfee3db67fc","year":2024},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.605973Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:bcfe386921e014f4c14c454015d083b32936f5d2bfcc2d05f6481b86412d2324","observation_id":"79aa136c-93aa-4efa-b7a4-027101b1ba3c","resolution":{"observed_at":"2026-08-16T12:09:16.849832Z","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-16T12:09:16.835682Z","title":"Mertzios, Hendrik Molter, and Paul G","venue":null,"work_id":"c767e773-baa8-47d3-bb89-4e2d9749afbf","year":2024},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.609167Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:3eefad8510126e94cee830a11d637a9b5430c3a0bbb91fee8c6f1bf24036d18c","observation_id":"1f8635b1-b6e3-4da9-8f43-2b18ed03b43d","resolution":{"observed_at":"2026-08-16T12:09:16.839214Z","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-16T12:09:16.824590Z","title":"Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity","venue":null,"work_id":"9beb96fa-aadb-40f4-832a-0d76b8de362b","year":2019},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.613500Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:aab88aaf381a7e8924cb0bf3229ea6792def5f409f233811b2cf515e6526e7d5","observation_id":"9fe77d12-93aa-4bec-9b37-2443e23507a8","resolution":{"observed_at":"2026-08-16T12:09:16.828537Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T12:09:16.616789Z","title":"Algorithmic meta-theorems for restrictions of treewidth","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.616789Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:0d420fe550e1ae987e94ce01a3cb4cf0ac567e765ba1d2a26a11ba06abe82fbf","observation_id":"8b556d99-331f-4d7d-8afc-21aa7d2ff63b","resolution":{"observed_at":"2026-08-16T12:09:16.616789Z","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-16T12:09:16.806961Z","title":"Searching the k -change neighborhood for TSP is W [1]-hard","venue":null,"work_id":"80ae47a3-ace3-4cab-b4df-ec4b27c5a3d2","year":2008},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.619932Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:45c1cfd000e1341e40962729b54bc914103a8d662067faaa7dcb57828909ba86","observation_id":"2b0279a1-331e-4c53-95e3-a017ef1f42ba","resolution":{"observed_at":"2026-08-16T12:09:16.810612Z","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-16T12:09:16.795505Z","title":"Reducing reachability in temporal graphs: Towards a more realistic model of real-world spreading processes","venue":null,"work_id":"cfd6f1a2-5455-4aba-8c5e-440a64c5d437","year":2022},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.623384Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:c04abd13cbc4edcb959a21e44dcff1275ab616a2494d55d2b5bf620c2c772a69","observation_id":"ea15a4c9-ad3b-4a8e-ae6b-f95082f298e1","resolution":{"observed_at":"2026-08-16T12:09:16.799783Z","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-16T12:09:16.785619Z","title":"Mertzios, Othon Michail, and Paul G","venue":null,"work_id":"51fba266-4ea6-4b93-b804-f3f507d9b99d","year":2019},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.626823Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:dddfd6bb7914e89d7ab4d32027e8a715aa588590499e75cd48e4dfd856366aec","observation_id":"190c02de-5e21-4076-a656-ed5f4371e572","resolution":{"observed_at":"2026-08-16T12:09:16.789000Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.18513","snapshot_observed_at":"2026-08-16T12:09:16.630091Z","title":"Mertzios, Hendrik Molter, Nils Morawietz, and Paul G","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.630091Z"},"links":{"cited_paper":"/paper/2403.18513","citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:0e12b16f049fe5d8d531866f41a609eb45ee3a29db250ba6b8e886190dad549f","observation_id":"cac4c61a-5281-4dc6-96b4-b6160e833c70","resolution":{"observed_at":"2026-08-16T12:09:16.630091Z","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-16T12:09:16.773188Z","title":"Directed temporal tree realization for periodic public transport: Easy and hard cases, 2025","venue":null,"work_id":"bd4bcefd-ce97-481a-93a3-b39bd141bde8","year":2025},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.634508Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:94e4c96473ec153f73588882c59062ea3145b2ceb11dffec482fe7bd0df84f43","observation_id":"c9c29cac-b51f-44d7-b61c-e2ca2a671352","resolution":{"observed_at":"2026-08-16T12:09:16.777875Z","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-16T12:09:16.761355Z","title":"Temporal reachability minimization: Delaying vs","venue":null,"work_id":"ef9ba277-6bd7-4fee-a645-9a67f5390a81","year":2024},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.638078Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:a07e59fa8677c6d3a44122f4667974ba5bad7c668b47ad7b72706bb8c3e2a106","observation_id":"fb38c2d5-1ab9-4379-85f7-07de32cab5eb","resolution":{"observed_at":"2026-08-16T12:09:16.764865Z","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-16T12:09:16.750083Z","title":"On the complexity of local search problems with scalable neighborhoods","venue":null,"work_id":"e48c327b-834e-424b-a270-41a2167c3aa5","year":2024},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.641847Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:0f64265a3ba92e9990c2ab4fed007dddccc92ef0b74ea9c1430235935a9573f8","observation_id":"640d7284-7cc1-4c01-a42c-0d7de000acdb","resolution":{"observed_at":"2026-08-16T12:09:16.753841Z","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-16T12:09:16.738005Z","title":"A timecop's work is harder than you think","venue":null,"work_id":"1ed35254-cb23-4a57-9ee0-a335833e283a","year":2020},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.645178Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:a069dfd83ac2315b1499b7dc7d4bd945b6be59c85d360c40d1575ba40b8c2199","observation_id":"61b61589-dc44-43ef-8d15-f742f6a263f6","resolution":{"observed_at":"2026-08-16T12:09:16.741776Z","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-16T12:09:16.726920Z","title":"A timecop's chase around the table","venue":null,"work_id":"03d6348e-a84e-4f48-b142-b32c243bfc66","year":2021},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.648420Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:fbf72672215a839ffe1c6bee8dd1e6c218fa26c9672e28833d52f5ae266e8d28","observation_id":"650a1405-cb8d-48a6-a29e-7bf8cd603deb","resolution":{"observed_at":"2026-08-16T12:09:16.730402Z","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-16T12:09:16.716122Z","title":"The complexity of finding separators in temporal graphs","venue":null,"work_id":"5898ce8d-a502-4995-ad7f-ea0e8d70090d","year":2020},"citing_paper":{"arxiv_id":"2504.14258","last_updated":"2025-04-19T10:35:43Z","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-16T12:09:16.652414Z"},"links":{"citing_paper":"/paper/2504.14258"},"observation_digest":"sha256:e9274183c3219b9db9660df0be13dfad7a9dd2f7811085098b087e303690027c","observation_id":"3af8fc73-10dc-4726-ad63-f365ff25f888","resolution":{"observed_at":"2026-08-16T12:09:16.719767Z","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":"2504.14258","last_updated":"2025-04-19T10:35:43Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-20T19:49:12.555766Z","submitted_at":"2025-04-19T10:35:43Z","title":"Temporal Graph Realization With Bounded Stretch"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":7,"verified_exact":1,"verified_fuzzy":36},"total_outbound_references":44},"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 21 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 1 inbound Pith citation observation for arXiv:2504.14258."}