{"as_of":"2026-08-13T14:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:886e103ae40845052ef66d5bb288f4ece8e6f89ed997559f6d18f62fbc719346","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T09:45:41.270810Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2510.23614/citation-record","integrity":"/paper/2510.23614/integrity","json":"/paper/2510.23614/citation-record.json","paper":"/paper/2510.23614"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T09:45:35.859847Z","title":"Akrami, R","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:35.859847Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:a9462aa2d28256fdf452ef484d4ab4c2a952b0bb7f1b8f0049e87a35a4991768","observation_id":"e4facaa1-acf6-47f0-85ff-a40f684fa5fb","resolution":{"observed_at":"2026-08-04T09:45:35.859847Z","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-04T09:45:35.944815Z","title":"Alrabiah, Z","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:35.944815Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:b6ae3e756f2bb4af579eedc4317597018a5ad5dc02b04f4b38f69ff3e48c61ea","observation_id":"5b441eb3-7ae9-4ca9-9f40-1bf98e923f30","resolution":{"observed_at":"2026-08-04T09:45:35.944815Z","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-04T09:45:36.097395Z","title":"Ba ¨ ıou and F","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:36.097395Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:5c4a5c921faf067b440d0c1470dde10488db29d452636cb1016d49a2a97855f6","observation_id":"7ad3a432-134e-47c8-aadd-4aee3ddea304","resolution":{"observed_at":"2026-08-04T09:45:36.097395Z","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-04T09:45:36.178430Z","title":"Baron and W","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:36.178430Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:6ea3fbe1aa26610d356912986cd8b79920bceb9bf05fb9677f0972ff005bf58d","observation_id":"c28447fd-2978-4877-8c41-f4eb040dc351","resolution":{"observed_at":"2026-08-04T09:45:36.178430Z","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-04T09:45:36.274288Z","title":"Bruno and L","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:36.274288Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:1e375c1e0845c3d45b95144a8fcd3b6a2797d1728edf67a06c2b858f4c884ee2","observation_id":"2b1f41fa-d560-4815-a487-95088b68a65b","resolution":{"observed_at":"2026-08-04T09:45:36.274288Z","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-04T09:45:36.339725Z","title":"Connelly, T","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:36.339725Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:4bd69308135e3067a87843c3e31b7c8c2d15450e343e0052ef61fc6c1d158a7a","observation_id":"0c4ec123-f793-4dd2-8fa4-418628f45dfc","resolution":{"observed_at":"2026-08-04T09:45:36.339725Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.11636","last_updated":"2025-07-29T19:01:55Z","snapshot_observed_at":"2026-08-13T02:02:03.168966Z","submitted_at":"2025-07-29T19:01:55Z","title":"Rigidity of Graphs and Frameworks: A Matroid Theoretic Approach","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.11636","snapshot_observed_at":"2026-08-04T09:45:36.478625Z","title":"Cruickshank, B","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:36.478625Z"},"links":{"cited_paper":"/paper/2508.11636","citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:15075d6d621d91af7b40245a6102872c1816dae64d0cf9f1dd3395df932af297","observation_id":"3f297022-a336-4bf5-8069-322ad8f831ef","resolution":{"observed_at":"2026-08-04T09:45:36.478625Z","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-04T09:45:36.620595Z","title":"Edmonds,Minimum partition of a matroid into independent sets,J","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:36.620595Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:cd48973b9a9141f9edf478b500e4ead1e25c8bcae658607b6398db5dedfbb688","observation_id":"b072ffc2-5895-4753-8c1d-9b27f1e63a1f","resolution":{"observed_at":"2026-08-04T09:45:36.620595Z","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-04T09:45:36.787672Z","title":"Edmonds,Lehman ’s switching game and a theorem of Tutte and Nash-Williams,J","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:36.787672Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:0dc45ebda9e0204fab39dff4c62a9e8483bdb4acd50629231fed03b30b885256","observation_id":"56c6493d-a250-401e-a495-bb7865dad152","resolution":{"observed_at":"2026-08-04T09:45:36.787672Z","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-04T09:45:36.868592Z","title":"Edmonds,Matroid Partition, Mathematics of the Decision Sciences, Part I","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:36.868592Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:a62d939dd5bb3d79cd3f2cc8b4b8d381d54191548890e113300cfc0a5fecbb10","observation_id":"edb9161a-f1e4-4529-b250-81fcdbd22d75","resolution":{"observed_at":"2026-08-04T09:45:36.868592Z","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-04T09:45:36.985117Z","title":"Edmonds,Matroids and the greedy algorithm, Math","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:36.985117Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:332bf68a200cea0c16370054a24b28f64301829dbd9c1e97ba2f1f06e9ecfb49","observation_id":"726b6971-f0ca-4cd7-bb7c-2566d39251e2","resolution":{"observed_at":"2026-08-04T09:45:36.985117Z","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-04T09:45:37.054104Z","title":"Edmonds,Edge-disjoint branchings,in: Combinatorial Algorithms (B","venue":null,"work_id":null,"year":1973},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:37.054104Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:8953dfc4bd2989b7cdbfeeedf28841593d6e2b591c5f530167601bddec14de87","observation_id":"7942bb5e-7dc4-4dbc-b977-de669d75fc54","resolution":{"observed_at":"2026-08-04T09:45:37.054104Z","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-04T09:45:37.147729Z","title":"Edmonds,Matroid intersection, Annals of Discrete Math","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:37.147729Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:7c13b0ee21cb8b87ea0ce2edf9d9786c55cee1d60949fba8591348c90e959965","observation_id":"1e06883c-af44-4fe5-a61c-0b49ac25cf1c","resolution":{"observed_at":"2026-08-04T09:45:37.147729Z","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-04T09:45:37.251079Z","title":"Edmonds and D.R","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:37.251079Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:ccae38f7f28fb30a3aea5e634731c1d59ad29db592f50b6efc0e2e876530ca26","observation_id":"3783065c-293d-4613-b16b-fd7af7614494","resolution":{"observed_at":"2026-08-04T09:45:37.251079Z","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-04T09:45:37.375159Z","title":"Frank, Connections in Combinatorial Optimization, Oxford University Press, 2011 (ISBN 978-0-19-920527-1)","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:37.375159Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:0a0877b214f6e89be8775b3cfbac66b04d367f0863bc163c707dd347e5ae7263","observation_id":"e2ecac31-4081-42b4-8ed0-4eaab0a5e731","resolution":{"observed_at":"2026-08-04T09:45:37.375159Z","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-04T09:45:37.493670Z","title":"Combinatorial Theory, Ser","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:37.493670Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:01fa66b8bd19093b7e0b975ff6779d1643a3e203dab9760c61fb52578a0bdb94","observation_id":"6d237da7-b29b-4f7f-b684-3e1da108e6ad","resolution":{"observed_at":"2026-08-04T09:45:37.493670Z","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-04T09:45:37.628903Z","title":"Frank,On disjoint trees and arborescences,in: Algebraic Methods in Graph Theory, Colloquia Mathematica Soc","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:37.628903Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:1b9461209e3d280df6a55347f80df6b687d24b640c45922009a2037621307181","observation_id":"fe50a4e3-46aa-402e-98ff-9d7343fd7185","resolution":{"observed_at":"2026-08-04T09:45:37.628903Z","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-04T09:45:37.733968Z","title":"Frank, T","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:37.733968Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:3e5ebb68cb0a640b3c8aa90e40ff75de6007517a4d8a518c3b021df7f91f0fda","observation_id":"bcb79719-54c0-485c-994e-e00cc52c6e6f","resolution":{"observed_at":"2026-08-04T09:45:37.733968Z","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-04T09:45:37.855923Z","title":"Frank, T","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:37.855923Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:f4a9d3b013f81c0ef1cb98f3c41666749fbb6ed4ebf02af75a5a19297a1ad366","observation_id":"0a9243f2-06d6-4e00-9ad2-490ecf5e441a","resolution":{"observed_at":"2026-08-04T09:45:37.855923Z","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-04T09:45:38.022003Z","title":"Frank and L","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:38.022003Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:eefac802dc69574b7e48842cdbaa441d9bb32d097d52454dae3b0f1aced6e630","observation_id":"2bef0740-e1e6-4801-83c0-798c0836754d","resolution":{"observed_at":"2026-08-04T09:45:38.022003Z","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-04T09:45:38.163254Z","title":"Gale,Topological games at Princeton, a mathematical memoir, Games and Economic Behavior, 66(2) (2009 Jul 1) 647-56","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:38.163254Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:db1933ead8e0fb31d9363ca4847d6d1ff91a2cb3ec610586b2f84edf15a71fa8","observation_id":"e3a53a5c-d20f-49ac-9985-a10ff97f0b82","resolution":{"observed_at":"2026-08-04T09:45:38.163254Z","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-04T09:45:38.268340Z","title":"Gardner, The Second Scientific American Book of Mathematical Puzzles and Di- versions, The University of Chicago Press, (1961)","venue":null,"work_id":null,"year":1961},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:38.268340Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:117c2b748165ec32c064ccb3dd1063a389460fa1111fff1df5363db5fd2fbdc5","observation_id":"f3414047-4b34-4caa-8144-f5cf9d0f417e","resolution":{"observed_at":"2026-08-04T09:45:38.268340Z","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-04T09:45:38.415755Z","title":"Garamv¨ olgyi, T","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:38.415755Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:7c5c6c49a53434775b1e0c3ffbf221496d41c40d1bbe29c10f6c066ad60f92cc","observation_id":"7b41765f-32ac-4437-8981-672cd761334d","resolution":{"observed_at":"2026-08-04T09:45:38.415755Z","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-04T09:45:38.510980Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:38.510980Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:d9f1327d6852ed05aaaa9da02135bb958c557c26a696e25d308ce26528fe5cf7","observation_id":"fc03cc6a-a37c-4f25-9a8e-02e62ec26488","resolution":{"observed_at":"2026-08-04T09:45:38.510980Z","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-04T09:45:38.647175Z","title":"Horn,A characterization of unions of linearly independent sets, J","venue":null,"work_id":null,"year":1955},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:38.647175Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:479781e1d3f5db7c15d70e0733e793f506c5b548b1727d2d27a573fc296aedc1","observation_id":"b5b3be8f-4b49-4c6d-9df3-66ea61ca3447","resolution":{"observed_at":"2026-08-04T09:45:38.647175Z","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-04T09:45:38.783804Z","title":"Jackson and T","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:38.783804Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:036bdb447ef87724efe507a0c44a45ed0cc5c42eaa522cbcee6ab9317430dfe7","observation_id":"333a7c23-ccb0-4ac4-b57b-8f8cd1e9f341","resolution":{"observed_at":"2026-08-04T09:45:38.783804Z","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-04T09:45:38.908263Z","title":"Jord´ an, Cs","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:38.908263Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:f25812e2075bf92178c3b13fb9c971889119a3158a7821c5222e13a79a8c6a6e","observation_id":"b5f27d8f-6f0a-47f8-9627-ea7423408a41","resolution":{"observed_at":"2026-08-04T09:45:38.908263Z","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-04T09:45:39.024768Z","title":"Karger,Minimum cuts in near-linear time, Journal of the ACM (JACM), 47(1) (2000 Jan 1) 46-76","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:39.024768Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:624f98cc5e395d71318fdb3b4b09da24d3427073776457603a18945c2c6293ed","observation_id":"b8160cbf-741c-4613-aa4f-22f3f0c7a6b1","resolution":{"observed_at":"2026-08-04T09:45:39.024768Z","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-04T09:45:39.203888Z","title":"Kishi and Y","venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:39.203888Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:648bb8f0789c6b34872bb403cfa3b6a3a018ed8ddac51f8bb5661678406becfc","observation_id":"5ba8b650-deaa-40ed-8756-76452e002441","resolution":{"observed_at":"2026-08-04T09:45:39.203888Z","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-04T09:45:39.287118Z","title":"Kov´ acs and L.A","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:39.287118Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:4c7fdc921e3f986c910d075c231562ad953f64942ae48959405f410897a01bec","observation_id":"bd2182af-132b-4d3c-9521-324588903540","resolution":{"observed_at":"2026-08-04T09:45:39.287118Z","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-04T09:45:39.347028Z","title":"Kron, Tensor Analysis of Networks, New York: J","venue":null,"work_id":null,"year":1939},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:39.347028Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:708e32b3bd8563a4ee4f1a96d32496ccc7eaaa5915bb1e1ab04729f73ac0b3ec","observation_id":"6ddb9744-811d-4f3f-b372-50a2c261bf04","resolution":{"observed_at":"2026-08-04T09:45:39.347028Z","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-04T09:45:39.384581Z","title":"Laman,On graphs and rigidity of plane skeletal structures, Journal of Engineering Mathematics, 4 (1970) 331-340","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:39.384581Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:f47226fd97804fc8dc10e507f468227c5070046a1b82e29b58dce7d890a13a8a","observation_id":"80c85221-1c81-446e-851c-0312d0c03b6c","resolution":{"observed_at":"2026-08-04T09:45:39.384581Z","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-04T09:45:39.464004Z","title":"Lee and I","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:39.464004Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:52adf3bb419822f71c564277d702aa268fbf0d4d155a9f9011dd5aaf4666817f","observation_id":"b3c6b83a-3254-4356-b163-ae5bf53f8bc6","resolution":{"observed_at":"2026-08-04T09:45:39.464004Z","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-04T09:45:39.529622Z","title":"Lehman,A solution to the Shannon switching game, J","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:39.529622Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:c5bc0de10aa56ee0e93efcd995048bd87f720d9653dd6d58c110db8e4393d98f","observation_id":"638523c4-e3f0-4925-9dfe-2fe4eb908516","resolution":{"observed_at":"2026-08-04T09:45:39.529622Z","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-04T09:45:39.571883Z","title":"Lorea,Hypergraphes et matroides, Cahiers Centrel Etud","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:39.571883Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:ebe46af5b97cbe55441c3424d7f70668aeed36568627ecf3c36e90d1ca7025b3","observation_id":"29688f67-6d13-4a4b-9538-7d8ca02d3545","resolution":{"observed_at":"2026-08-04T09:45:39.571883Z","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-04T09:45:39.601566Z","title":"Lov´ asz, Combinatorial Problems and Exercises, North-Holland 1979","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:39.601566Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:3ac142558e3ad74c9e7fa5b22ff1032dbc3794d4921ea558cebf18d35a900d36","observation_id":"7b9184fa-42b6-40e6-aba3-ae003ed40c10","resolution":{"observed_at":"2026-08-04T09:45:39.601566Z","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-04T09:45:39.681018Z","title":"Lov´ asz,A generalization of K˝ onig’s theorem,Acta","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:39.681018Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:04b1a2190cfc75ba9df377e808537bc975dd769aedc78a30469f7117837bc6ad","observation_id":"3b61d5aa-0b02-413e-9056-aa81da6c9262","resolution":{"observed_at":"2026-08-04T09:45:39.681018Z","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-04T09:45:39.740909Z","title":"Lov´ asz,On two minimax theorems in graph theory,J","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:39.740909Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:7387ec86b6925658227d249496855337bdfb785c1ec74f16d8eef67f4b576540","observation_id":"10203e66-a269-4f13-8dc7-8a78c9b6f33d","resolution":{"observed_at":"2026-08-04T09:45:39.740909Z","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-04T09:45:39.850860Z","title":"Mader,Konstruktion allern-fach kantenzusammenh¨ angenden Digraphen, Europ","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:39.850860Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:7f430ecac67e1fdd775c8f6ebd8db83b323ce55f4527c205b7705ef849f21301","observation_id":"9499b6d5-b202-4ddb-83c1-7d1ab7cb568c","resolution":{"observed_at":"2026-08-04T09:45:39.850860Z","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-04T09:45:39.945467Z","title":"Mohar, R.J","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:39.945467Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:5722998cc864cab043d95f78f84ccd33d1aa486346ecaaa12641b466e8555867","observation_id":"293cc640-0566-418a-8d72-ed60cad518bd","resolution":{"observed_at":"2026-08-04T09:45:39.945467Z","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-04T09:45:40.064659Z","title":"Nash-Williams,On orientations, connectivity and odd vertex pairings in finite graphs, Canad","venue":null,"work_id":null,"year":1960},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:40.064659Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:253e763647983b87132aabac5457231d24802630c5d174824e3d790a2bfea81d","observation_id":"97312704-7084-4974-9113-cce642b1d805","resolution":{"observed_at":"2026-08-04T09:45:40.064659Z","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-04T09:45:40.212308Z","title":"Nash-Williams,Edge-disjoint spanning trees of finite graphs, The Journal of the London Mathematical Society, 36 (1961) 445-450","venue":null,"work_id":null,"year":1961},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:40.212308Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:fff186a4046b8c06d089e72e75a59fe55888a26926c38c761f147b20ac4f3b38","observation_id":"94d54db8-bfc7-4509-b560-b69916974c97","resolution":{"observed_at":"2026-08-04T09:45:40.212308Z","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-04T09:45:40.332643Z","title":"Nash-Williams,Decomposition of finite graphs into forests,J","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:40.332643Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:238ae389daddbaec9e483a0fa9ffb70eb0b17655c911a10fd8b589d3ffdeebd2","observation_id":"853f0731-0680-416c-85a2-491551cd1ef1","resolution":{"observed_at":"2026-08-04T09:45:40.332643Z","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-04T09:45:40.445974Z","title":"Rado,A combinatorial theorem on vector spaces, The Journal of the London Math- ematical Society 37 (1962) 351-353","venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:40.445974Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:99d48cbecc9960ddfa7c97febfe5fed2b8a1bf2257509580e339a9392ac44150","observation_id":"9135cc26-c584-4cff-9d54-8d6c3fcfddfb","resolution":{"observed_at":"2026-08-04T09:45:40.445974Z","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-04T09:45:40.545015Z","title":"Recski, Matroid Theory and its Applications in Electric Network Theory and in Statics, Springer, Berlin, 1989","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:40.545015Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:910fa3e4f2decb76d072f5d8b490c48e4a814a16d83f4d4b25221329365b47cd","observation_id":"5d744cc0-e04b-4029-97de-e72c0f2046a6","resolution":{"observed_at":"2026-08-04T09:45:40.545015Z","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-04T09:45:40.642571Z","title":"Schrijver, Combinatorial Optimization: Polyhedra and Efficiency, Springer, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:40.642571Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:60b93ed72fe7beff12a40ab636a2cd34956b5717c8f4b11d3b4462d07f83a158","observation_id":"ce279999-ccba-4313-b074-7df1fa50b691","resolution":{"observed_at":"2026-08-04T09:45:40.642571Z","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-04T09:45:40.763102Z","title":"Tay,Rigidity of multi-graphs","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:40.763102Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:852f6f47ade005face605df8d2d8a1aa7687c316c42dfae5e8d760b6f9486c32","observation_id":"c928c4d7-e70e-4a9e-acac-94f1997a41cf","resolution":{"observed_at":"2026-08-04T09:45:40.763102Z","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-04T09:45:40.876843Z","title":"Thomassen,Configurations in graphs of large minimum degree, connectivity, or chromatic number, Annals of the New York Academy of Sciences","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:40.876843Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:6afe0b46ccb796bb64cc07ba461dca466c75815b892b0051d51f6c69b0a48982","observation_id":"3143371e-97fd-4b08-bc87-be7a6927d6ed","resolution":{"observed_at":"2026-08-04T09:45:40.876843Z","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-04T09:45:41.015680Z","title":"Tutte,On the problem of decomposing a graph intonconnected factors, J","venue":null,"work_id":null,"year":1961},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:41.015680Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:90901d7093e2f046bc89c4669324c772347bf62cada6bc195c12ef61bb9adcf7","observation_id":"eac410f0-d018-4901-915d-509962b74616","resolution":{"observed_at":"2026-08-04T09:45:41.015680Z","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-04T09:45:41.152838Z","title":"Vidyasankar,Covering the edge-set of a directed graph with trees, Discrete Mathe- matics, 24 (1978) 79-85","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:41.152838Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:024efb2b7e2ed8e8ffa1646114bc16ffbb80efeae67ee056c98339b499b2d020","observation_id":"31981e0c-0652-4add-90a7-284698a035e5","resolution":{"observed_at":"2026-08-04T09:45:41.152838Z","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-04T09:45:41.270810Z","title":"Whiteley,Some matroids from discrete applied geometry,in: Matroid Theory (J.E","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-04T09:45:41.270810Z"},"links":{"citing_paper":"/paper/2510.23614"},"observation_digest":"sha256:2cf87761756ae96b999ea9c9ccb0549dcc9a4fd3b743e8275da9b08c1cf96ef1","observation_id":"2b052e74-e375-4639-8621-6d979574bbb1","resolution":{"observed_at":"2026-08-04T09:45:41.270810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2510.23614","last_updated":"2026-07-20T14:33:43Z","latest_version":2,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-13T02:02:24.735703Z","submitted_at":"2025-10-16T07:49:49Z","title":"How to see the forest despite the trees"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":51,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":51},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 0 inbound Pith citation observations for arXiv:2510.23614."}