{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PUO2Z26IJBN4M3UXFDR7AUV6L4","short_pith_number":"pith:PUO2Z26I","schema_version":"1.0","canonical_sha256":"7d1dacebc8485bc66e9728e3f052be5f27c14979d735d5063ec1d80aa66f988c","source":{"kind":"arxiv","id":"1304.5942","version":1},"attestation_state":"computed","paper":{"title":"Heuristics for the data arrangement problem on regular trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Eranda Cela, Rostislav Stanek","submitted_at":"2013-04-22T13:18:18Z","abstract_excerpt":"The data arrangement problem on regular trees (DAPT) consists in assigning the vertices of a given graph G to the leaves of a d-regular tree T such that the sum of the pairwise distances of all pairs of leaves in T which correspond to edges of G is minimised. Luczak and Noble [6] have shown that this problem is NP-hard for every fixed d larger than or equal to 2. In this paper we propose construction and local search heuristics for the DAPT and introduce a lower bound for this problem. The analysis of the performance of the heuristics is based on two considerations: a) the quality of the solut"},"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":"1304.5942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-22T13:18:18Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"decb65fae2f5da16c902eb68a1966c4b902950b0f2cef4c8aaab2ffbe9e238c3","abstract_canon_sha256":"c6ce6370ef6e7b2393dcfbf9b999a10bdd8786634b5b6e0059e022a6f239925b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:23.705154Z","signature_b64":"ZFXy6gnQhcNFuK6pNlHu05h7eFopBCO0a3q6qPy+US3ris0TqKez2ZNDB828iNhNvB0BK/qYQE14ElsS/mp8DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d1dacebc8485bc66e9728e3f052be5f27c14979d735d5063ec1d80aa66f988c","last_reissued_at":"2026-05-18T03:27:23.704536Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:23.704536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Heuristics for the data arrangement problem on regular trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Eranda Cela, Rostislav Stanek","submitted_at":"2013-04-22T13:18:18Z","abstract_excerpt":"The data arrangement problem on regular trees (DAPT) consists in assigning the vertices of a given graph G to the leaves of a d-regular tree T such that the sum of the pairwise distances of all pairs of leaves in T which correspond to edges of G is minimised. Luczak and Noble [6] have shown that this problem is NP-hard for every fixed d larger than or equal to 2. In this paper we propose construction and local search heuristics for the DAPT and introduce a lower bound for this problem. The analysis of the performance of the heuristics is based on two considerations: a) the quality of the solut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5942","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":"1304.5942","created_at":"2026-05-18T03:27:23.704633+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.5942v1","created_at":"2026-05-18T03:27:23.704633+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5942","created_at":"2026-05-18T03:27:23.704633+00:00"},{"alias_kind":"pith_short_12","alias_value":"PUO2Z26IJBN4","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"PUO2Z26IJBN4M3UX","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"PUO2Z26I","created_at":"2026-05-18T12:27:57.521954+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/PUO2Z26IJBN4M3UXFDR7AUV6L4","json":"https://pith.science/pith/PUO2Z26IJBN4M3UXFDR7AUV6L4.json","graph_json":"https://pith.science/api/pith-number/PUO2Z26IJBN4M3UXFDR7AUV6L4/graph.json","events_json":"https://pith.science/api/pith-number/PUO2Z26IJBN4M3UXFDR7AUV6L4/events.json","paper":"https://pith.science/paper/PUO2Z26I"},"agent_actions":{"view_html":"https://pith.science/pith/PUO2Z26IJBN4M3UXFDR7AUV6L4","download_json":"https://pith.science/pith/PUO2Z26IJBN4M3UXFDR7AUV6L4.json","view_paper":"https://pith.science/paper/PUO2Z26I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.5942&json=true","fetch_graph":"https://pith.science/api/pith-number/PUO2Z26IJBN4M3UXFDR7AUV6L4/graph.json","fetch_events":"https://pith.science/api/pith-number/PUO2Z26IJBN4M3UXFDR7AUV6L4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PUO2Z26IJBN4M3UXFDR7AUV6L4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PUO2Z26IJBN4M3UXFDR7AUV6L4/action/storage_attestation","attest_author":"https://pith.science/pith/PUO2Z26IJBN4M3UXFDR7AUV6L4/action/author_attestation","sign_citation":"https://pith.science/pith/PUO2Z26IJBN4M3UXFDR7AUV6L4/action/citation_signature","submit_replication":"https://pith.science/pith/PUO2Z26IJBN4M3UXFDR7AUV6L4/action/replication_record"}},"created_at":"2026-05-18T03:27:23.704633+00:00","updated_at":"2026-05-18T03:27:23.704633+00:00"}