{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:6VFBYS3R7N36OORVGGV26PV7TY","short_pith_number":"pith:6VFBYS3R","canonical_record":{"source":{"id":"1208.2223","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-08-10T17:16:53Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"de3357e872211175110824f01368d2f9efcaa5b9bffae7362b8b67662cecbac5","abstract_canon_sha256":"2acceef309bf74058de3b4157b191b95a4f40fabb36fdfb62315c68fcdcdef61"},"schema_version":"1.0"},"canonical_sha256":"f54a1c4b71fb77e73a3531abaf3ebf9e04305cc5b703af377341538e5d4704cd","source":{"kind":"arxiv","id":"1208.2223","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.2223","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"arxiv_version","alias_value":"1208.2223v3","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2223","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"pith_short_12","alias_value":"6VFBYS3R7N36","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6VFBYS3R7N36OORV","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6VFBYS3R","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:6VFBYS3R7N36OORVGGV26PV7TY","target":"record","payload":{"canonical_record":{"source":{"id":"1208.2223","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-08-10T17:16:53Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"de3357e872211175110824f01368d2f9efcaa5b9bffae7362b8b67662cecbac5","abstract_canon_sha256":"2acceef309bf74058de3b4157b191b95a4f40fabb36fdfb62315c68fcdcdef61"},"schema_version":"1.0"},"canonical_sha256":"f54a1c4b71fb77e73a3531abaf3ebf9e04305cc5b703af377341538e5d4704cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:26.111797Z","signature_b64":"WhL1jWx51lfTDqxIyYNVxGTAMWM4ZP5nWJgK2mpz3afR3Ea+GoOJ81IYCW3qNlHohvjqBDncBoeUckh32cNhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f54a1c4b71fb77e73a3531abaf3ebf9e04305cc5b703af377341538e5d4704cd","last_reissued_at":"2026-05-18T03:25:26.111288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:26.111288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.2223","source_version":3,"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:25:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EkxSAVp7Yutu4rsakE7JQ4y7lEs0TFHMhQugwQAQnNC0Wz6MDRrbsdMoqrNEU9LrXgyNBveOdoN7dkgsx4muDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:06:36.659909Z"},"content_sha256":"0e3c902b3078536b675f1c30b019a6455f6cafe522978a46b363d62de8024af5","schema_version":"1.0","event_id":"sha256:0e3c902b3078536b675f1c30b019a6455f6cafe522978a46b363d62de8024af5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:6VFBYS3R7N36OORVGGV26PV7TY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structured Recursive Separator Decompositions for Planar Graphs in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Christian Sommer, Philip N. Klein, Shay Mozes","submitted_at":"2012-08-10T17:16:53Z","abstract_excerpt":"Given a planar graph G on n vertices and an integer parameter r<n, an r-division of G with few holes is a decomposition of G into O(n/r) regions of size at most r such that each region contains at most a constant number of faces that are not faces of G (also called holes), and such that, for each region, the total number of vertices on these faces is O(sqrt r).\n  We provide a linear-time algorithm for computing r-divisions with few holes. In fact, our algorithm computes a structure, called decomposition tree, which represents a recursive decomposition of G that includes r-divisions for essenti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2223","kind":"arxiv","version":3},"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:25:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EOETAD1U7gLF3WFQ/LzYL2Q4di5aqM++XLzuHtSeAI4Y/6i57qOM2+MRyRyp0gXO0tyJDr2DaY0MhzELiqJrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:06:36.660259Z"},"content_sha256":"e3d76bf3e1dfaade3b48f8f00d34679a1b7b12dcb561a8337e91cbf12b23967f","schema_version":"1.0","event_id":"sha256:e3d76bf3e1dfaade3b48f8f00d34679a1b7b12dcb561a8337e91cbf12b23967f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6VFBYS3R7N36OORVGGV26PV7TY/bundle.json","state_url":"https://pith.science/pith/6VFBYS3R7N36OORVGGV26PV7TY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6VFBYS3R7N36OORVGGV26PV7TY/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-03T16:06:36Z","links":{"resolver":"https://pith.science/pith/6VFBYS3R7N36OORVGGV26PV7TY","bundle":"https://pith.science/pith/6VFBYS3R7N36OORVGGV26PV7TY/bundle.json","state":"https://pith.science/pith/6VFBYS3R7N36OORVGGV26PV7TY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6VFBYS3R7N36OORVGGV26PV7TY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6VFBYS3R7N36OORVGGV26PV7TY","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":"2acceef309bf74058de3b4157b191b95a4f40fabb36fdfb62315c68fcdcdef61","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-08-10T17:16:53Z","title_canon_sha256":"de3357e872211175110824f01368d2f9efcaa5b9bffae7362b8b67662cecbac5"},"schema_version":"1.0","source":{"id":"1208.2223","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.2223","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"arxiv_version","alias_value":"1208.2223v3","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2223","created_at":"2026-05-18T03:25:26Z"},{"alias_kind":"pith_short_12","alias_value":"6VFBYS3R7N36","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6VFBYS3R7N36OORV","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6VFBYS3R","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:e3d76bf3e1dfaade3b48f8f00d34679a1b7b12dcb561a8337e91cbf12b23967f","target":"graph","created_at":"2026-05-18T03:25:26Z","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":"Given a planar graph G on n vertices and an integer parameter r<n, an r-division of G with few holes is a decomposition of G into O(n/r) regions of size at most r such that each region contains at most a constant number of faces that are not faces of G (also called holes), and such that, for each region, the total number of vertices on these faces is O(sqrt r).\n  We provide a linear-time algorithm for computing r-divisions with few holes. In fact, our algorithm computes a structure, called decomposition tree, which represents a recursive decomposition of G that includes r-divisions for essenti","authors_text":"Christian Sommer, Philip N. Klein, Shay Mozes","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-08-10T17:16:53Z","title":"Structured Recursive Separator Decompositions for Planar Graphs in Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2223","kind":"arxiv","version":3},"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:0e3c902b3078536b675f1c30b019a6455f6cafe522978a46b363d62de8024af5","target":"record","created_at":"2026-05-18T03:25:26Z","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":"2acceef309bf74058de3b4157b191b95a4f40fabb36fdfb62315c68fcdcdef61","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-08-10T17:16:53Z","title_canon_sha256":"de3357e872211175110824f01368d2f9efcaa5b9bffae7362b8b67662cecbac5"},"schema_version":"1.0","source":{"id":"1208.2223","kind":"arxiv","version":3}},"canonical_sha256":"f54a1c4b71fb77e73a3531abaf3ebf9e04305cc5b703af377341538e5d4704cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f54a1c4b71fb77e73a3531abaf3ebf9e04305cc5b703af377341538e5d4704cd","first_computed_at":"2026-05-18T03:25:26.111288Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:26.111288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WhL1jWx51lfTDqxIyYNVxGTAMWM4ZP5nWJgK2mpz3afR3Ea+GoOJ81IYCW3qNlHohvjqBDncBoeUckh32cNhAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:26.111797Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.2223","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e3c902b3078536b675f1c30b019a6455f6cafe522978a46b363d62de8024af5","sha256:e3d76bf3e1dfaade3b48f8f00d34679a1b7b12dcb561a8337e91cbf12b23967f"],"state_sha256":"1cd18c00ff71fab53a47148855caa8007a83eb5f742bae185cf8f7e134372fd4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DBSq6lfS5MHRCeny2IKV/2g3xvHXZpPF7QfKr6k2m/zBSdrjXcLvNgramrLm+AHT5J/LOar7Yh9xIrw8k+aICg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:06:36.662216Z","bundle_sha256":"40d262921407956464bca455b2c1fb772a8e1025327ef5f3cbb3c09b8e3f09e0"}}