{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KNQ7HDG4JYBBPC256STOYYKBMB","short_pith_number":"pith:KNQ7HDG4","schema_version":"1.0","canonical_sha256":"5361f38cdc4e02178b5df4a6ec61416048e6d4804a8f7e87be98441ebe60cb0d","source":{"kind":"arxiv","id":"1602.02863","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.02863","created_at":"2026-05-18T01:21:07.945955+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.02863v1","created_at":"2026-05-18T01:21:07.945955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02863","created_at":"2026-05-18T01:21:07.945955+00:00"},{"alias_kind":"pith_short_12","alias_value":"KNQ7HDG4JYBB","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KNQ7HDG4JYBBPC25","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KNQ7HDG4","created_at":"2026-05-18T12:30:25.849896+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/KNQ7HDG4JYBBPC256STOYYKBMB","json":"https://pith.science/pith/KNQ7HDG4JYBBPC256STOYYKBMB.json","graph_json":"https://pith.science/api/pith-number/KNQ7HDG4JYBBPC256STOYYKBMB/graph.json","events_json":"https://pith.science/api/pith-number/KNQ7HDG4JYBBPC256STOYYKBMB/events.json","paper":"https://pith.science/paper/KNQ7HDG4"},"agent_actions":{"view_html":"https://pith.science/pith/KNQ7HDG4JYBBPC256STOYYKBMB","download_json":"https://pith.science/pith/KNQ7HDG4JYBBPC256STOYYKBMB.json","view_paper":"https://pith.science/paper/KNQ7HDG4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.02863&json=true","fetch_graph":"https://pith.science/api/pith-number/KNQ7HDG4JYBBPC256STOYYKBMB/graph.json","fetch_events":"https://pith.science/api/pith-number/KNQ7HDG4JYBBPC256STOYYKBMB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KNQ7HDG4JYBBPC256STOYYKBMB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KNQ7HDG4JYBBPC256STOYYKBMB/action/storage_attestation","attest_author":"https://pith.science/pith/KNQ7HDG4JYBBPC256STOYYKBMB/action/author_attestation","sign_citation":"https://pith.science/pith/KNQ7HDG4JYBBPC256STOYYKBMB/action/citation_signature","submit_replication":"https://pith.science/pith/KNQ7HDG4JYBBPC256STOYYKBMB/action/replication_record"}},"created_at":"2026-05-18T01:21:07.945955+00:00","updated_at":"2026-05-18T01:21:07.945955+00:00"}