{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:D35L45WIMZUT6PHMSBIDXJO2SB","short_pith_number":"pith:D35L45WI","schema_version":"1.0","canonical_sha256":"1efabe76c866693f3cec90503ba5da906709e4c24cd8d6949f47f96edf69f9bb","source":{"kind":"arxiv","id":"1309.3825","version":1},"attestation_state":"computed","paper":{"title":"Packing $(2^{k+1}-1)$-order perfect binary trees into (\\emph{k}+1)-connected graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Changqiao Xu, Hongke Zhang, Jianfeng Guan, Jia Zhao","submitted_at":"2013-09-16T03:53:13Z","abstract_excerpt":"Let $G=(V,E)$ and $H$ be two graphs. Packing problem is to find in $G$ the largest number of independent subgraphs each of which is isomorphic to $H$. Let $U\\subset{V}$. If the graph $G-U$ has no subgraph isomorphic to $H$, $U$ is a cover of $G$. Covering problem is to find the smallest set $U$. The vertex-disjoint tree packing was not sufficiently discussed in literature but has its applications in data encryption and in communication networks such as multi-cast routing protocol design. In this paper, we give the kind of $(k+1)$-connected graph $G'$ into which we can pack independently the su"},"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":"1309.3825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-16T03:53:13Z","cross_cats_sorted":[],"title_canon_sha256":"7d4ed2c487c8b220ec9e96b6c586ec97426f0a9f4becd5271f2f329a4d0314db","abstract_canon_sha256":"91403cd1232a8b19dba5f77d8cf1674b3a36e2b7d5a5d460a71b4d62ad531f2d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:20.459109Z","signature_b64":"CS/3mY0xDEte8Xlchjhp293DgDQBUvRl3pC9g4Z+wBp6OnhI5iAEocoEijphHYwq0friEX7scl31QSfezruzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1efabe76c866693f3cec90503ba5da906709e4c24cd8d6949f47f96edf69f9bb","last_reissued_at":"2026-05-18T03:13:20.458607Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:20.458607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Packing $(2^{k+1}-1)$-order perfect binary trees into (\\emph{k}+1)-connected graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Changqiao Xu, Hongke Zhang, Jianfeng Guan, Jia Zhao","submitted_at":"2013-09-16T03:53:13Z","abstract_excerpt":"Let $G=(V,E)$ and $H$ be two graphs. Packing problem is to find in $G$ the largest number of independent subgraphs each of which is isomorphic to $H$. Let $U\\subset{V}$. If the graph $G-U$ has no subgraph isomorphic to $H$, $U$ is a cover of $G$. Covering problem is to find the smallest set $U$. The vertex-disjoint tree packing was not sufficiently discussed in literature but has its applications in data encryption and in communication networks such as multi-cast routing protocol design. In this paper, we give the kind of $(k+1)$-connected graph $G'$ into which we can pack independently the su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3825","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":"1309.3825","created_at":"2026-05-18T03:13:20.458696+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.3825v1","created_at":"2026-05-18T03:13:20.458696+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3825","created_at":"2026-05-18T03:13:20.458696+00:00"},{"alias_kind":"pith_short_12","alias_value":"D35L45WIMZUT","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"D35L45WIMZUT6PHM","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"D35L45WI","created_at":"2026-05-18T12:27:40.988391+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/D35L45WIMZUT6PHMSBIDXJO2SB","json":"https://pith.science/pith/D35L45WIMZUT6PHMSBIDXJO2SB.json","graph_json":"https://pith.science/api/pith-number/D35L45WIMZUT6PHMSBIDXJO2SB/graph.json","events_json":"https://pith.science/api/pith-number/D35L45WIMZUT6PHMSBIDXJO2SB/events.json","paper":"https://pith.science/paper/D35L45WI"},"agent_actions":{"view_html":"https://pith.science/pith/D35L45WIMZUT6PHMSBIDXJO2SB","download_json":"https://pith.science/pith/D35L45WIMZUT6PHMSBIDXJO2SB.json","view_paper":"https://pith.science/paper/D35L45WI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.3825&json=true","fetch_graph":"https://pith.science/api/pith-number/D35L45WIMZUT6PHMSBIDXJO2SB/graph.json","fetch_events":"https://pith.science/api/pith-number/D35L45WIMZUT6PHMSBIDXJO2SB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D35L45WIMZUT6PHMSBIDXJO2SB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D35L45WIMZUT6PHMSBIDXJO2SB/action/storage_attestation","attest_author":"https://pith.science/pith/D35L45WIMZUT6PHMSBIDXJO2SB/action/author_attestation","sign_citation":"https://pith.science/pith/D35L45WIMZUT6PHMSBIDXJO2SB/action/citation_signature","submit_replication":"https://pith.science/pith/D35L45WIMZUT6PHMSBIDXJO2SB/action/replication_record"}},"created_at":"2026-05-18T03:13:20.458696+00:00","updated_at":"2026-05-18T03:13:20.458696+00:00"}