{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:D35L45WIMZUT6PHMSBIDXJO2SB","short_pith_number":"pith:D35L45WI","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"},"canonical_sha256":"1efabe76c866693f3cec90503ba5da906709e4c24cd8d6949f47f96edf69f9bb","source":{"kind":"arxiv","id":"1309.3825","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3825","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3825v1","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3825","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"pith_short_12","alias_value":"D35L45WIMZUT","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"D35L45WIMZUT6PHM","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"D35L45WI","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:D35L45WIMZUT6PHMSBIDXJO2SB","target":"record","payload":{"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"},"canonical_sha256":"1efabe76c866693f3cec90503ba5da906709e4c24cd8d6949f47f96edf69f9bb","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"},"source_kind":"arxiv","source_id":"1309.3825","source_version":1,"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-18T03:13:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/z2eS1lWe/Aw14c5h7/2SJI5yi3spggDQm98xuZaQcSFXBe9Gf8r46nnk1ncfeN1MhjyH4+UOVTdO2OgLcjWBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:47:08.706406Z"},"content_sha256":"9c76d697e7aae7528761f5212d9707f0ae5c8b9b3d3dd934a985f2eda01364e9","schema_version":"1.0","event_id":"sha256:9c76d697e7aae7528761f5212d9707f0ae5c8b9b3d3dd934a985f2eda01364e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:D35L45WIMZUT6PHMSBIDXJO2SB","target":"graph","payload":{"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"},"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-18T03:13:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1YZi9fNLoYcrIh2Zxam/Y7EPGXODHVvs5CN4vDWgNeDqk9EOgrV29UQKpd/Huy87DPaTHNxwMDsvDlAsCBv4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:47:08.706754Z"},"content_sha256":"17873aae8807433793f4a52ad1d7ece268d21aceec7458b7210b7d374f4647d3","schema_version":"1.0","event_id":"sha256:17873aae8807433793f4a52ad1d7ece268d21aceec7458b7210b7d374f4647d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D35L45WIMZUT6PHMSBIDXJO2SB/bundle.json","state_url":"https://pith.science/pith/D35L45WIMZUT6PHMSBIDXJO2SB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D35L45WIMZUT6PHMSBIDXJO2SB/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-06-03T17:47:08Z","links":{"resolver":"https://pith.science/pith/D35L45WIMZUT6PHMSBIDXJO2SB","bundle":"https://pith.science/pith/D35L45WIMZUT6PHMSBIDXJO2SB/bundle.json","state":"https://pith.science/pith/D35L45WIMZUT6PHMSBIDXJO2SB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D35L45WIMZUT6PHMSBIDXJO2SB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:D35L45WIMZUT6PHMSBIDXJO2SB","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":"91403cd1232a8b19dba5f77d8cf1674b3a36e2b7d5a5d460a71b4d62ad531f2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-16T03:53:13Z","title_canon_sha256":"7d4ed2c487c8b220ec9e96b6c586ec97426f0a9f4becd5271f2f329a4d0314db"},"schema_version":"1.0","source":{"id":"1309.3825","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3825","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3825v1","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3825","created_at":"2026-05-18T03:13:20Z"},{"alias_kind":"pith_short_12","alias_value":"D35L45WIMZUT","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"D35L45WIMZUT6PHM","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"D35L45WI","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:17873aae8807433793f4a52ad1d7ece268d21aceec7458b7210b7d374f4647d3","target":"graph","created_at":"2026-05-18T03:13:20Z","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":"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","authors_text":"Changqiao Xu, Hongke Zhang, Jianfeng Guan, Jia Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-16T03:53:13Z","title":"Packing $(2^{k+1}-1)$-order perfect binary trees into (\\emph{k}+1)-connected graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3825","kind":"arxiv","version":1},"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:9c76d697e7aae7528761f5212d9707f0ae5c8b9b3d3dd934a985f2eda01364e9","target":"record","created_at":"2026-05-18T03:13:20Z","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":"91403cd1232a8b19dba5f77d8cf1674b3a36e2b7d5a5d460a71b4d62ad531f2d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-16T03:53:13Z","title_canon_sha256":"7d4ed2c487c8b220ec9e96b6c586ec97426f0a9f4becd5271f2f329a4d0314db"},"schema_version":"1.0","source":{"id":"1309.3825","kind":"arxiv","version":1}},"canonical_sha256":"1efabe76c866693f3cec90503ba5da906709e4c24cd8d6949f47f96edf69f9bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1efabe76c866693f3cec90503ba5da906709e4c24cd8d6949f47f96edf69f9bb","first_computed_at":"2026-05-18T03:13:20.458607Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:20.458607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CS/3mY0xDEte8Xlchjhp293DgDQBUvRl3pC9g4Z+wBp6OnhI5iAEocoEijphHYwq0friEX7scl31QSfezruzBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:20.459109Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.3825","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c76d697e7aae7528761f5212d9707f0ae5c8b9b3d3dd934a985f2eda01364e9","sha256:17873aae8807433793f4a52ad1d7ece268d21aceec7458b7210b7d374f4647d3"],"state_sha256":"001091b5a35daacbae857368a17d5edaf6ad9222dd2df30a4537d8618a728115"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CbEKskv62yeNv1pGBDyYp411fHYpkU2FTtLqEbRVd4jXakI0mYJmCIDwACeAXuPxifVsGGmPxJJm0tSmLdhAAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:47:08.708756Z","bundle_sha256":"006d8917fd4681c1ffc5050ffa0d9410938f74b0e7ff8dbd3367439f79cce9c7"}}