{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VN5DPI4CTXY4WX4L266SK35CR2","short_pith_number":"pith:VN5DPI4C","schema_version":"1.0","canonical_sha256":"ab7a37a3829df1cb5f8bd7bd256fa28e81ab73003c81d0d6b801afe2105dbce7","source":{"kind":"arxiv","id":"2605.23509","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.23509","created_at":"2026-05-25T02:01:58.529131+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.23509v1","created_at":"2026-05-25T02:01:58.529131+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23509","created_at":"2026-05-25T02:01:58.529131+00:00"},{"alias_kind":"pith_short_12","alias_value":"VN5DPI4CTXY4","created_at":"2026-05-25T02:01:58.529131+00:00"},{"alias_kind":"pith_short_16","alias_value":"VN5DPI4CTXY4WX4L","created_at":"2026-05-25T02:01:58.529131+00:00"},{"alias_kind":"pith_short_8","alias_value":"VN5DPI4C","created_at":"2026-05-25T02:01:58.529131+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VN5DPI4CTXY4WX4L266SK35CR2","json":"https://pith.science/pith/VN5DPI4CTXY4WX4L266SK35CR2.json","graph_json":"https://pith.science/api/pith-number/VN5DPI4CTXY4WX4L266SK35CR2/graph.json","events_json":"https://pith.science/api/pith-number/VN5DPI4CTXY4WX4L266SK35CR2/events.json","paper":"https://pith.science/paper/VN5DPI4C"},"agent_actions":{"view_html":"https://pith.science/pith/VN5DPI4CTXY4WX4L266SK35CR2","download_json":"https://pith.science/pith/VN5DPI4CTXY4WX4L266SK35CR2.json","view_paper":"https://pith.science/paper/VN5DPI4C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.23509&json=true","fetch_graph":"https://pith.science/api/pith-number/VN5DPI4CTXY4WX4L266SK35CR2/graph.json","fetch_events":"https://pith.science/api/pith-number/VN5DPI4CTXY4WX4L266SK35CR2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VN5DPI4CTXY4WX4L266SK35CR2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VN5DPI4CTXY4WX4L266SK35CR2/action/storage_attestation","attest_author":"https://pith.science/pith/VN5DPI4CTXY4WX4L266SK35CR2/action/author_attestation","sign_citation":"https://pith.science/pith/VN5DPI4CTXY4WX4L266SK35CR2/action/citation_signature","submit_replication":"https://pith.science/pith/VN5DPI4CTXY4WX4L266SK35CR2/action/replication_record"}},"created_at":"2026-05-25T02:01:58.529131+00:00","updated_at":"2026-05-25T02:01:58.529131+00:00"}