{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6XSX4VDFOSGQWXAQGITWFIRFID","short_pith_number":"pith:6XSX4VDF","canonical_record":{"source":{"id":"1302.3417","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-14T14:51:29Z","cross_cats_sorted":[],"title_canon_sha256":"5a2c211e0f3274d5b676af3931957cf9c416c53e760a6619257c34b512103eac","abstract_canon_sha256":"b644f551b5ca6d17d904bb941427b0de8f999a5fa727f8f0c286a98b790c125c"},"schema_version":"1.0"},"canonical_sha256":"f5e57e5465748d0b5c10322762a22540c51401284c0f5cf534ddf09b6b8b66c5","source":{"kind":"arxiv","id":"1302.3417","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3417","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3417v1","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3417","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"pith_short_12","alias_value":"6XSX4VDFOSGQ","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6XSX4VDFOSGQWXAQ","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6XSX4VDF","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6XSX4VDFOSGQWXAQGITWFIRFID","target":"record","payload":{"canonical_record":{"source":{"id":"1302.3417","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-14T14:51:29Z","cross_cats_sorted":[],"title_canon_sha256":"5a2c211e0f3274d5b676af3931957cf9c416c53e760a6619257c34b512103eac","abstract_canon_sha256":"b644f551b5ca6d17d904bb941427b0de8f999a5fa727f8f0c286a98b790c125c"},"schema_version":"1.0"},"canonical_sha256":"f5e57e5465748d0b5c10322762a22540c51401284c0f5cf534ddf09b6b8b66c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:38.986229Z","signature_b64":"A2gy0+4o9huezlTZxzzDifXuH6HQZXDa6nc1M5PnoaQeLKUDSIDy1quneee+5kxDqj1oy0JcnqY3pVn4adfLAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5e57e5465748d0b5c10322762a22540c51401284c0f5cf534ddf09b6b8b66c5","last_reissued_at":"2026-05-18T03:33:38.985445Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:38.985445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.3417","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-18T03:33:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bKpQYC3T7WS2oG89yo0bYkwHwE7fvejO7sVQbfu1e+9IfiM+6uwB4XOLH9WhYWl6nLr8X6FzV8sZ2Sax0J2NAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:26:18.494430Z"},"content_sha256":"a20b3387a549feb847bab7c94f2af4ae6f57c2937abb92de17af4475b70ef7a1","schema_version":"1.0","event_id":"sha256:a20b3387a549feb847bab7c94f2af4ae6f57c2937abb92de17af4475b70ef7a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6XSX4VDFOSGQWXAQGITWFIRFID","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dana Ron, Reut Levi","submitted_at":"2013-02-14T14:51:29Z","abstract_excerpt":"Motivated by the problem of testing planarity and related properties, we study the problem of designing efficient {\\em partition oracles}. A {\\em partition oracle} is a procedure that, given access to the incidence lists representation of a bounded-degree graph $G= (V,E)$ and a parameter $\\eps$, when queried on a vertex $v\\in V$, returns the part (subset of vertices) which $v$ belongs to in a partition of all graph vertices. The partition should be such that all parts are small, each part is connected, and if the graph has certain properties, the total number of edges between parts is at most "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3417","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":""},"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-18T03:33:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nMPCHvoOLm64TAtuhdsEAlPltlpgsYV7ukxBF5+ww5u7jN8aiiE8DK+pF2yjZEXFnHGdwz7ekF5iFIg9gZ2iBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:26:18.494789Z"},"content_sha256":"2da486ffb40f23e46fd3ac5a5a82aa3bef44ff6a7cd51ddd58f86d88e274562b","schema_version":"1.0","event_id":"sha256:2da486ffb40f23e46fd3ac5a5a82aa3bef44ff6a7cd51ddd58f86d88e274562b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6XSX4VDFOSGQWXAQGITWFIRFID/bundle.json","state_url":"https://pith.science/pith/6XSX4VDFOSGQWXAQGITWFIRFID/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6XSX4VDFOSGQWXAQGITWFIRFID/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-01T10:26:18Z","links":{"resolver":"https://pith.science/pith/6XSX4VDFOSGQWXAQGITWFIRFID","bundle":"https://pith.science/pith/6XSX4VDFOSGQWXAQGITWFIRFID/bundle.json","state":"https://pith.science/pith/6XSX4VDFOSGQWXAQGITWFIRFID/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6XSX4VDFOSGQWXAQGITWFIRFID/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6XSX4VDFOSGQWXAQGITWFIRFID","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":"b644f551b5ca6d17d904bb941427b0de8f999a5fa727f8f0c286a98b790c125c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-14T14:51:29Z","title_canon_sha256":"5a2c211e0f3274d5b676af3931957cf9c416c53e760a6619257c34b512103eac"},"schema_version":"1.0","source":{"id":"1302.3417","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3417","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3417v1","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3417","created_at":"2026-05-18T03:33:38Z"},{"alias_kind":"pith_short_12","alias_value":"6XSX4VDFOSGQ","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6XSX4VDFOSGQWXAQ","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6XSX4VDF","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:2da486ffb40f23e46fd3ac5a5a82aa3bef44ff6a7cd51ddd58f86d88e274562b","target":"graph","created_at":"2026-05-18T03:33:38Z","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"},"paper":{"abstract_excerpt":"Motivated by the problem of testing planarity and related properties, we study the problem of designing efficient {\\em partition oracles}. A {\\em partition oracle} is a procedure that, given access to the incidence lists representation of a bounded-degree graph $G= (V,E)$ and a parameter $\\eps$, when queried on a vertex $v\\in V$, returns the part (subset of vertices) which $v$ belongs to in a partition of all graph vertices. The partition should be such that all parts are small, each part is connected, and if the graph has certain properties, the total number of edges between parts is at most ","authors_text":"Dana Ron, Reut Levi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-14T14:51:29Z","title":"A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3417","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:a20b3387a549feb847bab7c94f2af4ae6f57c2937abb92de17af4475b70ef7a1","target":"record","created_at":"2026-05-18T03:33:38Z","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":"b644f551b5ca6d17d904bb941427b0de8f999a5fa727f8f0c286a98b790c125c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-14T14:51:29Z","title_canon_sha256":"5a2c211e0f3274d5b676af3931957cf9c416c53e760a6619257c34b512103eac"},"schema_version":"1.0","source":{"id":"1302.3417","kind":"arxiv","version":1}},"canonical_sha256":"f5e57e5465748d0b5c10322762a22540c51401284c0f5cf534ddf09b6b8b66c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5e57e5465748d0b5c10322762a22540c51401284c0f5cf534ddf09b6b8b66c5","first_computed_at":"2026-05-18T03:33:38.985445Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:38.985445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A2gy0+4o9huezlTZxzzDifXuH6HQZXDa6nc1M5PnoaQeLKUDSIDy1quneee+5kxDqj1oy0JcnqY3pVn4adfLAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:38.986229Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3417","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a20b3387a549feb847bab7c94f2af4ae6f57c2937abb92de17af4475b70ef7a1","sha256:2da486ffb40f23e46fd3ac5a5a82aa3bef44ff6a7cd51ddd58f86d88e274562b"],"state_sha256":"1af609eb78c6d191d7c9bfdc585f094989fcd55c1d6bc64583c12da4c164cd92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N2ytXPJxQhkdKZ0VAjXnjIt/clMMcf319FdNVl7Dyc4+FSmwsTXi7QQy2iKlQJXBS4P68mvHuYFavezlyFd4Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:26:18.496889Z","bundle_sha256":"f06f28f16f29ec533d053d4d0cb71195694b4d1418f6cfe9733840cfb39bde27"}}