{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RNLENISQDVSGSQTCNINLABJYUD","short_pith_number":"pith:RNLENISQ","schema_version":"1.0","canonical_sha256":"8b5646a2501d646942626a1ab00538a0de5167144aaff90cd26b44c231fbe12b","source":{"kind":"arxiv","id":"1111.0706","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1111.0706","created_at":"2026-05-18T04:09:37.083795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.0706v1","created_at":"2026-05-18T04:09:37.083795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0706","created_at":"2026-05-18T04:09:37.083795+00:00"},{"alias_kind":"pith_short_12","alias_value":"RNLENISQDVSG","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RNLENISQDVSGSQTC","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RNLENISQ","created_at":"2026-05-18T12:26:41.206345+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/RNLENISQDVSGSQTCNINLABJYUD","json":"https://pith.science/pith/RNLENISQDVSGSQTCNINLABJYUD.json","graph_json":"https://pith.science/api/pith-number/RNLENISQDVSGSQTCNINLABJYUD/graph.json","events_json":"https://pith.science/api/pith-number/RNLENISQDVSGSQTCNINLABJYUD/events.json","paper":"https://pith.science/paper/RNLENISQ"},"agent_actions":{"view_html":"https://pith.science/pith/RNLENISQDVSGSQTCNINLABJYUD","download_json":"https://pith.science/pith/RNLENISQDVSGSQTCNINLABJYUD.json","view_paper":"https://pith.science/paper/RNLENISQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.0706&json=true","fetch_graph":"https://pith.science/api/pith-number/RNLENISQDVSGSQTCNINLABJYUD/graph.json","fetch_events":"https://pith.science/api/pith-number/RNLENISQDVSGSQTCNINLABJYUD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RNLENISQDVSGSQTCNINLABJYUD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RNLENISQDVSGSQTCNINLABJYUD/action/storage_attestation","attest_author":"https://pith.science/pith/RNLENISQDVSGSQTCNINLABJYUD/action/author_attestation","sign_citation":"https://pith.science/pith/RNLENISQDVSGSQTCNINLABJYUD/action/citation_signature","submit_replication":"https://pith.science/pith/RNLENISQDVSGSQTCNINLABJYUD/action/replication_record"}},"created_at":"2026-05-18T04:09:37.083795+00:00","updated_at":"2026-05-18T04:09:37.083795+00:00"}