{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:L4FS3A3YR5N42JUIMEVKXFGXHX","short_pith_number":"pith:L4FS3A3Y","canonical_record":{"source":{"id":"2308.13890","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-08-26T14:21:21Z","cross_cats_sorted":[],"title_canon_sha256":"0b49ab31c3aa858e6630c57a101ac45c4d18b123088b4cc0cc5cf98905352664","abstract_canon_sha256":"8a2b6ae7ff646e23cdc86245be173765e4f03701674e9a8c1e32e135ea1ff370"},"schema_version":"1.0"},"canonical_sha256":"5f0b2d83788f5bcd2688612aab94d73dec1cdffde4a3600465840a6ab057598f","source":{"kind":"arxiv","id":"2308.13890","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.13890","created_at":"2026-07-05T07:25:44Z"},{"alias_kind":"arxiv_version","alias_value":"2308.13890v4","created_at":"2026-07-05T07:25:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.13890","created_at":"2026-07-05T07:25:44Z"},{"alias_kind":"pith_short_12","alias_value":"L4FS3A3YR5N4","created_at":"2026-07-05T07:25:44Z"},{"alias_kind":"pith_short_16","alias_value":"L4FS3A3YR5N42JUI","created_at":"2026-07-05T07:25:44Z"},{"alias_kind":"pith_short_8","alias_value":"L4FS3A3Y","created_at":"2026-07-05T07:25:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:L4FS3A3YR5N42JUIMEVKXFGXHX","target":"record","payload":{"canonical_record":{"source":{"id":"2308.13890","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-08-26T14:21:21Z","cross_cats_sorted":[],"title_canon_sha256":"0b49ab31c3aa858e6630c57a101ac45c4d18b123088b4cc0cc5cf98905352664","abstract_canon_sha256":"8a2b6ae7ff646e23cdc86245be173765e4f03701674e9a8c1e32e135ea1ff370"},"schema_version":"1.0"},"canonical_sha256":"5f0b2d83788f5bcd2688612aab94d73dec1cdffde4a3600465840a6ab057598f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:25:44.867656Z","signature_b64":"hZvf2Lx5iyQxoms5Nd8nQxZF2tx1RmqUEzFyeglYQQuWMs3QE3d5o8OP2kwacljtIDy24Jlazk+L9iJ8w2H2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f0b2d83788f5bcd2688612aab94d73dec1cdffde4a3600465840a6ab057598f","last_reissued_at":"2026-07-05T07:25:44.867131Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:25:44.867131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.13890","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:25:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xqh6jaDLptH41a2kO3oa7ztcMcz3VGF0K7Cl6vBreZJnJJpAF1njf+mGIMq+FZM2WIiKvO0q5NKeTx7UhnexAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:55:57.973483Z"},"content_sha256":"836e17ce48c5d837cfb8216fbabfd0d17a128bdf59acb46f112a35c7ccd8afb9","schema_version":"1.0","event_id":"sha256:836e17ce48c5d837cfb8216fbabfd0d17a128bdf59acb46f112a35c7ccd8afb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:L4FS3A3YR5N42JUIMEVKXFGXHX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spanning Adjacency Oracles in Sublinear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Greg Bodwin, Henry Fleischmann","submitted_at":"2023-08-26T14:21:21Z","abstract_excerpt":"Suppose we are given an $n$-node, $m$-edge input graph $G$, and the goal is to compute a spanning subgraph $H$ on $O(n)$ edges. This can be achieved in linear $O(m + n)$ time via breadth-first search. But can we hope for \\emph{sublinear} runtime in some range of parameters?\n  If the goal is to return $H$ as an adjacency list, there are simple lower bounds showing that $\\Omega(m + n)$ runtime is necessary. If the goal is to return $H$ as an adjacency matrix, then we need $\\Omega(n^2)$ time just to write down the entries of the output matrix. However, we show that neither of these lower bounds s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.13890","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.13890/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:25:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IIZXNWqcSogcaJJdfceFnzuNqMWDECKmkZcVVyii45w5vL+ejYj0JTuaJczUIQvOHLK3qKawSS8J1XmmqjVWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T04:55:57.974144Z"},"content_sha256":"f2d2b4d6fe8f1690a0557586b829402e7a663747aa9da0d24083e276a88e377f","schema_version":"1.0","event_id":"sha256:f2d2b4d6fe8f1690a0557586b829402e7a663747aa9da0d24083e276a88e377f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L4FS3A3YR5N42JUIMEVKXFGXHX/bundle.json","state_url":"https://pith.science/pith/L4FS3A3YR5N42JUIMEVKXFGXHX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L4FS3A3YR5N42JUIMEVKXFGXHX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-07T04:55:57Z","links":{"resolver":"https://pith.science/pith/L4FS3A3YR5N42JUIMEVKXFGXHX","bundle":"https://pith.science/pith/L4FS3A3YR5N42JUIMEVKXFGXHX/bundle.json","state":"https://pith.science/pith/L4FS3A3YR5N42JUIMEVKXFGXHX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L4FS3A3YR5N42JUIMEVKXFGXHX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:L4FS3A3YR5N42JUIMEVKXFGXHX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8a2b6ae7ff646e23cdc86245be173765e4f03701674e9a8c1e32e135ea1ff370","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-08-26T14:21:21Z","title_canon_sha256":"0b49ab31c3aa858e6630c57a101ac45c4d18b123088b4cc0cc5cf98905352664"},"schema_version":"1.0","source":{"id":"2308.13890","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.13890","created_at":"2026-07-05T07:25:44Z"},{"alias_kind":"arxiv_version","alias_value":"2308.13890v4","created_at":"2026-07-05T07:25:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.13890","created_at":"2026-07-05T07:25:44Z"},{"alias_kind":"pith_short_12","alias_value":"L4FS3A3YR5N4","created_at":"2026-07-05T07:25:44Z"},{"alias_kind":"pith_short_16","alias_value":"L4FS3A3YR5N42JUI","created_at":"2026-07-05T07:25:44Z"},{"alias_kind":"pith_short_8","alias_value":"L4FS3A3Y","created_at":"2026-07-05T07:25:44Z"}],"graph_snapshots":[{"event_id":"sha256:f2d2b4d6fe8f1690a0557586b829402e7a663747aa9da0d24083e276a88e377f","target":"graph","created_at":"2026-07-05T07:25:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2308.13890/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Suppose we are given an $n$-node, $m$-edge input graph $G$, and the goal is to compute a spanning subgraph $H$ on $O(n)$ edges. This can be achieved in linear $O(m + n)$ time via breadth-first search. But can we hope for \\emph{sublinear} runtime in some range of parameters?\n  If the goal is to return $H$ as an adjacency list, there are simple lower bounds showing that $\\Omega(m + n)$ runtime is necessary. If the goal is to return $H$ as an adjacency matrix, then we need $\\Omega(n^2)$ time just to write down the entries of the output matrix. However, we show that neither of these lower bounds s","authors_text":"Greg Bodwin, Henry Fleischmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-08-26T14:21:21Z","title":"Spanning Adjacency Oracles in Sublinear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.13890","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:836e17ce48c5d837cfb8216fbabfd0d17a128bdf59acb46f112a35c7ccd8afb9","target":"record","created_at":"2026-07-05T07:25:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8a2b6ae7ff646e23cdc86245be173765e4f03701674e9a8c1e32e135ea1ff370","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-08-26T14:21:21Z","title_canon_sha256":"0b49ab31c3aa858e6630c57a101ac45c4d18b123088b4cc0cc5cf98905352664"},"schema_version":"1.0","source":{"id":"2308.13890","kind":"arxiv","version":4}},"canonical_sha256":"5f0b2d83788f5bcd2688612aab94d73dec1cdffde4a3600465840a6ab057598f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f0b2d83788f5bcd2688612aab94d73dec1cdffde4a3600465840a6ab057598f","first_computed_at":"2026-07-05T07:25:44.867131Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:25:44.867131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hZvf2Lx5iyQxoms5Nd8nQxZF2tx1RmqUEzFyeglYQQuWMs3QE3d5o8OP2kwacljtIDy24Jlazk+L9iJ8w2H2CA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:25:44.867656Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.13890","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:836e17ce48c5d837cfb8216fbabfd0d17a128bdf59acb46f112a35c7ccd8afb9","sha256:f2d2b4d6fe8f1690a0557586b829402e7a663747aa9da0d24083e276a88e377f"],"state_sha256":"434e5d42ae50d5bd3ef35c35524a4cccfe35ca5f68e65d1521af5399757e41fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"clsyvOfnqZQLVv6QAtktmVkpK4FQt/eZwVJs6+XzvXaY2gME9b7EJ6nEj4FLFPxbzLU9XYz0KzhniJL901cnBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T04:55:57.978179Z","bundle_sha256":"0c8bd8815539b428734c432611218001322030fe98e8b54a66eb987b38adfd3c"}}