{"as_of":"2026-08-16T09:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fd87366fff0a35b4948c92486d54b3ed4395cc21e520baa39e386ff9a085c0a3","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:16:28.266930Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.11704/citation-record","integrity":"/paper/2506.11704/integrity","json":"/paper/2506.11704/citation-record.json","paper":"/paper/2506.11704"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:16:26.518975Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.11704","last_updated":"2025-06-16T13:44:16Z","snapshot_observed_at":"2026-08-12T19:38:54.504773Z","submitted_at":"2025-06-13T12:19:18Z","title":"Isometric-Universal Graphs for Trees","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:26.518975Z"},"links":{"citing_paper":"/paper/2506.11704"},"observation_digest":"sha256:3ed51b69640ba26e3c4d9945f6063298275acfc538801b793e2148effb73e88a","observation_id":"71a81755-dbcc-4d35-be9e-ab1bc3a98118","resolution":{"observed_at":"2026-08-07T04:16:26.518975Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:16:26.589775Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.11704","last_updated":"2025-06-16T13:44:16Z","snapshot_observed_at":"2026-08-12T19:38:54.504773Z","submitted_at":"2025-06-13T12:19:18Z","title":"Isometric-Universal Graphs for Trees","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:26.589775Z"},"links":{"citing_paper":"/paper/2506.11704"},"observation_digest":"sha256:76f3585dc3d7e51beb044411e5cbab6f90332c55047ddf03b235a075f26deec3","observation_id":"f39460fd-c99b-4dd4-ae8e-59897b1f4577","resolution":{"observed_at":"2026-08-07T04:16:26.589775Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:16:26.716490Z","title":"Bollob \\'a s, D","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2506.11704","last_updated":"2025-06-16T13:44:16Z","snapshot_observed_at":"2026-08-12T19:38:54.504773Z","submitted_at":"2025-06-13T12:19:18Z","title":"Isometric-Universal Graphs for Trees","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:26.716490Z"},"links":{"citing_paper":"/paper/2506.11704"},"observation_digest":"sha256:a16a4a521ed628bd0e57779f49f6f065d025ac429cf8498c90197a656b23d444","observation_id":"7d3d6130-6c84-49bd-af6a-9509919458e8","resolution":{"observed_at":"2026-08-07T04:16:26.716490Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.01678","last_updated":"2024-09-03T07:42:58Z","snapshot_observed_at":"2026-08-13T17:04:50.997668Z","submitted_at":"2024-09-03T07:42:58Z","title":"Subgraph-universal planar graphs for trees","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.01678","snapshot_observed_at":"2026-08-07T04:16:26.818908Z","title":"Bergold, V","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.11704","last_updated":"2025-06-16T13:44:16Z","snapshot_observed_at":"2026-08-12T19:38:54.504773Z","submitted_at":"2025-06-13T12:19:18Z","title":"Isometric-Universal Graphs for Trees","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:26.818908Z"},"links":{"cited_paper":"/paper/2409.01678","citing_paper":"/paper/2506.11704"},"observation_digest":"sha256:00e2840beebb92cfc5486594aaa12d2743f0723035e924b9cda38d4ee8bf4e7e","observation_id":"cb3596c0-0fe7-48fe-8044-d018a050402e","resolution":{"observed_at":"2026-08-07T04:16:26.818908Z","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":"10.1007/pl00021410","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":"Bunke, X","venue":"Computing","work_id":"8bfde027-09c4-4863-99de-f727e2437cb9","year":2000},"citing_paper":{"arxiv_id":"2506.11704","last_updated":"2025-06-16T13:44:16Z","snapshot_observed_at":"2026-08-12T19:38:54.504773Z","submitted_at":"2025-06-13T12:19:18Z","title":"Isometric-Universal Graphs for Trees","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:26.953243Z"},"links":{"citing_paper":"/paper/2506.11704"},"observation_digest":"sha256:11f62190ce6da28417424d660e793e72711654e4c9c5aed74f789c8901367fa7","observation_id":"d0af8f32-e7b7-4a6c-b66e-56bc31849114","resolution":{"observed_at":"2026-08-07T04:16:28.413656Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-36379-3_3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:03:56.115653Z","title":"Bodini , On the minimum size of a contraction-universal tree , in 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), vol","venue":"Lecture notes in computer science","work_id":"18a22e85-a6c8-4dd1-bc96-3a70337ab325","year":2002},"citing_paper":{"arxiv_id":"2506.11704","last_updated":"2025-06-16T13:44:16Z","snapshot_observed_at":"2026-08-12T19:38:54.504773Z","submitted_at":"2025-06-13T12:19:18Z","title":"Isometric-Universal Graphs for Trees","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:27.056706Z"},"links":{"citing_paper":"/paper/2506.11704"},"observation_digest":"sha256:16a7fafb128eb7ca629f6523d6af6e0d6702c903ae14683f25b7d7158a10f803","observation_id":"345416cc-4f24-4294-94a3-01c571ac93da","resolution":{"observed_at":"2026-08-07T04:16:28.403354Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:16:27.201170Z","title":"Bodwin , New results on linear size distance preservers , SIAM Journal on Computing, 50 (2021), pp","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.11704","last_updated":"2025-06-16T13:44:16Z","snapshot_observed_at":"2026-08-12T19:38:54.504773Z","submitted_at":"2025-06-13T12:19:18Z","title":"Isometric-Universal Graphs for Trees","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:27.201170Z"},"links":{"citing_paper":"/paper/2506.11704"},"observation_digest":"sha256:f61865c090978004c81624067e0b580c35763d742b7fe8693d0276e53b80d268","observation_id":"7df434dc-373d-41be-8e63-06409a010284","resolution":{"observed_at":"2026-08-07T04:16:27.201170Z","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":"10.1137/s0895480104445319","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Coppersmith and M","venue":"SIAM Journal on Discrete Mathematics","work_id":"166bf75d-afd0-4c1d-833b-64bf703e24ee","year":2006},"citing_paper":{"arxiv_id":"2506.11704","last_updated":"2025-06-16T13:44:16Z","snapshot_observed_at":"2026-08-12T19:38:54.504773Z","submitted_at":"2025-06-13T12:19:18Z","title":"Isometric-Universal Graphs for Trees","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:27.286705Z"},"links":{"citing_paper":"/paper/2506.11704"},"observation_digest":"sha256:6344b5e7ebce217ee1700fb38084e7b176f89ba0b6050b31bdedbb0f6b89c13e","observation_id":"9c6b8b60-3593-4aff-888b-5ac4d8b5e760","resolution":{"observed_at":"2026-08-07T04:16:28.385944Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0095-8956(81)90037-x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Journal of Combinatorial Theory Series B","work_id":"7ea4d674-8b15-4abd-a7fe-7841217ccd92","year":1981},"citing_paper":{"arxiv_id":"2506.11704","last_updated":"2025-06-16T13:44:16Z","snapshot_observed_at":"2026-08-12T19:38:54.504773Z","submitted_at":"2025-06-13T12:19:18Z","title":"Isometric-Universal Graphs for Trees","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:27.437271Z"},"links":{"citing_paper":"/paper/2506.11704"},"observation_digest":"sha256:117064d327081a3fab8f8ff3fdbffa1870e71667113772351a65ae2dbad2bbd9","observation_id":"b7462727-0521-42ac-bbb0-61ef1cb008ea","resolution":{"observed_at":"2026-08-07T04:16:28.376170Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:16:27.546753Z","title":"Dujmovi \\'c , L","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.11704","last_updated":"2025-06-16T13:44:16Z","snapshot_observed_at":"2026-08-12T19:38:54.504773Z","submitted_at":"2025-06-13T12:19:18Z","title":"Isometric-Universal Graphs for Trees","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:27.546753Z"},"links":{"citing_paper":"/paper/2506.11704"},"observation_digest":"sha256:cd53e2d48a1e3ed7a8c9d295be64fe8886118188777e59fcd6cd4ff34c02085c","observation_id":"7cc2571f-005a-484f-8286-bcd9f18fc847","resolution":{"observed_at":"2026-08-07T04:16:27.546753Z","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":"10.1137/21m1406155","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Esperet, C","venue":"SIAM Journal on Discrete Mathematics","work_id":"0127d444-0bed-473c-a678-c52a1b31ba98","year":2021},"citing_paper":{"arxiv_id":"2506.11704","last_updated":"2025-06-16T13:44:16Z","snapshot_observed_at":"2026-08-12T19:38:54.504773Z","submitted_at":"2025-06-13T12:19:18Z","title":"Isometric-Universal Graphs for Trees","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:27.707729Z"},"links":{"citing_paper":"/paper/2506.11704"},"observation_digest":"sha256:74791cfc6fa9b0463f337ab73cc67e2c0ae52ac3c3be37004199bd45d0274b54","observation_id":"d7d0824f-3edc-4fa0-aa18-2e1960d8e8ac","resolution":{"observed_at":"2026-08-07T04:16:28.358663Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:16:27.869284Z","title":"Esperet, G","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.11704","last_updated":"2025-06-16T13:44:16Z","snapshot_observed_at":"2026-08-12T19:38:54.504773Z","submitted_at":"2025-06-13T12:19:18Z","title":"Isometric-Universal Graphs for Trees","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:27.869284Z"},"links":{"citing_paper":"/paper/2506.11704"},"observation_digest":"sha256:33b1d258acf9dc0e7a32dbdad1d610201a5adcb6fcc39964c8a3c9919c610543","observation_id":"01f3ce38-fce4-43c0-a021-d2f8e1a34bdc","resolution":{"observed_at":"2026-08-07T04:16:27.869284Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:16:27.997392Z","title":null,"venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2506.11704","last_updated":"2025-06-16T13:44:16Z","snapshot_observed_at":"2026-08-12T19:38:54.504773Z","submitted_at":"2025-06-13T12:19:18Z","title":"Isometric-Universal Graphs for Trees","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:27.997392Z"},"links":{"citing_paper":"/paper/2506.11704"},"observation_digest":"sha256:ae94a000f49383226534d8f7a3ce8e209dc05ae6dcf020ecd7c70272fcef6587","observation_id":"9f133c95-698e-4c11-894f-d43333fadf3e","resolution":{"observed_at":"2026-08-07T04:16:27.997392Z","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-07T04:16:28.462104Z","title":"Gavoille and A","venue":null,"work_id":"5b6bfb8a-7fa3-4854-9a71-564c0208672a","year":2024},"citing_paper":{"arxiv_id":"2506.11704","last_updated":"2025-06-16T13:44:16Z","snapshot_observed_at":"2026-08-12T19:38:54.504773Z","submitted_at":"2025-06-13T12:19:18Z","title":"Isometric-Universal Graphs for Trees","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:28.106156Z"},"links":{"citing_paper":"/paper/2506.11704"},"observation_digest":"sha256:04e45c5aecbff5cb631e5a6e61d929d20b74b9f518ad4d9c5f2487a616476c89","observation_id":"a7fdf59d-513c-4502-8341-c208cd3413c7","resolution":{"observed_at":"2026-08-07T04:16:28.465355Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611975031.166","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Gawrychowski, F","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"d85eb671-4088-4a06-8c96-11ca64e4fbaf","year":2018},"citing_paper":{"arxiv_id":"2506.11704","last_updated":"2025-06-16T13:44:16Z","snapshot_observed_at":"2026-08-12T19:38:54.504773Z","submitted_at":"2025-06-13T12:19:18Z","title":"Isometric-Universal Graphs for Trees","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:28.185831Z"},"links":{"citing_paper":"/paper/2506.11704"},"observation_digest":"sha256:d58c77194a578a72340420277982e6b28de6e835ad6cb6eb14afb598dc084d7e","observation_id":"538ce3c7-014d-4a64-8d40-48116679cb3f","resolution":{"observed_at":"2026-08-07T04:16:28.339519Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/pl00009212","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":"Gupta and N","venue":"Algorithmica","work_id":"2f8c58a0-1a2d-4ae8-9ec0-d86123762978","year":1998},"citing_paper":{"arxiv_id":"2506.11704","last_updated":"2025-06-16T13:44:16Z","snapshot_observed_at":"2026-08-12T19:38:54.504773Z","submitted_at":"2025-06-13T12:19:18Z","title":"Isometric-Universal Graphs for Trees","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:28.251880Z"},"links":{"citing_paper":"/paper/2506.11704"},"observation_digest":"sha256:04a399c73db17fcb73e958dacb1c886f8b30ad6d5ac27724e8c3a15bc913cd7b","observation_id":"8c4b9674-fdde-4b55-9786-866ade4d70d4","resolution":{"observed_at":"2026-08-07T04:16:28.328157Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/focs.2012.9","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Ramshaw and R","venue":null,"work_id":"85945553-5343-41ad-8e3b-8fd3eb793200","year":2012},"citing_paper":{"arxiv_id":"2506.11704","last_updated":"2025-06-16T13:44:16Z","snapshot_observed_at":"2026-08-12T19:38:54.504773Z","submitted_at":"2025-06-13T12:19:18Z","title":"Isometric-Universal Graphs for Trees","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:28.255399Z"},"links":{"citing_paper":"/paper/2506.11704"},"observation_digest":"sha256:9d00c58877067aa5b003170198b67550638f5e526e852e80f87fa1083b31adcc","observation_id":"03675cb8-e016-4e95-9379-9874a47ca6ac","resolution":{"observed_at":"2026-08-07T04:16:28.318524Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.14492","last_updated":"2024-03-21T15:39:05Z","snapshot_observed_at":"2026-08-13T00:48:35.024394Z","submitted_at":"2024-03-21T15:39:05Z","title":"Induced Subforests and Superforests","version":1},"cited_work":{"arxiv_id":"2403.14492","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.14492","snapshot_observed_at":"2026-08-07T04:16:28.453060Z","title":"Induced Subforests and Superforests","venue":"cs.DS","work_id":"0d7e8c8a-03ad-4418-bc18-04448140623c","year":2024},"citing_paper":{"arxiv_id":"2506.11704","last_updated":"2025-06-16T13:44:16Z","snapshot_observed_at":"2026-08-12T19:38:54.504773Z","submitted_at":"2025-06-13T12:19:18Z","title":"Isometric-Universal Graphs for Trees","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:28.259592Z"},"links":{"cited_paper":"/paper/2403.14492","citing_paper":"/paper/2506.11704"},"observation_digest":"sha256:e7122f8f209588df0b438d7e02abf80bd91bdc9deb876c44862def79d626e0a1","observation_id":"e64bbfaa-025e-4d85-bd3c-989993ce311f","resolution":{"observed_at":"2026-08-07T04:16:28.456414Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-07T04:16:28.263492Z","title":"Thorup , Integer priority queues with decrease key in constant time and the single source shortest paths problem , Journal of Computer and System Sciences, 69 (2004), pp","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2506.11704","last_updated":"2025-06-16T13:44:16Z","snapshot_observed_at":"2026-08-12T19:38:54.504773Z","submitted_at":"2025-06-13T12:19:18Z","title":"Isometric-Universal Graphs for Trees","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:28.263492Z"},"links":{"citing_paper":"/paper/2506.11704"},"observation_digest":"sha256:5f8d9ae6714b01877033ac0898645178097309e6a6374aa142f9b68bcfa12e64","observation_id":"b2863b80-1f90-468e-82dd-7d27a1be3399","resolution":{"observed_at":"2026-08-07T04:16:28.263492Z","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":"10.1007/bf02579350","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":"Winkler , Proof of the squashed cube conjecture , Combinatorica, 3 (1983), pp","venue":"COMBINATORICA","work_id":"423fff42-2952-4600-9461-4962e8384ec8","year":1983},"citing_paper":{"arxiv_id":"2506.11704","last_updated":"2025-06-16T13:44:16Z","snapshot_observed_at":"2026-08-12T19:38:54.504773Z","submitted_at":"2025-06-13T12:19:18Z","title":"Isometric-Universal Graphs for Trees","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:28.266930Z"},"links":{"citing_paper":"/paper/2506.11704"},"observation_digest":"sha256:3e2381ce437c280cb234c338b0cfacabfa7fc7479e848f412921f277424f73bc","observation_id":"35be061e-ada4-4e18-998b-69556a333cc9","resolution":{"observed_at":"2026-08-07T04:16:28.300712Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.11704","last_updated":"2025-06-16T13:44:16Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T19:38:54.504773Z","submitted_at":"2025-06-13T12:19:18Z","title":"Isometric-Universal Graphs for Trees"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":10,"verified_fuzzy":1},"total_outbound_references":20},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2506.11704."}