{"as_of":"2026-08-20T14:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:585fd71dc8163c3a9ec6690df1e266c8fccd7dfce35a445cfa84e48600f5e7a1","coverage":[{"denominator":11,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T16:29:29.689722Z","state":"measured"},{"denominator":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+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/2502.06237/citation-record","integrity":"/paper/2502.06237/integrity","json":"/paper/2502.06237/citation-record.json","paper":"/paper/2502.06237"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T16:29:29.842253Z","title":"Ahuja, Thomas L","venue":null,"work_id":"4f73f194-410b-45dc-a136-96b0856f3523","year":2009},"citing_paper":{"arxiv_id":"2502.06237","last_updated":"2025-02-10T08:16:11Z","snapshot_observed_at":"2026-08-19T22:14:36.129000Z","submitted_at":"2025-02-10T08:16:11Z","title":"Maximum flow and self-avoiding walk on bunkbed graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T16:29:29.644380Z"},"links":{"citing_paper":"/paper/2502.06237"},"observation_digest":"sha256:990c504ac677f03edc5e798bf475dc2c92fbdd32a8aca528be284254ef92c009","observation_id":"f9713027-58fc-4dad-b220-b5e9963ac7f3","resolution":{"observed_at":"2026-08-08T16:29:29.847116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T16:29:29.649158Z","title":"Phase transition in the family of p-resistances","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.06237","last_updated":"2025-02-10T08:16:11Z","snapshot_observed_at":"2026-08-19T22:14:36.129000Z","submitted_at":"2025-02-10T08:16:11Z","title":"Maximum flow and self-avoiding walk on bunkbed graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T16:29:29.649158Z"},"links":{"citing_paper":"/paper/2502.06237"},"observation_digest":"sha256:f2a27efbbf6492032662e3f53516745d780c511cb10d4d9e5d66388590c7c879","observation_id":"4cbfff18-b9cd-470c-8e8f-1d911c519ab7","resolution":{"observed_at":"2026-08-08T16:29:29.649158Z","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-08T16:29:29.822289Z","title":"Lectures on self-avoiding walks","venue":null,"work_id":"ca0e09f8-c401-4b58-b994-1247c9f9ceb8","year":2012},"citing_paper":{"arxiv_id":"2502.06237","last_updated":"2025-02-10T08:16:11Z","snapshot_observed_at":"2026-08-19T22:14:36.129000Z","submitted_at":"2025-02-10T08:16:11Z","title":"Maximum flow and self-avoiding walk on bunkbed graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T16:29:29.653191Z"},"links":{"citing_paper":"/paper/2502.06237"},"observation_digest":"sha256:0a239166432db012dc3e4d9f5f23751e50e01b5ffd9732f97a396400399223dc","observation_id":"4cf4737f-cc34-43c3-8c82-ee39b5361fff","resolution":{"observed_at":"2026-08-08T16:29:29.826495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T16:29:29.809878Z","title":"Random walks and electrical resistances in products of graphs","venue":null,"work_id":"4748a6d5-fb20-4554-b8eb-386a1cc4d648","year":1997},"citing_paper":{"arxiv_id":"2502.06237","last_updated":"2025-02-10T08:16:11Z","snapshot_observed_at":"2026-08-19T22:14:36.129000Z","submitted_at":"2025-02-10T08:16:11Z","title":"Maximum flow and self-avoiding walk on bunkbed graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T16:29:29.657002Z"},"links":{"citing_paper":"/paper/2502.06237"},"observation_digest":"sha256:b47b6796bea653e5a51a4dffb842d01bee56d438519d5b6a6891522a09f2bf87","observation_id":"46a18133-94a0-41dd-9fef-86ffd4fb28f4","resolution":{"observed_at":"2026-08-08T16:29:29.814223Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.02545","last_updated":"2024-10-03T14:48:55Z","snapshot_observed_at":"2026-08-19T17:06:15.233358Z","submitted_at":"2024-10-03T14:48:55Z","title":"The bunkbed conjecture is false","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.02545","snapshot_observed_at":"2026-08-08T16:29:29.661871Z","title":"The bunkb ed conjecture is false","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06237","last_updated":"2025-02-10T08:16:11Z","snapshot_observed_at":"2026-08-19T22:14:36.129000Z","submitted_at":"2025-02-10T08:16:11Z","title":"Maximum flow and self-avoiding walk on bunkbed graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T16:29:29.661871Z"},"links":{"cited_paper":"/paper/2410.02545","citing_paper":"/paper/2502.06237"},"observation_digest":"sha256:e33f6c1ce05aa76a3b6224d3f6c9ffe9b4106b679b503bbca81df2dfef0c56bf","observation_id":"fde08639-b7a2-4c32-9d59-bfebe3b1968c","resolution":{"observed_at":"2026-08-08T16:29:29.661871Z","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-08T16:29:29.796180Z","title":"On a conjecture of Bollob´ as and Brigh twell concerning random walks on product graphs","venue":null,"work_id":"fc8e35ea-a347-4d23-86f3-85685933a50d","year":1998},"citing_paper":{"arxiv_id":"2502.06237","last_updated":"2025-02-10T08:16:11Z","snapshot_observed_at":"2026-08-19T22:14:36.129000Z","submitted_at":"2025-02-10T08:16:11Z","title":"Maximum flow and self-avoiding walk on bunkbed graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T16:29:29.667617Z"},"links":{"citing_paper":"/paper/2502.06237"},"observation_digest":"sha256:af209f767011b94e68c032d348b2998cc828a69183a2092e8e51ddddc689f76b","observation_id":"946d5d50-34de-4273-ae1f-55a32f822c18","resolution":{"observed_at":"2026-08-08T16:29:29.801070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T16:29:29.784469Z","title":"Probability on bunkbed graphs","venue":null,"work_id":"efe54ca8-f011-4d78-a107-f5cf52898518","year":2003},"citing_paper":{"arxiv_id":"2502.06237","last_updated":"2025-02-10T08:16:11Z","snapshot_observed_at":"2026-08-19T22:14:36.129000Z","submitted_at":"2025-02-10T08:16:11Z","title":"Maximum flow and self-avoiding walk on bunkbed graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T16:29:29.672671Z"},"links":{"citing_paper":"/paper/2502.06237"},"observation_digest":"sha256:d1911730cd540633eeccf904010d51bf6e41e586eec238715c94277368b2d223","observation_id":"fb0fc73d-5097-4068-ab2c-e551b64d4b27","resolution":{"observed_at":"2026-08-08T16:29:29.788367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01790","last_updated":"2024-06-03T21:13:50Z","snapshot_observed_at":"2026-08-16T13:46:32.068552Z","submitted_at":"2024-06-03T21:13:50Z","title":"The bunkbed conjecture is not robust to generalisation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01790","snapshot_observed_at":"2026-08-08T16:29:29.677567Z","title":"The bunkbed conjecture is not robust to generalisation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06237","last_updated":"2025-02-10T08:16:11Z","snapshot_observed_at":"2026-08-19T22:14:36.129000Z","submitted_at":"2025-02-10T08:16:11Z","title":"Maximum flow and self-avoiding walk on bunkbed graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T16:29:29.677567Z"},"links":{"cited_paper":"/paper/2406.01790","citing_paper":"/paper/2502.06237"},"observation_digest":"sha256:475b148cc16beacc1c52785a56e6ad95f2b8a5a093e5d4d32a76c92c04a87f28","observation_id":"922ef1cd-1c3e-4477-8916-14af5c5b2329","resolution":{"observed_at":"2026-08-08T16:29:29.677567Z","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-08T16:29:29.769820Z","title":"The self-avoiding walk","venue":null,"work_id":"3caa9eae-650a-4296-9433-566eaad3b5ad","year":1993},"citing_paper":{"arxiv_id":"2502.06237","last_updated":"2025-02-10T08:16:11Z","snapshot_observed_at":"2026-08-19T22:14:36.129000Z","submitted_at":"2025-02-10T08:16:11Z","title":"Maximum flow and self-avoiding walk on bunkbed graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T16:29:29.682133Z"},"links":{"citing_paper":"/paper/2502.06237"},"observation_digest":"sha256:26148d485e2099fa2554b02b23a7c1953dd07d074f764e88dacc0fa4d7a946f7","observation_id":"2ed6791c-f096-49af-b70c-dd9bbbd6b8fd","resolution":{"observed_at":"2026-08-08T16:29:29.774457Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T16:29:29.755580Z","title":null,"venue":null,"work_id":"7333cf06-f7c1-4844-a570-837f8ce3d19a","year":1994},"citing_paper":{"arxiv_id":"2502.06237","last_updated":"2025-02-10T08:16:11Z","snapshot_observed_at":"2026-08-19T22:14:36.129000Z","submitted_at":"2025-02-10T08:16:11Z","title":"Maximum flow and self-avoiding walk on bunkbed graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T16:29:29.686093Z"},"links":{"citing_paper":"/paper/2502.06237"},"observation_digest":"sha256:941ab6c8a0b6d99f730a06404f1f414d98b71ab93d55df21ab02091674634e07","observation_id":"f0289a06-4bd3-4ed0-8272-b5c9c010215e","resolution":{"observed_at":"2026-08-08T16:29:29.760611Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T16:29:29.739616Z","title":"van den Berg and J","venue":null,"work_id":"6d7cab52-5e02-4030-8112-ddcdd3b7db64","year":2001},"citing_paper":{"arxiv_id":"2502.06237","last_updated":"2025-02-10T08:16:11Z","snapshot_observed_at":"2026-08-19T22:14:36.129000Z","submitted_at":"2025-02-10T08:16:11Z","title":"Maximum flow and self-avoiding walk on bunkbed graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T16:29:29.689722Z"},"links":{"citing_paper":"/paper/2502.06237"},"observation_digest":"sha256:b499092dec04aebeca531180ffd679c0c0c254239d5b0bddd7e89b8c32f34888","observation_id":"90680b73-1189-4c01-9258-e53c584ad255","resolution":{"observed_at":"2026-08-08T16:29:29.745101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.06237","last_updated":"2025-02-10T08:16:11Z","latest_version":1,"primary_category":"math.PR","snapshot_observed_at":"2026-08-19T22:14:36.129000Z","submitted_at":"2025-02-10T08:16:11Z","title":"Maximum flow and self-avoiding walk on bunkbed graphs"},"reference_resolution":{"displayed":11,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":7},"total_outbound_references":11},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 11 of 11 outbound references and 0 inbound Pith citation observations for arXiv:2502.06237."}