{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZCJXWA4MDQNGZXSN65AIF7TF53","short_pith_number":"pith:ZCJXWA4M","schema_version":"1.0","canonical_sha256":"c8937b038c1c1a6cde4df74082fe65eef9e3ff2ad406e012750e4607c5c810a1","source":{"kind":"arxiv","id":"1704.03148","version":1},"attestation_state":"computed","paper":{"title":"Packing tree degree sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aravind Gollakota, Istvan Miklos, William Hardt","submitted_at":"2017-04-11T05:33:50Z","abstract_excerpt":"We consider packing tree degree sequences in this paper. We set up a conjecture that any arbitrary number of tree degree sequences without common leaves have edge disjoint tree realizations. This conjecture is known to be true for $2$ and $3$ tree degree sequences. In this paper, we give a proof for $4$ tree degree sequences and a computer aided proof for $5$ tree degree sequences. We also prove that for arbitrary $k$, $k$ tree degree sequences without common leaves and at least $2k-4$ vertices which are not leaves in any of the trees always have edge disjoint tree realizations. The main ingre"},"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":"1704.03148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-11T05:33:50Z","cross_cats_sorted":[],"title_canon_sha256":"ca843a7865c9a96cc7d5bff7fc3fa9cf2abfd85dfa32d78e92520f96fa596c71","abstract_canon_sha256":"4255a2c723154fbb0b02c10297c8e5702b01bfa6436fe2639b3448d547909e12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:33.411923Z","signature_b64":"nD7PhNFmVKXSNaCihDtBGhvZNaNeKhtdDCC74KSgf3qSmn4/URZ2wE7DjuR/faLZyNkp0jnw6RcEA5p0fH2DAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8937b038c1c1a6cde4df74082fe65eef9e3ff2ad406e012750e4607c5c810a1","last_reissued_at":"2026-05-18T00:46:33.411146Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:33.411146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Packing tree degree sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aravind Gollakota, Istvan Miklos, William Hardt","submitted_at":"2017-04-11T05:33:50Z","abstract_excerpt":"We consider packing tree degree sequences in this paper. We set up a conjecture that any arbitrary number of tree degree sequences without common leaves have edge disjoint tree realizations. This conjecture is known to be true for $2$ and $3$ tree degree sequences. In this paper, we give a proof for $4$ tree degree sequences and a computer aided proof for $5$ tree degree sequences. We also prove that for arbitrary $k$, $k$ tree degree sequences without common leaves and at least $2k-4$ vertices which are not leaves in any of the trees always have edge disjoint tree realizations. The main ingre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03148","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":"1704.03148","created_at":"2026-05-18T00:46:33.411281+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.03148v1","created_at":"2026-05-18T00:46:33.411281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03148","created_at":"2026-05-18T00:46:33.411281+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZCJXWA4MDQNG","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZCJXWA4MDQNGZXSN","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZCJXWA4M","created_at":"2026-05-18T12:31:59.375834+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/ZCJXWA4MDQNGZXSN65AIF7TF53","json":"https://pith.science/pith/ZCJXWA4MDQNGZXSN65AIF7TF53.json","graph_json":"https://pith.science/api/pith-number/ZCJXWA4MDQNGZXSN65AIF7TF53/graph.json","events_json":"https://pith.science/api/pith-number/ZCJXWA4MDQNGZXSN65AIF7TF53/events.json","paper":"https://pith.science/paper/ZCJXWA4M"},"agent_actions":{"view_html":"https://pith.science/pith/ZCJXWA4MDQNGZXSN65AIF7TF53","download_json":"https://pith.science/pith/ZCJXWA4MDQNGZXSN65AIF7TF53.json","view_paper":"https://pith.science/paper/ZCJXWA4M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.03148&json=true","fetch_graph":"https://pith.science/api/pith-number/ZCJXWA4MDQNGZXSN65AIF7TF53/graph.json","fetch_events":"https://pith.science/api/pith-number/ZCJXWA4MDQNGZXSN65AIF7TF53/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZCJXWA4MDQNGZXSN65AIF7TF53/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZCJXWA4MDQNGZXSN65AIF7TF53/action/storage_attestation","attest_author":"https://pith.science/pith/ZCJXWA4MDQNGZXSN65AIF7TF53/action/author_attestation","sign_citation":"https://pith.science/pith/ZCJXWA4MDQNGZXSN65AIF7TF53/action/citation_signature","submit_replication":"https://pith.science/pith/ZCJXWA4MDQNGZXSN65AIF7TF53/action/replication_record"}},"created_at":"2026-05-18T00:46:33.411281+00:00","updated_at":"2026-05-18T00:46:33.411281+00:00"}