{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PNKVGWIO6CYK2U56XPIR6YBLSI","short_pith_number":"pith:PNKVGWIO","canonical_record":{"source":{"id":"1702.05967","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-20T13:50:52Z","cross_cats_sorted":[],"title_canon_sha256":"8b39e2abc704c104240b900f3ac00704df8ca9f619022295dca294f9e17b440f","abstract_canon_sha256":"3effa4482aa3c89bd5d872a83043289683c1cbee1477e0d42920faf5670c85df"},"schema_version":"1.0"},"canonical_sha256":"7b5553590ef0b0ad53bebbd11f602b9220e7bd67c3a26dc584e984d56891be47","source":{"kind":"arxiv","id":"1702.05967","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05967","created_at":"2026-05-18T00:46:28Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05967v3","created_at":"2026-05-18T00:46:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05967","created_at":"2026-05-18T00:46:28Z"},{"alias_kind":"pith_short_12","alias_value":"PNKVGWIO6CYK","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PNKVGWIO6CYK2U56","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PNKVGWIO","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PNKVGWIO6CYK2U56XPIR6YBLSI","target":"record","payload":{"canonical_record":{"source":{"id":"1702.05967","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-20T13:50:52Z","cross_cats_sorted":[],"title_canon_sha256":"8b39e2abc704c104240b900f3ac00704df8ca9f619022295dca294f9e17b440f","abstract_canon_sha256":"3effa4482aa3c89bd5d872a83043289683c1cbee1477e0d42920faf5670c85df"},"schema_version":"1.0"},"canonical_sha256":"7b5553590ef0b0ad53bebbd11f602b9220e7bd67c3a26dc584e984d56891be47","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:28.982401Z","signature_b64":"Jztx0d//jexr/xPSVRCB3L5nRuP4mWNwpo8056SoMtjFp0XfTB/yfH3SmuZ+fJMIqH7HR7JdAOiKmsrekKqVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b5553590ef0b0ad53bebbd11f602b9220e7bd67c3a26dc584e984d56891be47","last_reissued_at":"2026-05-18T00:46:28.981730Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:28.981730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.05967","source_version":3,"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-18T00:46:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RBTFlXG7cYqYbG3I3a/PvZTM4ty7qoDnUt+21TOVWDHwKmcJDaIGxHALwjEu4KM9XzpU4U4zKguEVTom/nQgBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:34:36.540403Z"},"content_sha256":"0c1088a2b48c8d56d0f037948459ebe8f1f2cc3b411712973314ada44ddbe238","schema_version":"1.0","event_id":"sha256:0c1088a2b48c8d56d0f037948459ebe8f1f2cc3b411712973314ada44ddbe238"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PNKVGWIO6CYK2U56XPIR6YBLSI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Practical, Linear-time, Fully Distributed Algorithms for Irregular Gather and Scatter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jesper Larsson Tr\\\"aff","submitted_at":"2017-02-20T13:50:52Z","abstract_excerpt":"We present new, simple, fully distributed, practical algorithms with linear time communication cost for irregular gather and scatter operations in which processors contribute or consume possibly different amounts of data. In a linear cost transmission model with start-up latency $\\alpha$ and cost per unit $\\beta$, the new algorithms take time $3|{\\log_2 p}|\\alpha+\\beta \\sum_{i\\neq r}m_i$ where $p$ is the number of processors, $m_i$ the amount of data for processor $i, 0\\leq i<p$, and processor $r, 0\\leq r<p$ a root processor determined by the algorithm. For a fixed, externally given root proce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05967","kind":"arxiv","version":3},"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-18T00:46:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G9yx1Z2SvRBP0s+8qXEB2U+u9em+YhyEd/vi1HRaIx+szUs3AnqzKZSx59nQmw4E9AwObQmTWm6kQHH99k47Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:34:36.540759Z"},"content_sha256":"a3539328bfc05503d82f9af93d7c7c27baf098952264def1d37c9a4d53345a43","schema_version":"1.0","event_id":"sha256:a3539328bfc05503d82f9af93d7c7c27baf098952264def1d37c9a4d53345a43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PNKVGWIO6CYK2U56XPIR6YBLSI/bundle.json","state_url":"https://pith.science/pith/PNKVGWIO6CYK2U56XPIR6YBLSI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PNKVGWIO6CYK2U56XPIR6YBLSI/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-24T08:34:36Z","links":{"resolver":"https://pith.science/pith/PNKVGWIO6CYK2U56XPIR6YBLSI","bundle":"https://pith.science/pith/PNKVGWIO6CYK2U56XPIR6YBLSI/bundle.json","state":"https://pith.science/pith/PNKVGWIO6CYK2U56XPIR6YBLSI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PNKVGWIO6CYK2U56XPIR6YBLSI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PNKVGWIO6CYK2U56XPIR6YBLSI","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":"3effa4482aa3c89bd5d872a83043289683c1cbee1477e0d42920faf5670c85df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-20T13:50:52Z","title_canon_sha256":"8b39e2abc704c104240b900f3ac00704df8ca9f619022295dca294f9e17b440f"},"schema_version":"1.0","source":{"id":"1702.05967","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05967","created_at":"2026-05-18T00:46:28Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05967v3","created_at":"2026-05-18T00:46:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05967","created_at":"2026-05-18T00:46:28Z"},{"alias_kind":"pith_short_12","alias_value":"PNKVGWIO6CYK","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PNKVGWIO6CYK2U56","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PNKVGWIO","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:a3539328bfc05503d82f9af93d7c7c27baf098952264def1d37c9a4d53345a43","target":"graph","created_at":"2026-05-18T00:46:28Z","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 present new, simple, fully distributed, practical algorithms with linear time communication cost for irregular gather and scatter operations in which processors contribute or consume possibly different amounts of data. In a linear cost transmission model with start-up latency $\\alpha$ and cost per unit $\\beta$, the new algorithms take time $3|{\\log_2 p}|\\alpha+\\beta \\sum_{i\\neq r}m_i$ where $p$ is the number of processors, $m_i$ the amount of data for processor $i, 0\\leq i<p$, and processor $r, 0\\leq r<p$ a root processor determined by the algorithm. For a fixed, externally given root proce","authors_text":"Jesper Larsson Tr\\\"aff","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-20T13:50:52Z","title":"Practical, Linear-time, Fully Distributed Algorithms for Irregular Gather and Scatter"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05967","kind":"arxiv","version":3},"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:0c1088a2b48c8d56d0f037948459ebe8f1f2cc3b411712973314ada44ddbe238","target":"record","created_at":"2026-05-18T00:46:28Z","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":"3effa4482aa3c89bd5d872a83043289683c1cbee1477e0d42920faf5670c85df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-02-20T13:50:52Z","title_canon_sha256":"8b39e2abc704c104240b900f3ac00704df8ca9f619022295dca294f9e17b440f"},"schema_version":"1.0","source":{"id":"1702.05967","kind":"arxiv","version":3}},"canonical_sha256":"7b5553590ef0b0ad53bebbd11f602b9220e7bd67c3a26dc584e984d56891be47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b5553590ef0b0ad53bebbd11f602b9220e7bd67c3a26dc584e984d56891be47","first_computed_at":"2026-05-18T00:46:28.981730Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:28.981730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jztx0d//jexr/xPSVRCB3L5nRuP4mWNwpo8056SoMtjFp0XfTB/yfH3SmuZ+fJMIqH7HR7JdAOiKmsrekKqVCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:28.982401Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05967","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c1088a2b48c8d56d0f037948459ebe8f1f2cc3b411712973314ada44ddbe238","sha256:a3539328bfc05503d82f9af93d7c7c27baf098952264def1d37c9a4d53345a43"],"state_sha256":"086f7d5e40b85c733944c6433e3da589e02e9030d0af6fd96ecce2f4c4283591"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mspsJ8X7erHMVOOZOk5W6mrj94im3zGERWHIrceBPASYIb38xqmFUDR0Y7uCzE1VkrxdOhbBSxly0DJRJUaFAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T08:34:36.543079Z","bundle_sha256":"b0a45b258ce1acf7851dfbabb0eb7f3221089fc214b4a488bfb510c8769274ed"}}