{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KNQ7HDG4JYBBPC256STOYYKBMB","short_pith_number":"pith:KNQ7HDG4","canonical_record":{"source":{"id":"1602.02863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-09T05:15:51Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a034cc3105e86e8fe30375def04b42449e6cf67e27f7a5a53928a0b993320da8","abstract_canon_sha256":"7681fc5f4f7374d239b319fc1522b2d8ee8f3f9e912f27fb61bc69eeb2ff3e80"},"schema_version":"1.0"},"canonical_sha256":"5361f38cdc4e02178b5df4a6ec61416048e6d4804a8f7e87be98441ebe60cb0d","source":{"kind":"arxiv","id":"1602.02863","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02863","created_at":"2026-05-18T01:21:07Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02863v1","created_at":"2026-05-18T01:21:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02863","created_at":"2026-05-18T01:21:07Z"},{"alias_kind":"pith_short_12","alias_value":"KNQ7HDG4JYBB","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KNQ7HDG4JYBBPC25","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KNQ7HDG4","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KNQ7HDG4JYBBPC256STOYYKBMB","target":"record","payload":{"canonical_record":{"source":{"id":"1602.02863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-09T05:15:51Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a034cc3105e86e8fe30375def04b42449e6cf67e27f7a5a53928a0b993320da8","abstract_canon_sha256":"7681fc5f4f7374d239b319fc1522b2d8ee8f3f9e912f27fb61bc69eeb2ff3e80"},"schema_version":"1.0"},"canonical_sha256":"5361f38cdc4e02178b5df4a6ec61416048e6d4804a8f7e87be98441ebe60cb0d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:07.946535Z","signature_b64":"1E0jm3KKst3r3hdlJk8uVX2oZokgmeaYJr9EXzV29dc/viy3iW0WpdYcDhZ6UYXZwvbVu0c7HKO4+NergJtzBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5361f38cdc4e02178b5df4a6ec61416048e6d4804a8f7e87be98441ebe60cb0d","last_reissued_at":"2026-05-18T01:21:07.945858Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:07.945858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.02863","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-18T01:21:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZwwSZunpiprFnJE6ZyMB2c8zj/CrTB07tRrWI5+Fv04/WKcjaKBEzroxDqRrXdVxrYWl7JPOjvwiMAqfk1cBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:43:29.230912Z"},"content_sha256":"fdc89c74c21dfe3d822c2b2b09751eb7edc5be410db76a8a7049f0b9ae59cda4","schema_version":"1.0","event_id":"sha256:fdc89c74c21dfe3d822c2b2b09751eb7edc5be410db76a8a7049f0b9ae59cda4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KNQ7HDG4JYBBPC256STOYYKBMB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Reassembling of Graphs, Part 2: The Balanced Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Assaf Kfoury, Saber Mirzaei","submitted_at":"2016-02-09T05:15:51Z","abstract_excerpt":"The reassembling of a simple connected graph G = (V,E) is an abstraction of a problem arising in earlier studies of network analysis. The reassembling process has a simple formulation (there are several equivalent formulations) relative to a binary tree B (reassembling tree), with root node at the top and $n$ leaf nodes at the bottom, where every cross-section corresponds to a partition of V such that:\n  - the bottom (or first) cross-section (all the leaves) is the finest partition of V with n one-vertex blocks,\n  - the top (or last) cross-section (the root) is the coarsest partition with a si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02863","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-18T01:21:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FfvaBJ9nqJF09kGggcoSGb4dFq5aYQmwt0pM7yCuOjxEFwr+AM4x74fwVMtrYzVMmQiyn2kjAwuFhZBfUO6qBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:43:29.231615Z"},"content_sha256":"ede33e1c076c53f69e3078cbbaf39e1da4c830cd717e546376ddcf161016bb55","schema_version":"1.0","event_id":"sha256:ede33e1c076c53f69e3078cbbaf39e1da4c830cd717e546376ddcf161016bb55"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KNQ7HDG4JYBBPC256STOYYKBMB/bundle.json","state_url":"https://pith.science/pith/KNQ7HDG4JYBBPC256STOYYKBMB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KNQ7HDG4JYBBPC256STOYYKBMB/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:43:29Z","links":{"resolver":"https://pith.science/pith/KNQ7HDG4JYBBPC256STOYYKBMB","bundle":"https://pith.science/pith/KNQ7HDG4JYBBPC256STOYYKBMB/bundle.json","state":"https://pith.science/pith/KNQ7HDG4JYBBPC256STOYYKBMB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KNQ7HDG4JYBBPC256STOYYKBMB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KNQ7HDG4JYBBPC256STOYYKBMB","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":"7681fc5f4f7374d239b319fc1522b2d8ee8f3f9e912f27fb61bc69eeb2ff3e80","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-09T05:15:51Z","title_canon_sha256":"a034cc3105e86e8fe30375def04b42449e6cf67e27f7a5a53928a0b993320da8"},"schema_version":"1.0","source":{"id":"1602.02863","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.02863","created_at":"2026-05-18T01:21:07Z"},{"alias_kind":"arxiv_version","alias_value":"1602.02863v1","created_at":"2026-05-18T01:21:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02863","created_at":"2026-05-18T01:21:07Z"},{"alias_kind":"pith_short_12","alias_value":"KNQ7HDG4JYBB","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KNQ7HDG4JYBBPC25","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KNQ7HDG4","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:ede33e1c076c53f69e3078cbbaf39e1da4c830cd717e546376ddcf161016bb55","target":"graph","created_at":"2026-05-18T01:21:07Z","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":"The reassembling of a simple connected graph G = (V,E) is an abstraction of a problem arising in earlier studies of network analysis. The reassembling process has a simple formulation (there are several equivalent formulations) relative to a binary tree B (reassembling tree), with root node at the top and $n$ leaf nodes at the bottom, where every cross-section corresponds to a partition of V such that:\n  - the bottom (or first) cross-section (all the leaves) is the finest partition of V with n one-vertex blocks,\n  - the top (or last) cross-section (the root) is the coarsest partition with a si","authors_text":"Assaf Kfoury, Saber Mirzaei","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-09T05:15:51Z","title":"Efficient Reassembling of Graphs, Part 2: The Balanced Case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02863","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:fdc89c74c21dfe3d822c2b2b09751eb7edc5be410db76a8a7049f0b9ae59cda4","target":"record","created_at":"2026-05-18T01:21:07Z","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":"7681fc5f4f7374d239b319fc1522b2d8ee8f3f9e912f27fb61bc69eeb2ff3e80","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-09T05:15:51Z","title_canon_sha256":"a034cc3105e86e8fe30375def04b42449e6cf67e27f7a5a53928a0b993320da8"},"schema_version":"1.0","source":{"id":"1602.02863","kind":"arxiv","version":1}},"canonical_sha256":"5361f38cdc4e02178b5df4a6ec61416048e6d4804a8f7e87be98441ebe60cb0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5361f38cdc4e02178b5df4a6ec61416048e6d4804a8f7e87be98441ebe60cb0d","first_computed_at":"2026-05-18T01:21:07.945858Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:07.945858Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1E0jm3KKst3r3hdlJk8uVX2oZokgmeaYJr9EXzV29dc/viy3iW0WpdYcDhZ6UYXZwvbVu0c7HKO4+NergJtzBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:07.946535Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.02863","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fdc89c74c21dfe3d822c2b2b09751eb7edc5be410db76a8a7049f0b9ae59cda4","sha256:ede33e1c076c53f69e3078cbbaf39e1da4c830cd717e546376ddcf161016bb55"],"state_sha256":"642f82b3d6b8a9acc3a3d8c722b54683d041b4ddfcf23423a1e12b533b7821d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0fIZT3tx9Us/U5QceBujlzTdUaWvoAqXv4xEakr4eFQ7EYiZtKGzjy06jG2UCjT+YGFlcRxY6o5a6J/mfCTKAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T20:43:29.235691Z","bundle_sha256":"96324bb1a3154bbda08420b982b7ddf7e216329a64b41f954e0787d82314085d"}}