{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PI7JV2VQBRLUZTCQOHVT5LS3YD","short_pith_number":"pith:PI7JV2VQ","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"},"canonical_sha256":"7a3e9aeab00c574ccc5071eb3eae5bc0c826cd37d868aaf0bc0edf2e43c7392b","source":{"kind":"arxiv","id":"1512.08404","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.08404","created_at":"2026-05-18T01:23:42Z"},{"alias_kind":"arxiv_version","alias_value":"1512.08404v1","created_at":"2026-05-18T01:23:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08404","created_at":"2026-05-18T01:23:42Z"},{"alias_kind":"pith_short_12","alias_value":"PI7JV2VQBRLU","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PI7JV2VQBRLUZTCQ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PI7JV2VQ","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PI7JV2VQBRLUZTCQOHVT5LS3YD","target":"record","payload":{"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"},"canonical_sha256":"7a3e9aeab00c574ccc5071eb3eae5bc0c826cd37d868aaf0bc0edf2e43c7392b","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"},"source_kind":"arxiv","source_id":"1512.08404","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-18T01:23:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+bpthh7iEact7BL6eFdGxHpjrpqa/3QSvholO07YZ83Yt6Gpp9LfHzhNDvdXruFH3ArEgBQFiSuKMscmG64QAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:37:59.306068Z"},"content_sha256":"71c207bdb47428d7baaa24248d047cb7b109aa815d977280f88e5e5c76ef0028","schema_version":"1.0","event_id":"sha256:71c207bdb47428d7baaa24248d047cb7b109aa815d977280f88e5e5c76ef0028"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PI7JV2VQBRLUZTCQOHVT5LS3YD","target":"graph","payload":{"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"},"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-18T01:23:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jr0sZQz6VW0QUii7mxe8vPRX8phxU0XIAkAtFjQddaq18M7g1bBa/xpgSzewFQ6OgU8msWOdkjI/Wz8xmwtTAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:37:59.306439Z"},"content_sha256":"bcf8a3a41f0364b9269fec3cbaffe2113725e0440587d871fcf1ad9ba6f600ec","schema_version":"1.0","event_id":"sha256:bcf8a3a41f0364b9269fec3cbaffe2113725e0440587d871fcf1ad9ba6f600ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PI7JV2VQBRLUZTCQOHVT5LS3YD/bundle.json","state_url":"https://pith.science/pith/PI7JV2VQBRLUZTCQOHVT5LS3YD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PI7JV2VQBRLUZTCQOHVT5LS3YD/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-05T14:37:59Z","links":{"resolver":"https://pith.science/pith/PI7JV2VQBRLUZTCQOHVT5LS3YD","bundle":"https://pith.science/pith/PI7JV2VQBRLUZTCQOHVT5LS3YD/bundle.json","state":"https://pith.science/pith/PI7JV2VQBRLUZTCQOHVT5LS3YD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PI7JV2VQBRLUZTCQOHVT5LS3YD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PI7JV2VQBRLUZTCQOHVT5LS3YD","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":"9a0fb3ae7b89d0dc858af69b3d97e5e2d3f799ee53414300a312db406ac1454b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-28T13:10:45Z","title_canon_sha256":"7b5e23a0b54a44941db51cf1644d3c59029aeb5a0592eb1ba41960c8b81d8248"},"schema_version":"1.0","source":{"id":"1512.08404","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.08404","created_at":"2026-05-18T01:23:42Z"},{"alias_kind":"arxiv_version","alias_value":"1512.08404v1","created_at":"2026-05-18T01:23:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08404","created_at":"2026-05-18T01:23:42Z"},{"alias_kind":"pith_short_12","alias_value":"PI7JV2VQBRLU","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PI7JV2VQBRLUZTCQ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PI7JV2VQ","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:bcf8a3a41f0364b9269fec3cbaffe2113725e0440587d871fcf1ad9ba6f600ec","target":"graph","created_at":"2026-05-18T01:23:42Z","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, 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","authors_text":"Eranda Cela, Joachim Schauer, Rostislav Stanek","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-28T13:10:45Z","title":"The data arrangement problem on binary trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08404","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:71c207bdb47428d7baaa24248d047cb7b109aa815d977280f88e5e5c76ef0028","target":"record","created_at":"2026-05-18T01:23:42Z","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":"9a0fb3ae7b89d0dc858af69b3d97e5e2d3f799ee53414300a312db406ac1454b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-28T13:10:45Z","title_canon_sha256":"7b5e23a0b54a44941db51cf1644d3c59029aeb5a0592eb1ba41960c8b81d8248"},"schema_version":"1.0","source":{"id":"1512.08404","kind":"arxiv","version":1}},"canonical_sha256":"7a3e9aeab00c574ccc5071eb3eae5bc0c826cd37d868aaf0bc0edf2e43c7392b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a3e9aeab00c574ccc5071eb3eae5bc0c826cd37d868aaf0bc0edf2e43c7392b","first_computed_at":"2026-05-18T01:23:42.403550Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:42.403550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IiPn1Iz5PmZ41LJUSW6ZfZ5HAljWPKZHj+AXdFqOjedQhn1mbgsJlw9amaInLGbkCUtvjQeMSMFChhNoXcQhDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:42.404254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.08404","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71c207bdb47428d7baaa24248d047cb7b109aa815d977280f88e5e5c76ef0028","sha256:bcf8a3a41f0364b9269fec3cbaffe2113725e0440587d871fcf1ad9ba6f600ec"],"state_sha256":"24084ef1a6d3a637fca587151a9a399344e9dcdaef3e474370aa76610ebf4433"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fHuzKiWDoFUF0YXVo1tf3OdekIsu1F2iM3yG2IlYlm4Fb3PVxodWTjVhB9L1Wh7fhqUkap24e3q3xgiQKVqoDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:37:59.308436Z","bundle_sha256":"300c4d2a585f8300bbdeb075aa9b62560b814a5bab2849b9d7da958a1d5fa5f0"}}