{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ZWBOKMOATVGZYH4J7UHASZFWMN","short_pith_number":"pith:ZWBOKMOA","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"},"canonical_sha256":"cd82e531c09d4d9c1f89fd0e0964b6634a8dc37b7a3d320ca4b242ee0487b92d","source":{"kind":"arxiv","id":"1310.4645","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.4645","created_at":"2026-05-18T03:10:13Z"},{"alias_kind":"arxiv_version","alias_value":"1310.4645v1","created_at":"2026-05-18T03:10:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4645","created_at":"2026-05-18T03:10:13Z"},{"alias_kind":"pith_short_12","alias_value":"ZWBOKMOATVGZ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZWBOKMOATVGZYH4J","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZWBOKMOA","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ZWBOKMOATVGZYH4J7UHASZFWMN","target":"record","payload":{"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"},"canonical_sha256":"cd82e531c09d4d9c1f89fd0e0964b6634a8dc37b7a3d320ca4b242ee0487b92d","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"},"source_kind":"arxiv","source_id":"1310.4645","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-18T03:10:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zeff4DITQqDx6Q9CnLJ5Z088yayRkt+dS9r1PCOroofzenlSlDV832X2lZX9sZ2dXYxEOHcFu8GZGoNll4RDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:37:51.003005Z"},"content_sha256":"4c7bce18cf068e1b1fe913e671b9c4ed89468ec404ad6b8aad77325be78d2cae","schema_version":"1.0","event_id":"sha256:4c7bce18cf068e1b1fe913e671b9c4ed89468ec404ad6b8aad77325be78d2cae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ZWBOKMOATVGZYH4J7UHASZFWMN","target":"graph","payload":{"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"},"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-18T03:10:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P6bnXcAOmVmN9YzhXk2wt29fnFdJoCopr2tWmrcxWk/kLxcR7cPe7wHwkz3+nWtDXUH1OHuv2+45W3lEObgOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:37:51.003556Z"},"content_sha256":"5c657ea0f8a00e67410784c624320975494cf5b02c96b4ed9843c3096397aa53","schema_version":"1.0","event_id":"sha256:5c657ea0f8a00e67410784c624320975494cf5b02c96b4ed9843c3096397aa53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZWBOKMOATVGZYH4J7UHASZFWMN/bundle.json","state_url":"https://pith.science/pith/ZWBOKMOATVGZYH4J7UHASZFWMN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZWBOKMOATVGZYH4J7UHASZFWMN/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-26T21:37:51Z","links":{"resolver":"https://pith.science/pith/ZWBOKMOATVGZYH4J7UHASZFWMN","bundle":"https://pith.science/pith/ZWBOKMOATVGZYH4J7UHASZFWMN/bundle.json","state":"https://pith.science/pith/ZWBOKMOATVGZYH4J7UHASZFWMN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZWBOKMOATVGZYH4J7UHASZFWMN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZWBOKMOATVGZYH4J7UHASZFWMN","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":"6ca80946e6724d51de3e25acd568da02839fd99bff86419e87e47ee46ce4a276","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-10-17T10:12:25Z","title_canon_sha256":"cfb67b70c8cff0aa1dc2e4e27af500703dbcc57f44d2cb4f7c2519e9dbed70d7"},"schema_version":"1.0","source":{"id":"1310.4645","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.4645","created_at":"2026-05-18T03:10:13Z"},{"alias_kind":"arxiv_version","alias_value":"1310.4645v1","created_at":"2026-05-18T03:10:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4645","created_at":"2026-05-18T03:10:13Z"},{"alias_kind":"pith_short_12","alias_value":"ZWBOKMOATVGZ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZWBOKMOATVGZYH4J","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZWBOKMOA","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:5c657ea0f8a00e67410784c624320975494cf5b02c96b4ed9843c3096397aa53","target":"graph","created_at":"2026-05-18T03:10:13Z","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":"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","authors_text":"Bradley R. Lowery, Julien Langou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-10-17T10:12:25Z","title":"A Greedy Algorithm for Optimally Pipelining a Reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4645","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:4c7bce18cf068e1b1fe913e671b9c4ed89468ec404ad6b8aad77325be78d2cae","target":"record","created_at":"2026-05-18T03:10:13Z","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":"6ca80946e6724d51de3e25acd568da02839fd99bff86419e87e47ee46ce4a276","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-10-17T10:12:25Z","title_canon_sha256":"cfb67b70c8cff0aa1dc2e4e27af500703dbcc57f44d2cb4f7c2519e9dbed70d7"},"schema_version":"1.0","source":{"id":"1310.4645","kind":"arxiv","version":1}},"canonical_sha256":"cd82e531c09d4d9c1f89fd0e0964b6634a8dc37b7a3d320ca4b242ee0487b92d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd82e531c09d4d9c1f89fd0e0964b6634a8dc37b7a3d320ca4b242ee0487b92d","first_computed_at":"2026-05-18T03:10:13.474106Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:13.474106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3a430q1G7PL+Qm5Spa+r5/HuwFt4+S/EgX0R62PWyeFQL6M2krBkPs6fNSY1XoMaMkIuIDkNnocvJ8SuVJSHCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:13.474643Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.4645","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c7bce18cf068e1b1fe913e671b9c4ed89468ec404ad6b8aad77325be78d2cae","sha256:5c657ea0f8a00e67410784c624320975494cf5b02c96b4ed9843c3096397aa53"],"state_sha256":"bc884fde0110b2480707056124e1140969ac11bf10db4fe7db233df2d48bbb58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yf8BnFtf2TsDcIjzezVCOBMA+8+2tefDFIKJxOkocDX60SYo9NeaEuR8FbS7qTAF9y88wLTWW3lONNTdJxo0Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:37:51.006950Z","bundle_sha256":"23142dd8b6648bcc25b08add475a17dbf32b2f383c0452d17b364e620c66cd50"}}