{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PI7JV2VQBRLUZTCQOHVT5LS3YD","short_pith_number":"pith:PI7JV2VQ","schema_version":"1.0","canonical_sha256":"7a3e9aeab00c574ccc5071eb3eae5bc0c826cd37d868aaf0bc0edf2e43c7392b","source":{"kind":"arxiv","id":"1512.08404","version":1},"attestation_state":"computed","paper":{"title":"The data arrangement problem on binary trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Eranda Cela, Joachim Schauer, Rostislav Stanek","submitted_at":"2015-12-28T13:10:45Z","abstract_excerpt":"The data arrangement problem on regular trees (DAPT) consists in assigning the vertices of a given graph G, called the guest graph, to the leaves of a d-regular tree T, called the host graph, such that the sum of the pairwise distances of all pairs of leaves in T which correspond to the edges of G is minimised. Luczak and Noble have shown that this problem is NP-hard for every fixed d greater than or equal to 2. In this paper we show that the DAPT remains NP-hard even if the guest graph is a tree, an issue which was posed as an open question in by Luczak and Noble.\n  We deal with a special cas"},"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":"1512.08404","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-28T13:10:45Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"7b5e23a0b54a44941db51cf1644d3c59029aeb5a0592eb1ba41960c8b81d8248","abstract_canon_sha256":"9a0fb3ae7b89d0dc858af69b3d97e5e2d3f799ee53414300a312db406ac1454b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:42.404254Z","signature_b64":"IiPn1Iz5PmZ41LJUSW6ZfZ5HAljWPKZHj+AXdFqOjedQhn1mbgsJlw9amaInLGbkCUtvjQeMSMFChhNoXcQhDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a3e9aeab00c574ccc5071eb3eae5bc0c826cd37d868aaf0bc0edf2e43c7392b","last_reissued_at":"2026-05-18T01:23:42.403550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:42.403550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The data arrangement problem on binary trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Eranda Cela, Joachim Schauer, Rostislav Stanek","submitted_at":"2015-12-28T13:10:45Z","abstract_excerpt":"The data arrangement problem on regular trees (DAPT) consists in assigning the vertices of a given graph G, called the guest graph, to the leaves of a d-regular tree T, called the host graph, such that the sum of the pairwise distances of all pairs of leaves in T which correspond to the edges of G is minimised. Luczak and Noble have shown that this problem is NP-hard for every fixed d greater than or equal to 2. In this paper we show that the DAPT remains NP-hard even if the guest graph is a tree, an issue which was posed as an open question in by Luczak and Noble.\n  We deal with a special cas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08404","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":"1512.08404","created_at":"2026-05-18T01:23:42.403669+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.08404v1","created_at":"2026-05-18T01:23:42.403669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08404","created_at":"2026-05-18T01:23:42.403669+00:00"},{"alias_kind":"pith_short_12","alias_value":"PI7JV2VQBRLU","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PI7JV2VQBRLUZTCQ","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PI7JV2VQ","created_at":"2026-05-18T12:29:37.295048+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/PI7JV2VQBRLUZTCQOHVT5LS3YD","json":"https://pith.science/pith/PI7JV2VQBRLUZTCQOHVT5LS3YD.json","graph_json":"https://pith.science/api/pith-number/PI7JV2VQBRLUZTCQOHVT5LS3YD/graph.json","events_json":"https://pith.science/api/pith-number/PI7JV2VQBRLUZTCQOHVT5LS3YD/events.json","paper":"https://pith.science/paper/PI7JV2VQ"},"agent_actions":{"view_html":"https://pith.science/pith/PI7JV2VQBRLUZTCQOHVT5LS3YD","download_json":"https://pith.science/pith/PI7JV2VQBRLUZTCQOHVT5LS3YD.json","view_paper":"https://pith.science/paper/PI7JV2VQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.08404&json=true","fetch_graph":"https://pith.science/api/pith-number/PI7JV2VQBRLUZTCQOHVT5LS3YD/graph.json","fetch_events":"https://pith.science/api/pith-number/PI7JV2VQBRLUZTCQOHVT5LS3YD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PI7JV2VQBRLUZTCQOHVT5LS3YD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PI7JV2VQBRLUZTCQOHVT5LS3YD/action/storage_attestation","attest_author":"https://pith.science/pith/PI7JV2VQBRLUZTCQOHVT5LS3YD/action/author_attestation","sign_citation":"https://pith.science/pith/PI7JV2VQBRLUZTCQOHVT5LS3YD/action/citation_signature","submit_replication":"https://pith.science/pith/PI7JV2VQBRLUZTCQOHVT5LS3YD/action/replication_record"}},"created_at":"2026-05-18T01:23:42.403669+00:00","updated_at":"2026-05-18T01:23:42.403669+00:00"}