{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:RNLENISQDVSGSQTCNINLABJYUD","short_pith_number":"pith:RNLENISQ","canonical_record":{"source":{"id":"1111.0706","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-03T01:16:09Z","cross_cats_sorted":[],"title_canon_sha256":"5c07bedbcaad00f48c8793e4e1e0f777a3bff0b8516e16ab0c1e04347b9806c7","abstract_canon_sha256":"6cb0b9c96d88078b7525202228c2c08d63b40501e6f870334fa32c395cabdcc2"},"schema_version":"1.0"},"canonical_sha256":"8b5646a2501d646942626a1ab00538a0de5167144aaff90cd26b44c231fbe12b","source":{"kind":"arxiv","id":"1111.0706","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0706","created_at":"2026-05-18T04:09:37Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0706v1","created_at":"2026-05-18T04:09:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0706","created_at":"2026-05-18T04:09:37Z"},{"alias_kind":"pith_short_12","alias_value":"RNLENISQDVSG","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RNLENISQDVSGSQTC","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RNLENISQ","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:RNLENISQDVSGSQTCNINLABJYUD","target":"record","payload":{"canonical_record":{"source":{"id":"1111.0706","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-03T01:16:09Z","cross_cats_sorted":[],"title_canon_sha256":"5c07bedbcaad00f48c8793e4e1e0f777a3bff0b8516e16ab0c1e04347b9806c7","abstract_canon_sha256":"6cb0b9c96d88078b7525202228c2c08d63b40501e6f870334fa32c395cabdcc2"},"schema_version":"1.0"},"canonical_sha256":"8b5646a2501d646942626a1ab00538a0de5167144aaff90cd26b44c231fbe12b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:37.084287Z","signature_b64":"2XO1BldKx1PjLVZJ6+LMP8xbnaO15sQb49uZsMA2suqctmLG5XKc7xqYt27uY3C4Tbpfki7twOK2BZrPt2b2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b5646a2501d646942626a1ab00538a0de5167144aaff90cd26b44c231fbe12b","last_reissued_at":"2026-05-18T04:09:37.083713Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:37.083713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.0706","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-18T04:09:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2bvfwP0oQowAg8E8xoxNfKx8MNwx2WOP4auKBHtmADXijvKEBRv3tHmbV1a9LI/l4nhLdBlzP89M6Hi6cqvfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:43:32.459878Z"},"content_sha256":"a5824b68f9fbc40f07cd90aeac735c6b8bce32223b884af0cc547a3d22558397","schema_version":"1.0","event_id":"sha256:a5824b68f9fbc40f07cd90aeac735c6b8bce32223b884af0cc547a3d22558397"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:RNLENISQDVSGSQTCNINLABJYUD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum Bounded Rooted-Tree Packing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Fen Zhou, Gwendal Simon, Herve Kerivin, Jimmy Leblet","submitted_at":"2011-11-03T01:16:09Z","abstract_excerpt":"Given a graph and a root, the Maximum Bounded Rooted-Tree Packing (MBRTP) problem aims at finding K rooted-trees that span the largest subset of vertices, when each vertex has a limited outdegree. This problem is motivated by peer-to-peer streaming overlays in under-provisioned systems. We prove that the MBRTP problem is NP-complete. We present two polynomial-time algorithms that computes an optimal solution on complete graphs and trees respectively."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0706","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-18T04:09:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"61PN1NpeDse4exT1rSFG98fCTnJsWraFr3ctvrZ6Bt7Kq3feCU6JUnp+rZO52/YBRLBVvk9Bqgcxvb6hAj2UCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:43:32.460220Z"},"content_sha256":"e4fbb5ac80d969cf8d30cb7fbfe77aaa97b33c6d52bbee64c73a67c58fe006e7","schema_version":"1.0","event_id":"sha256:e4fbb5ac80d969cf8d30cb7fbfe77aaa97b33c6d52bbee64c73a67c58fe006e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RNLENISQDVSGSQTCNINLABJYUD/bundle.json","state_url":"https://pith.science/pith/RNLENISQDVSGSQTCNINLABJYUD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RNLENISQDVSGSQTCNINLABJYUD/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-03T07:43:32Z","links":{"resolver":"https://pith.science/pith/RNLENISQDVSGSQTCNINLABJYUD","bundle":"https://pith.science/pith/RNLENISQDVSGSQTCNINLABJYUD/bundle.json","state":"https://pith.science/pith/RNLENISQDVSGSQTCNINLABJYUD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RNLENISQDVSGSQTCNINLABJYUD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:RNLENISQDVSGSQTCNINLABJYUD","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":"6cb0b9c96d88078b7525202228c2c08d63b40501e6f870334fa32c395cabdcc2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-03T01:16:09Z","title_canon_sha256":"5c07bedbcaad00f48c8793e4e1e0f777a3bff0b8516e16ab0c1e04347b9806c7"},"schema_version":"1.0","source":{"id":"1111.0706","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.0706","created_at":"2026-05-18T04:09:37Z"},{"alias_kind":"arxiv_version","alias_value":"1111.0706v1","created_at":"2026-05-18T04:09:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0706","created_at":"2026-05-18T04:09:37Z"},{"alias_kind":"pith_short_12","alias_value":"RNLENISQDVSG","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RNLENISQDVSGSQTC","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RNLENISQ","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:e4fbb5ac80d969cf8d30cb7fbfe77aaa97b33c6d52bbee64c73a67c58fe006e7","target":"graph","created_at":"2026-05-18T04:09:37Z","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 graph and a root, the Maximum Bounded Rooted-Tree Packing (MBRTP) problem aims at finding K rooted-trees that span the largest subset of vertices, when each vertex has a limited outdegree. This problem is motivated by peer-to-peer streaming overlays in under-provisioned systems. We prove that the MBRTP problem is NP-complete. We present two polynomial-time algorithms that computes an optimal solution on complete graphs and trees respectively.","authors_text":"Fen Zhou, Gwendal Simon, Herve Kerivin, Jimmy Leblet","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-03T01:16:09Z","title":"Maximum Bounded Rooted-Tree Packing Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0706","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:a5824b68f9fbc40f07cd90aeac735c6b8bce32223b884af0cc547a3d22558397","target":"record","created_at":"2026-05-18T04:09:37Z","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":"6cb0b9c96d88078b7525202228c2c08d63b40501e6f870334fa32c395cabdcc2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-11-03T01:16:09Z","title_canon_sha256":"5c07bedbcaad00f48c8793e4e1e0f777a3bff0b8516e16ab0c1e04347b9806c7"},"schema_version":"1.0","source":{"id":"1111.0706","kind":"arxiv","version":1}},"canonical_sha256":"8b5646a2501d646942626a1ab00538a0de5167144aaff90cd26b44c231fbe12b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b5646a2501d646942626a1ab00538a0de5167144aaff90cd26b44c231fbe12b","first_computed_at":"2026-05-18T04:09:37.083713Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:37.083713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2XO1BldKx1PjLVZJ6+LMP8xbnaO15sQb49uZsMA2suqctmLG5XKc7xqYt27uY3C4Tbpfki7twOK2BZrPt2b2Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:37.084287Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.0706","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5824b68f9fbc40f07cd90aeac735c6b8bce32223b884af0cc547a3d22558397","sha256:e4fbb5ac80d969cf8d30cb7fbfe77aaa97b33c6d52bbee64c73a67c58fe006e7"],"state_sha256":"b2c44d0bb5c2fcb7acb4a177dc0221c415569887d34bc2bb663feb53fe0e4716"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cwSKKevVCXHYF2coPDHca3okNgMMy/3BBvB7OoRw14w2zG2/yrCG8abd//eWFFO1qpyQZGDpIjQhe6kVwyu8Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:43:32.462116Z","bundle_sha256":"5340a5a259895a2c5befb6c9bfb05064b03ffdadfde326663459d04a32de3ba6"}}