{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZWBOKMOATVGZYH4J7UHASZFWMN","short_pith_number":"pith:ZWBOKMOA","schema_version":"1.0","canonical_sha256":"cd82e531c09d4d9c1f89fd0e0964b6634a8dc37b7a3d320ca4b242ee0487b92d","source":{"kind":"arxiv","id":"1310.4645","version":1},"attestation_state":"computed","paper":{"title":"A Greedy Algorithm for Optimally Pipelining a Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Bradley R. Lowery, Julien Langou","submitted_at":"2013-10-17T10:12:25Z","abstract_excerpt":"Collective communications are ubiquitous in parallel applications. We present two new algorithms for performing a reduction. The operation associated with our reduction needs to be associative and commutative. The two algorithms are developed under two different communication models (unidirectional and bidirectional). Both algorithms use a greedy scheduling scheme. For a unidirectional, fully connected network, we prove that our greedy algorithm is optimal when some realistic assumptions are respected. Previous algorithms fit the same assumptions and are only appropriate for some given configu"},"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":"1310.4645","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-10-17T10:12:25Z","cross_cats_sorted":[],"title_canon_sha256":"cfb67b70c8cff0aa1dc2e4e27af500703dbcc57f44d2cb4f7c2519e9dbed70d7","abstract_canon_sha256":"6ca80946e6724d51de3e25acd568da02839fd99bff86419e87e47ee46ce4a276"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:13.474643Z","signature_b64":"3a430q1G7PL+Qm5Spa+r5/HuwFt4+S/EgX0R62PWyeFQL6M2krBkPs6fNSY1XoMaMkIuIDkNnocvJ8SuVJSHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd82e531c09d4d9c1f89fd0e0964b6634a8dc37b7a3d320ca4b242ee0487b92d","last_reissued_at":"2026-05-18T03:10:13.474106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:13.474106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Greedy Algorithm for Optimally Pipelining a Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Bradley R. Lowery, Julien Langou","submitted_at":"2013-10-17T10:12:25Z","abstract_excerpt":"Collective communications are ubiquitous in parallel applications. We present two new algorithms for performing a reduction. The operation associated with our reduction needs to be associative and commutative. The two algorithms are developed under two different communication models (unidirectional and bidirectional). Both algorithms use a greedy scheduling scheme. For a unidirectional, fully connected network, we prove that our greedy algorithm is optimal when some realistic assumptions are respected. Previous algorithms fit the same assumptions and are only appropriate for some given configu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4645","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1310.4645","created_at":"2026-05-18T03:10:13.474183+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.4645v1","created_at":"2026-05-18T03:10:13.474183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4645","created_at":"2026-05-18T03:10:13.474183+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZWBOKMOATVGZ","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZWBOKMOATVGZYH4J","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZWBOKMOA","created_at":"2026-05-18T12:28:09.283467+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/ZWBOKMOATVGZYH4J7UHASZFWMN","json":"https://pith.science/pith/ZWBOKMOATVGZYH4J7UHASZFWMN.json","graph_json":"https://pith.science/api/pith-number/ZWBOKMOATVGZYH4J7UHASZFWMN/graph.json","events_json":"https://pith.science/api/pith-number/ZWBOKMOATVGZYH4J7UHASZFWMN/events.json","paper":"https://pith.science/paper/ZWBOKMOA"},"agent_actions":{"view_html":"https://pith.science/pith/ZWBOKMOATVGZYH4J7UHASZFWMN","download_json":"https://pith.science/pith/ZWBOKMOATVGZYH4J7UHASZFWMN.json","view_paper":"https://pith.science/paper/ZWBOKMOA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.4645&json=true","fetch_graph":"https://pith.science/api/pith-number/ZWBOKMOATVGZYH4J7UHASZFWMN/graph.json","fetch_events":"https://pith.science/api/pith-number/ZWBOKMOATVGZYH4J7UHASZFWMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZWBOKMOATVGZYH4J7UHASZFWMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZWBOKMOATVGZYH4J7UHASZFWMN/action/storage_attestation","attest_author":"https://pith.science/pith/ZWBOKMOATVGZYH4J7UHASZFWMN/action/author_attestation","sign_citation":"https://pith.science/pith/ZWBOKMOATVGZYH4J7UHASZFWMN/action/citation_signature","submit_replication":"https://pith.science/pith/ZWBOKMOATVGZYH4J7UHASZFWMN/action/replication_record"}},"created_at":"2026-05-18T03:10:13.474183+00:00","updated_at":"2026-05-18T03:10:13.474183+00:00"}