{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6B7BLP4XNC2LHQ2C5NJUEOSBMC","short_pith_number":"pith:6B7BLP4X","schema_version":"1.0","canonical_sha256":"f07e15bf9768b4b3c342eb53423a416096be42e2521df904a393283017d447a3","source":{"kind":"arxiv","id":"1302.4219","version":1},"attestation_state":"computed","paper":{"title":"Labeled Packing of Non Star Tree into its Fifth Power and Sixth Power","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amine El Sahili, Hamamache Kheddouci, Maidoun Mortada","submitted_at":"2013-02-18T10:48:27Z","abstract_excerpt":"In this paper we prove that we can find a labeled packing of a non star tree $T$ into $T^6$ with $m_T+\\lceil\\frac{n-m_T}{5}\\rceil$ labels, where $n$ is the number of vertices of $T$ and $m_T$ is the maximum number of leaves that can be removed from $T$ in such a way that the obtained graph is a non star tree. Also, we prove that we can find a labeled packing of a non star tree $T$ into $T^5$ with $m_T+1$ labels and a labeled packing of a path $P_n$, $n\\geq 4$, into $P_n^4$ with $\\lceil \\frac{n}{4}\\rceil$ labels."},"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":"1302.4219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-18T10:48:27Z","cross_cats_sorted":[],"title_canon_sha256":"56c3949522d6759e00d6731a395e85e4bcc78ed5c116b6e1b65bd77f7cde2b66","abstract_canon_sha256":"9445ccc9caddfcfd755c61a58f103b341768c9cf421b180c66c9d5e4b45fcd38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:23.683408Z","signature_b64":"90+uFcYeH1PuELYNdwJjxLw7px/YqAXGbgn9FTOetUVaof6a5GAb3NhtZkrCoyk4sXgorO2vu6iItTED3eWnBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f07e15bf9768b4b3c342eb53423a416096be42e2521df904a393283017d447a3","last_reissued_at":"2026-05-18T03:33:23.682674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:23.682674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Labeled Packing of Non Star Tree into its Fifth Power and Sixth Power","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amine El Sahili, Hamamache Kheddouci, Maidoun Mortada","submitted_at":"2013-02-18T10:48:27Z","abstract_excerpt":"In this paper we prove that we can find a labeled packing of a non star tree $T$ into $T^6$ with $m_T+\\lceil\\frac{n-m_T}{5}\\rceil$ labels, where $n$ is the number of vertices of $T$ and $m_T$ is the maximum number of leaves that can be removed from $T$ in such a way that the obtained graph is a non star tree. Also, we prove that we can find a labeled packing of a non star tree $T$ into $T^5$ with $m_T+1$ labels and a labeled packing of a path $P_n$, $n\\geq 4$, into $P_n^4$ with $\\lceil \\frac{n}{4}\\rceil$ labels."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4219","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":"1302.4219","created_at":"2026-05-18T03:33:23.682800+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4219v1","created_at":"2026-05-18T03:33:23.682800+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4219","created_at":"2026-05-18T03:33:23.682800+00:00"},{"alias_kind":"pith_short_12","alias_value":"6B7BLP4XNC2L","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6B7BLP4XNC2LHQ2C","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6B7BLP4X","created_at":"2026-05-18T12:27:36.564083+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/6B7BLP4XNC2LHQ2C5NJUEOSBMC","json":"https://pith.science/pith/6B7BLP4XNC2LHQ2C5NJUEOSBMC.json","graph_json":"https://pith.science/api/pith-number/6B7BLP4XNC2LHQ2C5NJUEOSBMC/graph.json","events_json":"https://pith.science/api/pith-number/6B7BLP4XNC2LHQ2C5NJUEOSBMC/events.json","paper":"https://pith.science/paper/6B7BLP4X"},"agent_actions":{"view_html":"https://pith.science/pith/6B7BLP4XNC2LHQ2C5NJUEOSBMC","download_json":"https://pith.science/pith/6B7BLP4XNC2LHQ2C5NJUEOSBMC.json","view_paper":"https://pith.science/paper/6B7BLP4X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4219&json=true","fetch_graph":"https://pith.science/api/pith-number/6B7BLP4XNC2LHQ2C5NJUEOSBMC/graph.json","fetch_events":"https://pith.science/api/pith-number/6B7BLP4XNC2LHQ2C5NJUEOSBMC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6B7BLP4XNC2LHQ2C5NJUEOSBMC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6B7BLP4XNC2LHQ2C5NJUEOSBMC/action/storage_attestation","attest_author":"https://pith.science/pith/6B7BLP4XNC2LHQ2C5NJUEOSBMC/action/author_attestation","sign_citation":"https://pith.science/pith/6B7BLP4XNC2LHQ2C5NJUEOSBMC/action/citation_signature","submit_replication":"https://pith.science/pith/6B7BLP4XNC2LHQ2C5NJUEOSBMC/action/replication_record"}},"created_at":"2026-05-18T03:33:23.682800+00:00","updated_at":"2026-05-18T03:33:23.682800+00:00"}