{"as_of":"2026-08-19T18:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bf4c369ddc0940ae1ed821d7fe9a7871770a339c577160be8339fcacbd03607b","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-24T05:36:31.843747Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T18:09:16.230562Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","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":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.06260","snapshot_observed_at":"2026-08-10T18:09:16.230562Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs, December 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.11697","last_updated":"2025-01-20T19:22:08Z","snapshot_observed_at":"2026-08-19T01:04:44.802141Z","submitted_at":"2025-01-20T19:22:08Z","title":"Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T18:09:16.230562Z"},"links":{"cited_paper":"/paper/2312.06260","citing_paper":"/paper/2501.11697"},"observation_digest":"sha256:5c22443164a160bd90599996fe7550a3151cb0bb06bb9551402b73d524e2b653","observation_id":"95d73971-e5ab-4c9d-b977-d5bf9dee090e","resolution":{"observed_at":"2026-08-10T18:09:16.230562Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"cited_work":{"arxiv_id":"2312.06260","doi":"10.48550/arxiv.2312.06260","metadata_source":"pith","pith_arxiv_id":"2312.06260","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","venue":"cs.DM","work_id":"f5c1718c-10a7-4d74-93dc-ce393c1b0f99","year":2023},"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":196,"source":"arxiv_source","source_observed_at":"2026-05-13T05:00:02.957536Z"},"links":{"cited_paper":"/paper/2312.06260","citing_paper":"/paper/2605.11873"},"observation_digest":"sha256:c09447740079a0710b0a696b21d06a63c2fe504f8e0055789a09fbfe529797a9","observation_id":"7a0879f9-7290-4415-97cf-460d094a1333","resolution":{"observed_at":"2026-05-13T05:02:16.848790Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2312.06260/citation-record","integrity":"/paper/2312.06260/integrity","json":"/paper/2312.06260/citation-record.json","paper":"/paper/2312.06260"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Temporal flows in temporal networks","venue":null,"work_id":"ea62adc0-fcbb-4731-be8b-8708422b3b55","year":2019},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:9af30472c2cca04baa9eb48eff9cf8e38f0cb7acd3c64eb16f26d5201da23370","observation_id":"928d6bdb-85e6-4940-9b88-9f0152f04379","resolution":{"observed_at":"2026-05-24T05:38:56.739394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Akrida, Leszek Gasieniec, George B","venue":null,"work_id":"a50c23e8-1e1b-440c-9639-5763821522f2","year":2017},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:567e1f1a45b2c04db09882c2eccf37f2ebcf0143995673d1c6aa7de11f87b1ad","observation_id":"130fd964-b9b2-4430-82de-7b227de049b8","resolution":{"observed_at":"2026-05-24T05:38:56.732021Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On implementing stabilizing leader election with weak assumptions on netwo rk dynamics","venue":null,"work_id":"271345b4-939f-49c9-a2e1-5188e32f15d3","year":2021},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:a375c8683b53a9a33ed0be651b3d09b2588a673a2bc58d113da52f72a0f16d96","observation_id":"75ffeb01-4040-4cdb-934b-ef75c7d012f9","resolution":{"observed_at":"2026-05-24T05:38:56.729438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On the size and the approximability of minimum temporally connected subgraphs","venue":null,"work_id":"55885a80-c868-4631-baab-39827353a06e","year":2016},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:f08344d6faaadf2d6ab4861013228cabad1df649b25993b321bad5f7d459391e","observation_id":"d84f887b-eb6c-47ba-80b5-47d092e88e3e","resolution":{"observed_at":"2026-05-24T05:38:56.734454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Parsimonious flooding in dynamic graphs","venue":null,"work_id":"2391ebc1-c45e-4966-b5a5-a21e5eec87d3","year":2011},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:98330df01dd42c1fbacb8c183d64dc07a71a6ca71929c7c73d6e26d2e1e3ad51","observation_id":"ea78b034-85fc-4e2b-aff1-35f9ca09193d","resolution":{"observed_at":"2026-05-24T05:38:56.736888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Complexity of connec ted components in evolving graphs and the computation of multicast trees in dynamic networks","venue":null,"work_id":"35d31aab-5d98-49f1-97bb-2c1012ebde99","year":2003},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:557ac2b719b561bcd71b00594900760c927a6a0fdb3db8be6721e633832e59d9","observation_id":"f7f12fc8-e662-457e-bd55-12acf5b1ad6a","resolution":{"observed_at":"2026-05-24T05:38:56.724326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Blackout-tolerant temporal spanners","venue":null,"work_id":"a4e0dddd-89a3-4a7b-9232-f4195e6e12b0","year":2022},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:ad268d7cfeda937b4fad65aa58176c6571749d9fd0ed306621e92207f1d6d4b7","observation_id":"caecc784-c5e6-4c9f-8a83-2ab472bbb079","resolution":{"observed_at":"2026-05-24T05:38:56.721797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sparse tempo- ral spanners with low stretch","venue":null,"work_id":"492db426-705f-4c88-a079-bfa50f75f13d","year":2022},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:6884139604005cd7bd4241f154fb40bc5eb0e294f794a0db2ab4a1737f9ef8c9","observation_id":"d0176aba-1f25-4596-b08c-8ae016376324","resolution":{"observed_at":"2026-05-24T05:38:56.726630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The complexity of d ata aggregation in static and dynamic wireless sensor networks","venue":null,"work_id":"c68babdc-1322-4142-960a-999930a35872","year":2015},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:2d3c6a1d9161e638e8aec3bef822199fa359309f7aece8a76d194494a6fa550d","observation_id":"6e798684-21d8-41b1-8ee8-32c6bd4fc7d7","resolution":{"observed_at":"2026-05-24T05:38:56.719595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A dynamic data structure for temporal reachability with unsorted contact insertions","venue":null,"work_id":"6f480d69-b26d-4950-850e-41e47a3f8946","year":2022},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:818a069fa89bfedb1f7942861c58b9ecbae43f88a93efb7d5dec5a540ec181a4","observation_id":"0fea201f-23c0-4b41-b319-728ba732aaed","resolution":{"observed_at":"2026-05-24T05:38:56.716951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2020.106086","doi":"10.1016/j.ipl.2020.106086","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On computing pareto opti- mal paths in weighted time-dependent networks","venue":"Information Processing Letters","work_id":"a62f4160-67a9-4ad1-8ed9-9cc0885108f5","year":2021},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:c694fc5425588b3157ee4307721d7cadacc3e5080ba3fe909ece05812a9207a0","observation_id":"e56d7a03-67f9-4834-acb3-1e1b041244f0","resolution":{"observed_at":"2026-05-24T05:38:55.594855Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Maximizing reachability in a temporal graph obtained by assigning starting times to a collection o f walks","venue":null,"work_id":"105e4b3a-3ce5-4398-8e36-c6cba3601fe4","year":2023},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:ede928efb337f297a6c4278e537f47c7b359b2e23fc6dea49733b1e831331ffe","observation_id":"41fb2925-4ab4-4361-bbd7-6517dcebf293","resolution":{"observed_at":"2026-05-24T05:38:56.709395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bui-Xuan, Afonso Ferreira, and Aubin Jarry","venue":null,"work_id":"141ee341-48b7-4f05-8a1c-0aad5b9896ca","year":2003},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:b63fb7d0e766dab04c4fe3a7ac374e90420f79bf9c840288f97366390ed24144","observation_id":"f8630012-b810-4637-b178-97ae9b49acaa","resolution":{"observed_at":"2026-05-24T05:38:56.714517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Simple, strict, proper, happy: A study of reachability in temporal graphs","venue":null,"work_id":"60e3e3d3-99fe-4cd6-9e14-c2a027c55043","year":2022},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:e94c5ae551d32655ef14cf595643179b6bf6dd448946b1524f35a3c8af0d5470","observation_id":"1fa82707-8f72-4e42-998e-9993ccb01417","resolution":{"observed_at":"2026-05-24T05:38:56.741762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Time-varying graphs and dynamic networks","venue":null,"work_id":"52972d64-1a3a-4726-af90-03c53502e698","year":2012},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:a6e91b64199326fbb59eca50c4b86202f1492d9f66e4e1b90b684baaed185c9c","observation_id":"99853137-1316-4ac6-8bd9-26aa8930fc3a","resolution":{"observed_at":"2026-05-24T05:38:56.694648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Finding temporal paths under waiting time constraints","venue":null,"work_id":"ad9a33a3-62e6-4583-a63f-00956e16e707","year":2021},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:f2f682b765a1698a0f6df3deb187e235effb8e968134ff46218b3cb7557fcdc1","observation_id":"df571f68-98d6-4985-a36c-a9bffa2495fc","resolution":{"observed_at":"2026-05-24T05:38:56.696777Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Peters, and Jason Schoeters","venue":null,"work_id":"e338b287-f6db-4dcf-b0ee-2e80925cef6b","year":2019},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:08e32c7a7a6a717553ac1a01afac99006908727997b581e203b3428fbc9d9479","observation_id":"28d01970-b17b-446e-a853-a040407ede4a","resolution":{"observed_at":"2026-05-24T05:38:56.744575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Sharp thresholds in random simple temporal graphs","venue":null,"work_id":"8a1956f3-13ec-4930-834e-36b1816eb2a6","year":2021},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:5234916b0a0b18b9c44197a9d526f427b1994a0b6f0ca18b78e4c6a51a0b311a","observation_id":"b1fc7ddf-786a-496c-a46b-fb9a1eb02973","resolution":{"observed_at":"2026-05-24T05:38:56.692172Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Enumeration of sd separators in dags with application to reliability analysis in temporal g raphs","venue":null,"work_id":"e19579fc-8d07-47b3-87c8-93f275d1bc12","year":2020},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:1dc130678e42550642c195c87d09ec9663224a4ed2f19360b3db704c18cf23a2","observation_id":"a9324b9c-89ef-43c1-ac8d-c5513ee8b4d0","resolution":{"observed_at":"2026-05-24T05:38:56.699287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Distributed exploration of dynamic rings","venue":null,"work_id":"d8bc49bb-19ca-4a23-850a-5f29e1e593c5","year":2020},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:73c90122a2f3c040628d521a31f2de9a74e8f6cbe45c1fc82032a70db2a97697","observation_id":"dc54b188-153d-420c-87e7-0e1c937c4e29","resolution":{"observed_at":"2026-05-24T05:38:56.701430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Deleting edges to restrict the size of an epidemic in temporal networks","venue":null,"work_id":"dc646a3c-1867-44cc-9f94-aea0d856ab1c","year":2019},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:fda1be4056c9c7b45b2f0e9aa00fb727ec9f04f952945b8178686334c16c92ae","observation_id":"9f1c9e68-9fa5-4e06-a880-82521389a5a4","resolution":{"observed_at":"2026-05-24T05:38:56.686957Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.12055","last_updated":"2023-02-21T23:24:22Z","snapshot_observed_at":"2026-08-16T17:18:57.618472Z","submitted_at":"2022-02-24T12:22:12Z","title":"Counting Temporal Paths","version":2},"cited_work":{"arxiv_id":"2202.12055","doi":"10.48550/arxiv.2202.12055","metadata_source":"arxiv_reference","pith_arxiv_id":"2202.12055","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Count ing temporal paths","venue":null,"work_id":"d7c44bb1-ffcb-42c3-a3cd-96cc5a5a93f5","year":2022},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"cited_paper":"/paper/2202.12055","citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:90ab3a1090580e3151debf1a39e534c78aa15f95963b086d5afbf32685d79dc2","observation_id":"07fc4e65-acc2-4ad1-8445-5e7b10a2f44f","resolution":{"observed_at":"2026-05-24T05:38:56.019811Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Parameterized temp oral exploration problems","venue":null,"work_id":"47925bee-3c88-41c4-a873-c37e55506f37","year":2022},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:9158cd4d439ffe5bdac7e31cb9f23b3572be054b5e962dca24aa347735c76491","observation_id":"760a6f5a-ec44-4faf-9172-9c28105aea9d","resolution":{"observed_at":"2026-05-24T05:38:56.712007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On th e exploration of time-varying networks","venue":null,"work_id":"cdb51700-308e-453e-8b8d-7b05c89e2fc7","year":2013},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:07f81e3f9cd0c6fe5a1beb565a70ba30f478414426f28fcc4973d74bb670c128","observation_id":"312324b0-a515-4eb2-aa7b-0a405b41df51","resolution":{"observed_at":"2026-05-24T05:38:56.682004Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Temporal graph classes: A view through temporal separators","venue":null,"work_id":"609839eb-fb49-45ca-b59f-b1af9660cd69","year":2020},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:11a4176e488d1b92059995e331637b4c0212597cdab24cade59674693baf32ab","observation_id":"a2efdfcc-b841-49ee-b19a-71f36ee6a03e","resolution":{"observed_at":"2026-05-24T05:38:56.684659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A connectivity model for agreement in dynamic systems","venue":null,"work_id":"2bb06121-fed4-45f9-b47c-5b00f9ec5d4c","year":2015},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:b7e4e2ebb32c9c5ea26fade0b0b38779dba25bda639990097003f4170268c374","observation_id":"ce0819eb-7c94-4718-a8da-85416733b6ce","resolution":{"observed_at":"2026-05-24T05:38:56.677058Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Exploration of constantly connected dynamic graphs based on cactuses","venue":null,"work_id":"8f72c1a7-704f-4d46-a484-fb6f5ffecbd5","year":2014},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:c15d908dc269d8baf6ce24818f359f1c13c654e46dd64d13488df17f31c32321","observation_id":"53890fce-b7dd-4788-987e-3f298887d322","resolution":{"observed_at":"2026-05-24T05:38:56.706588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Kempe, J","venue":null,"work_id":"6b5c79cc-2608-42ad-9ea9-a745afe4b6f0","year":2000},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:b7c7105d1a50a6266b2eb6c44f5a83eef78bef564b5c7a07509466cdf479ae68","observation_id":"3864351b-2840-4832-b09c-7a6b8a30c399","resolution":{"observed_at":"2026-05-24T05:38:56.704036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Stro ngly connected components in stream graphs: Computation and experimentations","venue":null,"work_id":"b5c1fcf3-e9e7-4712-bfd1-b356a0544ef6","year":2020},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:5cd5bb9ac0494707663c8963ffd02fdcfede49872ac7a4a454adec63ec7059bf","observation_id":"a94b6ead-c666-4a1c-b0e4-24ae23a6c071","resolution":{"observed_at":"2026-05-24T05:38:56.674862Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graph s","venue":null,"work_id":"43fc6974-c3cc-4f32-8081-d7db237599df","year":2021},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:4461ddcda0921c2adedae00e5e3654dcd4b130a602081e530351a2646ae4a833","observation_id":"3651c811-7a32-4921-9957-76eb32d0aead","resolution":{"observed_at":"2026-05-24T05:38:56.679632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Temporal reach- ability graphs","venue":null,"work_id":"0fb34126-84c8-4914-bb3f-cbed6204b9fe","year":2012},"citing_paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-24T05:36:31.843747Z"},"links":{"citing_paper":"/paper/2312.06260"},"observation_digest":"sha256:a735d915f1c0ab180661247de7a564ade56c2d1505a3580b0ccbcd5d0f1c8bf2","observation_id":"156cad6d-16e4-48b6-a3fd-0b3567fdc7b8","resolution":{"observed_at":"2026-05-24T05:38:56.689871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2312.06260","last_updated":"2026-04-20T14:22:05Z","latest_version":2,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-14T16:43:35.626328Z","submitted_at":"2023-12-11T09:57:11Z","title":"In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":2,"verified_fuzzy":29},"total_outbound_references":31},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 2 inbound Pith citation observations for arXiv:2312.06260."}