{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PNKVGWIO6CYK2U56XPIR6YBLSI","short_pith_number":"pith:PNKVGWIO","schema_version":"1.0","canonical_sha256":"7b5553590ef0b0ad53bebbd11f602b9220e7bd67c3a26dc584e984d56891be47","source":{"kind":"arxiv","id":"1702.05967","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.05967","created_at":"2026-05-18T00:46:28.981838+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.05967v3","created_at":"2026-05-18T00:46:28.981838+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05967","created_at":"2026-05-18T00:46:28.981838+00:00"},{"alias_kind":"pith_short_12","alias_value":"PNKVGWIO6CYK","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PNKVGWIO6CYK2U56","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PNKVGWIO","created_at":"2026-05-18T12:31:37.085036+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/PNKVGWIO6CYK2U56XPIR6YBLSI","json":"https://pith.science/pith/PNKVGWIO6CYK2U56XPIR6YBLSI.json","graph_json":"https://pith.science/api/pith-number/PNKVGWIO6CYK2U56XPIR6YBLSI/graph.json","events_json":"https://pith.science/api/pith-number/PNKVGWIO6CYK2U56XPIR6YBLSI/events.json","paper":"https://pith.science/paper/PNKVGWIO"},"agent_actions":{"view_html":"https://pith.science/pith/PNKVGWIO6CYK2U56XPIR6YBLSI","download_json":"https://pith.science/pith/PNKVGWIO6CYK2U56XPIR6YBLSI.json","view_paper":"https://pith.science/paper/PNKVGWIO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.05967&json=true","fetch_graph":"https://pith.science/api/pith-number/PNKVGWIO6CYK2U56XPIR6YBLSI/graph.json","fetch_events":"https://pith.science/api/pith-number/PNKVGWIO6CYK2U56XPIR6YBLSI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PNKVGWIO6CYK2U56XPIR6YBLSI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PNKVGWIO6CYK2U56XPIR6YBLSI/action/storage_attestation","attest_author":"https://pith.science/pith/PNKVGWIO6CYK2U56XPIR6YBLSI/action/author_attestation","sign_citation":"https://pith.science/pith/PNKVGWIO6CYK2U56XPIR6YBLSI/action/citation_signature","submit_replication":"https://pith.science/pith/PNKVGWIO6CYK2U56XPIR6YBLSI/action/replication_record"}},"created_at":"2026-05-18T00:46:28.981838+00:00","updated_at":"2026-05-18T00:46:28.981838+00:00"}