{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:7GPTSZASAMNYZYYEZNPDSVOLEE","short_pith_number":"pith:7GPTSZAS","canonical_record":{"source":{"id":"1007.1733","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-10T17:03:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"420f6e68458c9dfbe202e963a88f7d4bcb0419df152b1b46fa02a77329df32e6","abstract_canon_sha256":"0291085bec456680223fc12daf7e05e0c78781584daf95655c4485570cf106ca"},"schema_version":"1.0"},"canonical_sha256":"f99f396412031b8ce304cb5e3955cb213f7f5d76b5cbba63619e7b05256702b6","source":{"kind":"arxiv","id":"1007.1733","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.1733","created_at":"2026-05-18T04:06:46Z"},{"alias_kind":"arxiv_version","alias_value":"1007.1733v3","created_at":"2026-05-18T04:06:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1733","created_at":"2026-05-18T04:06:46Z"},{"alias_kind":"pith_short_12","alias_value":"7GPTSZASAMNY","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"7GPTSZASAMNYZYYE","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"7GPTSZAS","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:7GPTSZASAMNYZYYEZNPDSVOLEE","target":"record","payload":{"canonical_record":{"source":{"id":"1007.1733","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-10T17:03:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"420f6e68458c9dfbe202e963a88f7d4bcb0419df152b1b46fa02a77329df32e6","abstract_canon_sha256":"0291085bec456680223fc12daf7e05e0c78781584daf95655c4485570cf106ca"},"schema_version":"1.0"},"canonical_sha256":"f99f396412031b8ce304cb5e3955cb213f7f5d76b5cbba63619e7b05256702b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:46.303098Z","signature_b64":"uGR+m0/gsys+NZZvrGVAcrl0GtvkxeCgRjeFUc/mLFtXHj9LxLJ0rzrvQ6MOBnLA63PFrUgRJ/Nz2dmrERfhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f99f396412031b8ce304cb5e3955cb213f7f5d76b5cbba63619e7b05256702b6","last_reissued_at":"2026-05-18T04:06:46.302419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:46.302419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.1733","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-18T04:06:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mgtsb/k8RFfqEdHpILuDHR1ZJExU3RKEJcsv8P8FPNDoooUEXw3I25YjFkjph7KKmpp23btDlIxmDIUZMGITAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T02:29:03.198670Z"},"content_sha256":"b891d81d8cb6db0d4de0dcace5e34e7cc8190717b3912aa549d82c90c032acef","schema_version":"1.0","event_id":"sha256:b891d81d8cb6db0d4de0dcace5e34e7cc8190717b3912aa549d82c90c032acef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:7GPTSZASAMNYZYYEZNPDSVOLEE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of Splits Reconstruction for Low-Degree Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Karol Suchan, Mathieu Liedloff, Maya Stein, Serge Gaspers","submitted_at":"2010-07-10T17:03:16Z","abstract_excerpt":"Given a vertex-weighted tree T, the split of an edge xy in T is min{s_x(xy), s_y(xy)} where s_u(uv) is the sum of all weights of vertices that are closer to u than to v in T. Given a set of weighted vertices V and a multiset of splits S, we consider the problem of constructing a tree on V whose splits correspond to S. The problem is known to be NP-complete, even when all vertices have unit weight and the maximum vertex degree of T is required to be no more than 4. We show that the problem is strongly NP-complete when T is required to be a path, the problem is NP-complete when all vertices have"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1733","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-18T04:06:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uVzSgalUP3atoXFCsRsqWQrJoFcN2st7BIulBcMmEsYeqbFaHYhXLatyKwFn/H2esStjSCa34f1I2Wl7KFxJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T02:29:03.199024Z"},"content_sha256":"66bea450fd12cd69f2c7cafac711c06f9a9fb29baf5a9b19fea58ad146ed97bf","schema_version":"1.0","event_id":"sha256:66bea450fd12cd69f2c7cafac711c06f9a9fb29baf5a9b19fea58ad146ed97bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7GPTSZASAMNYZYYEZNPDSVOLEE/bundle.json","state_url":"https://pith.science/pith/7GPTSZASAMNYZYYEZNPDSVOLEE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7GPTSZASAMNYZYYEZNPDSVOLEE/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-07-04T02:29:03Z","links":{"resolver":"https://pith.science/pith/7GPTSZASAMNYZYYEZNPDSVOLEE","bundle":"https://pith.science/pith/7GPTSZASAMNYZYYEZNPDSVOLEE/bundle.json","state":"https://pith.science/pith/7GPTSZASAMNYZYYEZNPDSVOLEE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7GPTSZASAMNYZYYEZNPDSVOLEE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:7GPTSZASAMNYZYYEZNPDSVOLEE","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":"0291085bec456680223fc12daf7e05e0c78781584daf95655c4485570cf106ca","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-10T17:03:16Z","title_canon_sha256":"420f6e68458c9dfbe202e963a88f7d4bcb0419df152b1b46fa02a77329df32e6"},"schema_version":"1.0","source":{"id":"1007.1733","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.1733","created_at":"2026-05-18T04:06:46Z"},{"alias_kind":"arxiv_version","alias_value":"1007.1733v3","created_at":"2026-05-18T04:06:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1733","created_at":"2026-05-18T04:06:46Z"},{"alias_kind":"pith_short_12","alias_value":"7GPTSZASAMNY","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"7GPTSZASAMNYZYYE","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"7GPTSZAS","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:66bea450fd12cd69f2c7cafac711c06f9a9fb29baf5a9b19fea58ad146ed97bf","target":"graph","created_at":"2026-05-18T04:06:46Z","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 vertex-weighted tree T, the split of an edge xy in T is min{s_x(xy), s_y(xy)} where s_u(uv) is the sum of all weights of vertices that are closer to u than to v in T. Given a set of weighted vertices V and a multiset of splits S, we consider the problem of constructing a tree on V whose splits correspond to S. The problem is known to be NP-complete, even when all vertices have unit weight and the maximum vertex degree of T is required to be no more than 4. We show that the problem is strongly NP-complete when T is required to be a path, the problem is NP-complete when all vertices have","authors_text":"Karol Suchan, Mathieu Liedloff, Maya Stein, Serge Gaspers","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-10T17:03:16Z","title":"Complexity of Splits Reconstruction for Low-Degree Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1733","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:b891d81d8cb6db0d4de0dcace5e34e7cc8190717b3912aa549d82c90c032acef","target":"record","created_at":"2026-05-18T04:06:46Z","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":"0291085bec456680223fc12daf7e05e0c78781584daf95655c4485570cf106ca","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-10T17:03:16Z","title_canon_sha256":"420f6e68458c9dfbe202e963a88f7d4bcb0419df152b1b46fa02a77329df32e6"},"schema_version":"1.0","source":{"id":"1007.1733","kind":"arxiv","version":3}},"canonical_sha256":"f99f396412031b8ce304cb5e3955cb213f7f5d76b5cbba63619e7b05256702b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f99f396412031b8ce304cb5e3955cb213f7f5d76b5cbba63619e7b05256702b6","first_computed_at":"2026-05-18T04:06:46.302419Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:46.302419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uGR+m0/gsys+NZZvrGVAcrl0GtvkxeCgRjeFUc/mLFtXHj9LxLJ0rzrvQ6MOBnLA63PFrUgRJ/Nz2dmrERfhCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:46.303098Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.1733","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b891d81d8cb6db0d4de0dcace5e34e7cc8190717b3912aa549d82c90c032acef","sha256:66bea450fd12cd69f2c7cafac711c06f9a9fb29baf5a9b19fea58ad146ed97bf"],"state_sha256":"5b64267779c6166dfe86f5130148975044f26382947e5527da39e3d36f280150"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PZYzhcZ2Ld5XTZKZdABqQluvMNTP1QJ6RZGuxy4LsyEaKCurvW66i4xWgXvbwbHsvaBA5d3Ctb2GrL5SVeOODw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T02:29:03.200950Z","bundle_sha256":"239fdc31d1d87121d9b9c2d88d9d39b20abbc72457196cc7ec8730d9c9114fd4"}}