{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PZCX5AXSGL34YBN35BW22U73VF","short_pith_number":"pith:PZCX5AXS","canonical_record":{"source":{"id":"1506.09100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-30T14:11:34Z","cross_cats_sorted":[],"title_canon_sha256":"090bd43e092da939039d43aeb84d672d4f5bbd49599d9c59e7b7c02707479c74","abstract_canon_sha256":"9811450c894ad0833975490948eecb6801503e47dea8c0610383074889c61cfd"},"schema_version":"1.0"},"canonical_sha256":"7e457e82f232f7cc05bbe86dad53fba945e9ab5e88660c7d901c4e05cfbd2510","source":{"kind":"arxiv","id":"1506.09100","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.09100","created_at":"2026-05-18T01:37:33Z"},{"alias_kind":"arxiv_version","alias_value":"1506.09100v1","created_at":"2026-05-18T01:37:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.09100","created_at":"2026-05-18T01:37:33Z"},{"alias_kind":"pith_short_12","alias_value":"PZCX5AXSGL34","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PZCX5AXSGL34YBN3","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PZCX5AXS","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PZCX5AXSGL34YBN35BW22U73VF","target":"record","payload":{"canonical_record":{"source":{"id":"1506.09100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-30T14:11:34Z","cross_cats_sorted":[],"title_canon_sha256":"090bd43e092da939039d43aeb84d672d4f5bbd49599d9c59e7b7c02707479c74","abstract_canon_sha256":"9811450c894ad0833975490948eecb6801503e47dea8c0610383074889c61cfd"},"schema_version":"1.0"},"canonical_sha256":"7e457e82f232f7cc05bbe86dad53fba945e9ab5e88660c7d901c4e05cfbd2510","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:33.669143Z","signature_b64":"/oGyrBieTB5fAA0MbFeLsrd38lIWEAmXbE1pBHQdIiDMn1rwD5SBkni6N8+bYk4k1ZySnLJHzJftQrlvE0T0BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e457e82f232f7cc05bbe86dad53fba945e9ab5e88660c7d901c4e05cfbd2510","last_reissued_at":"2026-05-18T01:37:33.668637Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:33.668637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.09100","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:37:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FgYtTmM7kC8IhL+dZi+tCXtqUweQTO6dHOZywL93ON5K/vjAdlgdja5eW+1iU2ZYUaZqNYYyC5YsNXemucSSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:04:42.683985Z"},"content_sha256":"cc9eb888567605e645b49014844519b0b177398811fea9997e2612dcbb41324a","schema_version":"1.0","event_id":"sha256:cc9eb888567605e645b49014844519b0b177398811fea9997e2612dcbb41324a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PZCX5AXSGL34YBN35BW22U73VF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jesper Larsson Tr\\\"aff, Martin Kalany, Robert Ganian, Stefan Szeider","submitted_at":"2015-06-30T14:11:34Z","abstract_excerpt":"We show that the problem of constructing tree-structured descriptions of data layouts that are optimal with respect to space or other criteria from given sequences of displacements, can be solved in polynomial time. The problem is relevant for efficient compiler and library support for communication of noncontiguous data, where tree-structured descriptions with low-degree nodes and small index arrays are beneficial for the communication soft- and hardware. An important example is the Message-Passing Interface (MPI) which has a mechanism for describing arbitrary data layouts as trees using a se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.09100","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:37:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ONNSxUM37OPlm0Ozfdhohp1/CHiGbUwj9f9RF7ua1AGAaHF5O8sxSCZHeC0ZfwYlMzkMYWzbV0XY7dsgCRHlBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:04:42.684622Z"},"content_sha256":"c5823639b65672371d9a588a8add90b72572d22e8a6192aaec4fbbc3b04c72f3","schema_version":"1.0","event_id":"sha256:c5823639b65672371d9a588a8add90b72572d22e8a6192aaec4fbbc3b04c72f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PZCX5AXSGL34YBN35BW22U73VF/bundle.json","state_url":"https://pith.science/pith/PZCX5AXSGL34YBN35BW22U73VF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PZCX5AXSGL34YBN35BW22U73VF/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-05-28T20:04:42Z","links":{"resolver":"https://pith.science/pith/PZCX5AXSGL34YBN35BW22U73VF","bundle":"https://pith.science/pith/PZCX5AXSGL34YBN35BW22U73VF/bundle.json","state":"https://pith.science/pith/PZCX5AXSGL34YBN35BW22U73VF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PZCX5AXSGL34YBN35BW22U73VF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PZCX5AXSGL34YBN35BW22U73VF","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":"9811450c894ad0833975490948eecb6801503e47dea8c0610383074889c61cfd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-30T14:11:34Z","title_canon_sha256":"090bd43e092da939039d43aeb84d672d4f5bbd49599d9c59e7b7c02707479c74"},"schema_version":"1.0","source":{"id":"1506.09100","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.09100","created_at":"2026-05-18T01:37:33Z"},{"alias_kind":"arxiv_version","alias_value":"1506.09100v1","created_at":"2026-05-18T01:37:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.09100","created_at":"2026-05-18T01:37:33Z"},{"alias_kind":"pith_short_12","alias_value":"PZCX5AXSGL34","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PZCX5AXSGL34YBN3","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PZCX5AXS","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:c5823639b65672371d9a588a8add90b72572d22e8a6192aaec4fbbc3b04c72f3","target":"graph","created_at":"2026-05-18T01:37:33Z","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":"We show that the problem of constructing tree-structured descriptions of data layouts that are optimal with respect to space or other criteria from given sequences of displacements, can be solved in polynomial time. The problem is relevant for efficient compiler and library support for communication of noncontiguous data, where tree-structured descriptions with low-degree nodes and small index arrays are beneficial for the communication soft- and hardware. An important example is the Message-Passing Interface (MPI) which has a mechanism for describing arbitrary data layouts as trees using a se","authors_text":"Jesper Larsson Tr\\\"aff, Martin Kalany, Robert Ganian, Stefan Szeider","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-30T14:11:34Z","title":"Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.09100","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:cc9eb888567605e645b49014844519b0b177398811fea9997e2612dcbb41324a","target":"record","created_at":"2026-05-18T01:37:33Z","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":"9811450c894ad0833975490948eecb6801503e47dea8c0610383074889c61cfd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-30T14:11:34Z","title_canon_sha256":"090bd43e092da939039d43aeb84d672d4f5bbd49599d9c59e7b7c02707479c74"},"schema_version":"1.0","source":{"id":"1506.09100","kind":"arxiv","version":1}},"canonical_sha256":"7e457e82f232f7cc05bbe86dad53fba945e9ab5e88660c7d901c4e05cfbd2510","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e457e82f232f7cc05bbe86dad53fba945e9ab5e88660c7d901c4e05cfbd2510","first_computed_at":"2026-05-18T01:37:33.668637Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:33.668637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/oGyrBieTB5fAA0MbFeLsrd38lIWEAmXbE1pBHQdIiDMn1rwD5SBkni6N8+bYk4k1ZySnLJHzJftQrlvE0T0BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:33.669143Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.09100","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc9eb888567605e645b49014844519b0b177398811fea9997e2612dcbb41324a","sha256:c5823639b65672371d9a588a8add90b72572d22e8a6192aaec4fbbc3b04c72f3"],"state_sha256":"6361c776583bd017cb0c8793e196c7ee8d60f7e9c978eb6fa2ab336512789f78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EdeAnszP4qGgpyq9WKESka8q6zu6GVeHszeul3m8uHxlXXS7LTillk67F0kop50QLlrRli8aYfAanvsCAKKzDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:04:42.687732Z","bundle_sha256":"a067c2e2adfb80a14c365f86812e2c9ac1f34e4a25c78c334591614b4d8007b2"}}