{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KETFWYMB3GTDGWW2AUH56SXYNY","short_pith_number":"pith:KETFWYMB","canonical_record":{"source":{"id":"1807.03479","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-10T04:49:51Z","cross_cats_sorted":[],"title_canon_sha256":"0d2edef5516d83367d71e68ece169f01792cfad99df7966bae54bd9707ef9a4a","abstract_canon_sha256":"716171b92c10285ddec5b4dc23f01f6cd3c1189c71ed092cd23cbe5f8889c83c"},"schema_version":"1.0"},"canonical_sha256":"51265b6181d9a6335ada050fdf4af86e3d2dd35f328c02727b9bbf6c3c68b763","source":{"kind":"arxiv","id":"1807.03479","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03479","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03479v1","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03479","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"KETFWYMB3GTD","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KETFWYMB3GTDGWW2","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KETFWYMB","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KETFWYMB3GTDGWW2AUH56SXYNY","target":"record","payload":{"canonical_record":{"source":{"id":"1807.03479","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-10T04:49:51Z","cross_cats_sorted":[],"title_canon_sha256":"0d2edef5516d83367d71e68ece169f01792cfad99df7966bae54bd9707ef9a4a","abstract_canon_sha256":"716171b92c10285ddec5b4dc23f01f6cd3c1189c71ed092cd23cbe5f8889c83c"},"schema_version":"1.0"},"canonical_sha256":"51265b6181d9a6335ada050fdf4af86e3d2dd35f328c02727b9bbf6c3c68b763","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:10.323961Z","signature_b64":"mdcoeq/o+blpbw8hv4qzK26elReSa3CDOBN9irok+wApTMgCFtcLGO38xyLgZaCSRVxRqS88BLpcZP/9knIpAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51265b6181d9a6335ada050fdf4af86e3d2dd35f328c02727b9bbf6c3c68b763","last_reissued_at":"2026-05-18T00:11:10.323117Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:10.323117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.03479","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-18T00:11:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rehjUfrNqXqYigS4gaX137WaThlWfOAnXg8RchsjNDw7gDOsZAPpUMscefU0+awPm+AfswfEW3fId6wBK3dOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:23:50.801214Z"},"content_sha256":"edbb20c633cc03160b1d0a240ab978e9779f6f9be69aa344ed899e2974fb926b","schema_version":"1.0","event_id":"sha256:edbb20c633cc03160b1d0a240ab978e9779f6f9be69aa344ed899e2974fb926b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KETFWYMB3GTDGWW2AUH56SXYNY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Reassembling of Three-Regular Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Assaf Kfoury, Benjamin Sisson","submitted_at":"2018-07-10T04:49:51Z","abstract_excerpt":"A reassembling of a simple graph G = (V,E) is an abstraction of a problem arising in earlier studies of network analysis. There are several equivalent definitions of graph reassembling; in this report we use a definition which makes it closest to the notion of graph carving. A reassembling is a rooted binary tree whose nodes are subsets of V and whose leaf nodes are singleton sets, with each of the latter containing a distinct vertex of G. The parent of two nodes in the reassembling is the union of the two children's vertex sets. The root node of the reassembling is the full set V. The edge-bo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03479","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-18T00:11:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rjGqtp7tik6kxDj0QT/hpwJub5CRSYtf/l3+8xJmKuf1q216093sPVf/rdvrrpQa1tiF01YgrLr9awtk9PBtCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:23:50.801686Z"},"content_sha256":"d7d3d66b687025a79151569d09d0b34e4bc0e01ef1d4b7dbf608ef03f79afa1a","schema_version":"1.0","event_id":"sha256:d7d3d66b687025a79151569d09d0b34e4bc0e01ef1d4b7dbf608ef03f79afa1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KETFWYMB3GTDGWW2AUH56SXYNY/bundle.json","state_url":"https://pith.science/pith/KETFWYMB3GTDGWW2AUH56SXYNY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KETFWYMB3GTDGWW2AUH56SXYNY/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-11T20:23:50Z","links":{"resolver":"https://pith.science/pith/KETFWYMB3GTDGWW2AUH56SXYNY","bundle":"https://pith.science/pith/KETFWYMB3GTDGWW2AUH56SXYNY/bundle.json","state":"https://pith.science/pith/KETFWYMB3GTDGWW2AUH56SXYNY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KETFWYMB3GTDGWW2AUH56SXYNY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KETFWYMB3GTDGWW2AUH56SXYNY","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":"716171b92c10285ddec5b4dc23f01f6cd3c1189c71ed092cd23cbe5f8889c83c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-10T04:49:51Z","title_canon_sha256":"0d2edef5516d83367d71e68ece169f01792cfad99df7966bae54bd9707ef9a4a"},"schema_version":"1.0","source":{"id":"1807.03479","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03479","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03479v1","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03479","created_at":"2026-05-18T00:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"KETFWYMB3GTD","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KETFWYMB3GTDGWW2","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KETFWYMB","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:d7d3d66b687025a79151569d09d0b34e4bc0e01ef1d4b7dbf608ef03f79afa1a","target":"graph","created_at":"2026-05-18T00:11:10Z","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":"A reassembling of a simple graph G = (V,E) is an abstraction of a problem arising in earlier studies of network analysis. There are several equivalent definitions of graph reassembling; in this report we use a definition which makes it closest to the notion of graph carving. A reassembling is a rooted binary tree whose nodes are subsets of V and whose leaf nodes are singleton sets, with each of the latter containing a distinct vertex of G. The parent of two nodes in the reassembling is the union of the two children's vertex sets. The root node of the reassembling is the full set V. The edge-bo","authors_text":"Assaf Kfoury, Benjamin Sisson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-10T04:49:51Z","title":"Efficient Reassembling of Three-Regular Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03479","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:edbb20c633cc03160b1d0a240ab978e9779f6f9be69aa344ed899e2974fb926b","target":"record","created_at":"2026-05-18T00:11:10Z","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":"716171b92c10285ddec5b4dc23f01f6cd3c1189c71ed092cd23cbe5f8889c83c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-10T04:49:51Z","title_canon_sha256":"0d2edef5516d83367d71e68ece169f01792cfad99df7966bae54bd9707ef9a4a"},"schema_version":"1.0","source":{"id":"1807.03479","kind":"arxiv","version":1}},"canonical_sha256":"51265b6181d9a6335ada050fdf4af86e3d2dd35f328c02727b9bbf6c3c68b763","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51265b6181d9a6335ada050fdf4af86e3d2dd35f328c02727b9bbf6c3c68b763","first_computed_at":"2026-05-18T00:11:10.323117Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:10.323117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mdcoeq/o+blpbw8hv4qzK26elReSa3CDOBN9irok+wApTMgCFtcLGO38xyLgZaCSRVxRqS88BLpcZP/9knIpAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:10.323961Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.03479","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:edbb20c633cc03160b1d0a240ab978e9779f6f9be69aa344ed899e2974fb926b","sha256:d7d3d66b687025a79151569d09d0b34e4bc0e01ef1d4b7dbf608ef03f79afa1a"],"state_sha256":"1ba653747fed3519556e2cd0b6fa44ea83da9b541e7946bac7846094e80e65fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c6vn9FYFQBe1+uHCvhs/Sw3HemjQwJTDPAca3ErklFnb0j8cCE5h7P5bGJhHCFBIe+FdTWudGGuqUlTXubiuDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T20:23:50.805958Z","bundle_sha256":"2457da017bc1154ba714dc69dd1012457c56363d5e4d48f4934879cbaf35f5c2"}}