{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:7GPTSZASAMNYZYYEZNPDSVOLEE","short_pith_number":"pith:7GPTSZAS","schema_version":"1.0","canonical_sha256":"f99f396412031b8ce304cb5e3955cb213f7f5d76b5cbba63619e7b05256702b6","source":{"kind":"arxiv","id":"1007.1733","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1007.1733","created_at":"2026-05-18T04:06:46.302547+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.1733v3","created_at":"2026-05-18T04:06:46.302547+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1733","created_at":"2026-05-18T04:06:46.302547+00:00"},{"alias_kind":"pith_short_12","alias_value":"7GPTSZASAMNY","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"7GPTSZASAMNYZYYE","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"7GPTSZAS","created_at":"2026-05-18T12:26:04.259169+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/7GPTSZASAMNYZYYEZNPDSVOLEE","json":"https://pith.science/pith/7GPTSZASAMNYZYYEZNPDSVOLEE.json","graph_json":"https://pith.science/api/pith-number/7GPTSZASAMNYZYYEZNPDSVOLEE/graph.json","events_json":"https://pith.science/api/pith-number/7GPTSZASAMNYZYYEZNPDSVOLEE/events.json","paper":"https://pith.science/paper/7GPTSZAS"},"agent_actions":{"view_html":"https://pith.science/pith/7GPTSZASAMNYZYYEZNPDSVOLEE","download_json":"https://pith.science/pith/7GPTSZASAMNYZYYEZNPDSVOLEE.json","view_paper":"https://pith.science/paper/7GPTSZAS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.1733&json=true","fetch_graph":"https://pith.science/api/pith-number/7GPTSZASAMNYZYYEZNPDSVOLEE/graph.json","fetch_events":"https://pith.science/api/pith-number/7GPTSZASAMNYZYYEZNPDSVOLEE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7GPTSZASAMNYZYYEZNPDSVOLEE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7GPTSZASAMNYZYYEZNPDSVOLEE/action/storage_attestation","attest_author":"https://pith.science/pith/7GPTSZASAMNYZYYEZNPDSVOLEE/action/author_attestation","sign_citation":"https://pith.science/pith/7GPTSZASAMNYZYYEZNPDSVOLEE/action/citation_signature","submit_replication":"https://pith.science/pith/7GPTSZASAMNYZYYEZNPDSVOLEE/action/replication_record"}},"created_at":"2026-05-18T04:06:46.302547+00:00","updated_at":"2026-05-18T04:06:46.302547+00:00"}