{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VN5DPI4CTXY4WX4L266SK35CR2","short_pith_number":"pith:VN5DPI4C","canonical_record":{"source":{"id":"2605.23509","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-22T11:17:08Z","cross_cats_sorted":[],"title_canon_sha256":"eb55cadd19898efccab4b2012e862c277e02c4f9ae9945ff8c2a2753669548d8","abstract_canon_sha256":"d8680de540055909f07b9b9b9feb3ebbc4feb851e5697b5c05d52e81c358ca64"},"schema_version":"1.0"},"canonical_sha256":"ab7a37a3829df1cb5f8bd7bd256fa28e81ab73003c81d0d6b801afe2105dbce7","source":{"kind":"arxiv","id":"2605.23509","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23509","created_at":"2026-05-25T02:01:58Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23509v1","created_at":"2026-05-25T02:01:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23509","created_at":"2026-05-25T02:01:58Z"},{"alias_kind":"pith_short_12","alias_value":"VN5DPI4CTXY4","created_at":"2026-05-25T02:01:58Z"},{"alias_kind":"pith_short_16","alias_value":"VN5DPI4CTXY4WX4L","created_at":"2026-05-25T02:01:58Z"},{"alias_kind":"pith_short_8","alias_value":"VN5DPI4C","created_at":"2026-05-25T02:01:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VN5DPI4CTXY4WX4L266SK35CR2","target":"record","payload":{"canonical_record":{"source":{"id":"2605.23509","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-22T11:17:08Z","cross_cats_sorted":[],"title_canon_sha256":"eb55cadd19898efccab4b2012e862c277e02c4f9ae9945ff8c2a2753669548d8","abstract_canon_sha256":"d8680de540055909f07b9b9b9feb3ebbc4feb851e5697b5c05d52e81c358ca64"},"schema_version":"1.0"},"canonical_sha256":"ab7a37a3829df1cb5f8bd7bd256fa28e81ab73003c81d0d6b801afe2105dbce7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:01:58.529693Z","signature_b64":"QhSCqggQvZSSLwA0/hnbonacF5TyTTGXwYBayg4fFZn2woCANjrou97eOkIn7DD5wk+pj5G03PwdmOe6JiHAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab7a37a3829df1cb5f8bd7bd256fa28e81ab73003c81d0d6b801afe2105dbce7","last_reissued_at":"2026-05-25T02:01:58.529037Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:01:58.529037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.23509","source_version":1,"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-05-25T02:01:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LfNDPko93VJRUGEqjhGNGqkyiQSnmNdnI9uM5eHkeek5Jwj65PRGFqzni9e3sl7gU3tlytKH6NDHIlYg01sPCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:50:19.450310Z"},"content_sha256":"812ac96b64492e0ab9cf84ffd3113f82eda18a52658d5044cfab1bf1fbf4a543","schema_version":"1.0","event_id":"sha256:812ac96b64492e0ab9cf84ffd3113f82eda18a52658d5044cfab1bf1fbf4a543"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VN5DPI4CTXY4WX4L266SK35CR2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reducing the Randomness in Partition Oracles for Bounded Degree Minor-Free Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Abhiruk Lahiri, Akash Kumar, C. Seshadhri","submitted_at":"2026-05-22T11:17:08Z","abstract_excerpt":"Consider a bounded-degree graph $G$ that belongs to a minor-closed family (such as planar graphs). Such a graph has a hyperfinite decomposition, wherein, for a sufficiently small $\\varepsilon > 0$, one can remove $\\varepsilon dn$ edges to obtain connected components of size independent of $n$. (As usual, $n$ is the number of vertices and $d$ is the degree bound.) In a seminal result, Hassidim-Kelner-Nguyen-Onak (FOCS 2009) introduced the partition oracle, a procedure that provides local access to a hyperfinite decomposition. The partition oracle computes the component containing an input verte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23509","kind":"arxiv","version":1},"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/2605.23509/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-05-25T02:01:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zlmJ6Tf7hGUYPBfsamA8dVdJM8CfAhFHNQRSZcppvf/H8k1ct/bsZMXcPtPThsaBCU1Rs0GW2XMtRtoID3QaCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:50:19.451017Z"},"content_sha256":"8d10cfd468a51846e49c94e9d9ad7fa7951dfeb30c70b507eb6e76802619e31b","schema_version":"1.0","event_id":"sha256:8d10cfd468a51846e49c94e9d9ad7fa7951dfeb30c70b507eb6e76802619e31b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VN5DPI4CTXY4WX4L266SK35CR2/bundle.json","state_url":"https://pith.science/pith/VN5DPI4CTXY4WX4L266SK35CR2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VN5DPI4CTXY4WX4L266SK35CR2/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-06-10T05:50:19Z","links":{"resolver":"https://pith.science/pith/VN5DPI4CTXY4WX4L266SK35CR2","bundle":"https://pith.science/pith/VN5DPI4CTXY4WX4L266SK35CR2/bundle.json","state":"https://pith.science/pith/VN5DPI4CTXY4WX4L266SK35CR2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VN5DPI4CTXY4WX4L266SK35CR2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VN5DPI4CTXY4WX4L266SK35CR2","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":"d8680de540055909f07b9b9b9feb3ebbc4feb851e5697b5c05d52e81c358ca64","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-22T11:17:08Z","title_canon_sha256":"eb55cadd19898efccab4b2012e862c277e02c4f9ae9945ff8c2a2753669548d8"},"schema_version":"1.0","source":{"id":"2605.23509","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23509","created_at":"2026-05-25T02:01:58Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23509v1","created_at":"2026-05-25T02:01:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23509","created_at":"2026-05-25T02:01:58Z"},{"alias_kind":"pith_short_12","alias_value":"VN5DPI4CTXY4","created_at":"2026-05-25T02:01:58Z"},{"alias_kind":"pith_short_16","alias_value":"VN5DPI4CTXY4WX4L","created_at":"2026-05-25T02:01:58Z"},{"alias_kind":"pith_short_8","alias_value":"VN5DPI4C","created_at":"2026-05-25T02:01:58Z"}],"graph_snapshots":[{"event_id":"sha256:8d10cfd468a51846e49c94e9d9ad7fa7951dfeb30c70b507eb6e76802619e31b","target":"graph","created_at":"2026-05-25T02:01:58Z","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/2605.23509/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Consider a bounded-degree graph $G$ that belongs to a minor-closed family (such as planar graphs). Such a graph has a hyperfinite decomposition, wherein, for a sufficiently small $\\varepsilon > 0$, one can remove $\\varepsilon dn$ edges to obtain connected components of size independent of $n$. (As usual, $n$ is the number of vertices and $d$ is the degree bound.) In a seminal result, Hassidim-Kelner-Nguyen-Onak (FOCS 2009) introduced the partition oracle, a procedure that provides local access to a hyperfinite decomposition. The partition oracle computes the component containing an input verte","authors_text":"Abhiruk Lahiri, Akash Kumar, C. Seshadhri","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-22T11:17:08Z","title":"Reducing the Randomness in Partition Oracles for Bounded Degree Minor-Free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23509","kind":"arxiv","version":1},"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:812ac96b64492e0ab9cf84ffd3113f82eda18a52658d5044cfab1bf1fbf4a543","target":"record","created_at":"2026-05-25T02:01:58Z","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":"d8680de540055909f07b9b9b9feb3ebbc4feb851e5697b5c05d52e81c358ca64","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-22T11:17:08Z","title_canon_sha256":"eb55cadd19898efccab4b2012e862c277e02c4f9ae9945ff8c2a2753669548d8"},"schema_version":"1.0","source":{"id":"2605.23509","kind":"arxiv","version":1}},"canonical_sha256":"ab7a37a3829df1cb5f8bd7bd256fa28e81ab73003c81d0d6b801afe2105dbce7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab7a37a3829df1cb5f8bd7bd256fa28e81ab73003c81d0d6b801afe2105dbce7","first_computed_at":"2026-05-25T02:01:58.529037Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:01:58.529037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QhSCqggQvZSSLwA0/hnbonacF5TyTTGXwYBayg4fFZn2woCANjrou97eOkIn7DD5wk+pj5G03PwdmOe6JiHAAA==","signature_status":"signed_v1","signed_at":"2026-05-25T02:01:58.529693Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.23509","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:812ac96b64492e0ab9cf84ffd3113f82eda18a52658d5044cfab1bf1fbf4a543","sha256:8d10cfd468a51846e49c94e9d9ad7fa7951dfeb30c70b507eb6e76802619e31b"],"state_sha256":"6b8fe9fccbe7bc37559a428fc4884248357cab05854fd20343a8edafb1f984e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+pA+ntGHwyiFa4jd5IAC9T4ygvel448uHakXCzKlD3grQCYw/UIIY+YoTixSMBoAXlkYZncX50QLkH9Xz3KQBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T05:50:19.454953Z","bundle_sha256":"3982158c8709685ceaf300af50964fd46f253e2f2f3c595b35e46021536eb882"}}