{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PUO2Z26IJBN4M3UXFDR7AUV6L4","short_pith_number":"pith:PUO2Z26I","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"},"canonical_sha256":"7d1dacebc8485bc66e9728e3f052be5f27c14979d735d5063ec1d80aa66f988c","source":{"kind":"arxiv","id":"1304.5942","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5942","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5942v1","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5942","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"pith_short_12","alias_value":"PUO2Z26IJBN4","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PUO2Z26IJBN4M3UX","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PUO2Z26I","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PUO2Z26IJBN4M3UXFDR7AUV6L4","target":"record","payload":{"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"},"canonical_sha256":"7d1dacebc8485bc66e9728e3f052be5f27c14979d735d5063ec1d80aa66f988c","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"},"source_kind":"arxiv","source_id":"1304.5942","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-18T03:27:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jNeN32y0m4cR2iYkl6I+YOSrr2Mrkejd3go60UL1OLTGulLHjYoBMoZdAWldkj51nyzIlqvmF9oAGPZpCxSICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:40:48.330111Z"},"content_sha256":"0dfe20504ce47ed3e55136e986f811dc3502dae3cac39dc14fefaca7fe789754","schema_version":"1.0","event_id":"sha256:0dfe20504ce47ed3e55136e986f811dc3502dae3cac39dc14fefaca7fe789754"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PUO2Z26IJBN4M3UXFDR7AUV6L4","target":"graph","payload":{"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"},"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-18T03:27:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kAUktMLRNK+CJ/m7M33/7b3O105/mKbeXv6jdWviGeivHyesfSgwv5cGDGWZu83bfHlgIcfv/grHpzCVQmsuBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T11:40:48.330502Z"},"content_sha256":"31a5eee4a381a7f1074ca739cf728b710f55d0bebc070a89df2fc56183d3b753","schema_version":"1.0","event_id":"sha256:31a5eee4a381a7f1074ca739cf728b710f55d0bebc070a89df2fc56183d3b753"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PUO2Z26IJBN4M3UXFDR7AUV6L4/bundle.json","state_url":"https://pith.science/pith/PUO2Z26IJBN4M3UXFDR7AUV6L4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PUO2Z26IJBN4M3UXFDR7AUV6L4/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-22T11:40:48Z","links":{"resolver":"https://pith.science/pith/PUO2Z26IJBN4M3UXFDR7AUV6L4","bundle":"https://pith.science/pith/PUO2Z26IJBN4M3UXFDR7AUV6L4/bundle.json","state":"https://pith.science/pith/PUO2Z26IJBN4M3UXFDR7AUV6L4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PUO2Z26IJBN4M3UXFDR7AUV6L4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PUO2Z26IJBN4M3UXFDR7AUV6L4","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":"c6ce6370ef6e7b2393dcfbf9b999a10bdd8786634b5b6e0059e022a6f239925b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-22T13:18:18Z","title_canon_sha256":"decb65fae2f5da16c902eb68a1966c4b902950b0f2cef4c8aaab2ffbe9e238c3"},"schema_version":"1.0","source":{"id":"1304.5942","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5942","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5942v1","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5942","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"pith_short_12","alias_value":"PUO2Z26IJBN4","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"PUO2Z26IJBN4M3UX","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"PUO2Z26I","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:31a5eee4a381a7f1074ca739cf728b710f55d0bebc070a89df2fc56183d3b753","target":"graph","created_at":"2026-05-18T03:27:23Z","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":"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","authors_text":"Eranda Cela, Rostislav Stanek","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-22T13:18:18Z","title":"Heuristics for the data arrangement problem on regular trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5942","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:0dfe20504ce47ed3e55136e986f811dc3502dae3cac39dc14fefaca7fe789754","target":"record","created_at":"2026-05-18T03:27:23Z","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":"c6ce6370ef6e7b2393dcfbf9b999a10bdd8786634b5b6e0059e022a6f239925b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-04-22T13:18:18Z","title_canon_sha256":"decb65fae2f5da16c902eb68a1966c4b902950b0f2cef4c8aaab2ffbe9e238c3"},"schema_version":"1.0","source":{"id":"1304.5942","kind":"arxiv","version":1}},"canonical_sha256":"7d1dacebc8485bc66e9728e3f052be5f27c14979d735d5063ec1d80aa66f988c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d1dacebc8485bc66e9728e3f052be5f27c14979d735d5063ec1d80aa66f988c","first_computed_at":"2026-05-18T03:27:23.704536Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:23.704536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZFXy6gnQhcNFuK6pNlHu05h7eFopBCO0a3q6qPy+US3ris0TqKez2ZNDB828iNhNvB0BK/qYQE14ElsS/mp8DA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:23.705154Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5942","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0dfe20504ce47ed3e55136e986f811dc3502dae3cac39dc14fefaca7fe789754","sha256:31a5eee4a381a7f1074ca739cf728b710f55d0bebc070a89df2fc56183d3b753"],"state_sha256":"c9f4f65b6bb86099828e7050ba4d1ef65f49ad682a27b58412ad4c1c5b0a0d14"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+BN8nepcn1eRC3JVkesLXVBuyt/EHhwnzoxNUQXyeFHbZbybUdDjjeB0U/yIyvxcCG6k561p1IfHy3ZlXBA/Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T11:40:48.332408Z","bundle_sha256":"b2931e5c13b0d0dda8401e4069046477f8ab0a3fe919f7db563c97e2d0caefc3"}}