{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FUP4HCM5CXPAXOXYWSENEDGTJ5","short_pith_number":"pith:FUP4HCM5","canonical_record":{"source":{"id":"1507.01926","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T19:11:12Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"98e1d8b76fba3a8c0dca20aaf35b1fa8c8928b8acb6bf75d32512b12bee28481","abstract_canon_sha256":"d74d8222989c5b981e3665b822aae1a60699b8c98014053add478c5c1a600fb2"},"schema_version":"1.0"},"canonical_sha256":"2d1fc3899d15de0bbaf8b488d20cd34f6fb2b40f1913422736e4d565e56f178e","source":{"kind":"arxiv","id":"1507.01926","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01926","created_at":"2026-05-18T01:36:22Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01926v2","created_at":"2026-05-18T01:36:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01926","created_at":"2026-05-18T01:36:22Z"},{"alias_kind":"pith_short_12","alias_value":"FUP4HCM5CXPA","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FUP4HCM5CXPAXOXY","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FUP4HCM5","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FUP4HCM5CXPAXOXYWSENEDGTJ5","target":"record","payload":{"canonical_record":{"source":{"id":"1507.01926","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T19:11:12Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"98e1d8b76fba3a8c0dca20aaf35b1fa8c8928b8acb6bf75d32512b12bee28481","abstract_canon_sha256":"d74d8222989c5b981e3665b822aae1a60699b8c98014053add478c5c1a600fb2"},"schema_version":"1.0"},"canonical_sha256":"2d1fc3899d15de0bbaf8b488d20cd34f6fb2b40f1913422736e4d565e56f178e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:22.762655Z","signature_b64":"Fmf1MbSd3snw+JfdOPKvKdh3lVTe5Ujy3j05GvH88csa4O6z72yEJDu81ex9gNlb6fOUrb9Tq5bJis2auxZvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d1fc3899d15de0bbaf8b488d20cd34f6fb2b40f1913422736e4d565e56f178e","last_reissued_at":"2026-05-18T01:36:22.762230Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:22.762230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.01926","source_version":2,"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:36:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GPBmmgPy7z0jL1vINY65ndBRvdK7My/FPCmh7Mx77BXhnDjYcbNYhVeoNEICpwP0LyWy+P7KunB+vsFCa7egAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:49:01.676803Z"},"content_sha256":"0b29f7d35fe5110ff150f9a9ef547de12b1aff2f5726d233b033885824c3e645","schema_version":"1.0","event_id":"sha256:0b29f7d35fe5110ff150f9a9ef547de12b1aff2f5726d233b033885824c3e645"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FUP4HCM5CXPAXOXYWSENEDGTJ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Guy Blelloch, Julian Shun, Niklas Baumstark","submitted_at":"2015-07-07T19:11:12Z","abstract_excerpt":"Motivated by the observation that FIFO-based push-relabel algorithms are able to outperform highest label-based variants on modern, large maximum flow problem instances, we introduce an efficient implementation of the algorithm that uses coarse-grained parallelism to avoid the problems of existing parallel approaches. We demonstrate good relative and absolute speedups of our algorithm on a set of large graph instances taken from real-world applications. On a modern 40-core machine, our parallel implementation outperforms existing sequential implementations by up to a factor of 12 and other par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01926","kind":"arxiv","version":2},"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:36:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yxj4KSNlGo3M5BsJp0/b3PHWJ7lrE1fxXcAUd5wAcBfvaI31nQ1QCHeuDaNaIxArkEBxc97qFBUrOD1o0dpaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:49:01.677153Z"},"content_sha256":"50a05a5ff86f55ccb1ca7feb43fbfef157ad40fcb8fd1cf4e1e352b8994b3972","schema_version":"1.0","event_id":"sha256:50a05a5ff86f55ccb1ca7feb43fbfef157ad40fcb8fd1cf4e1e352b8994b3972"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FUP4HCM5CXPAXOXYWSENEDGTJ5/bundle.json","state_url":"https://pith.science/pith/FUP4HCM5CXPAXOXYWSENEDGTJ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FUP4HCM5CXPAXOXYWSENEDGTJ5/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-01T15:49:01Z","links":{"resolver":"https://pith.science/pith/FUP4HCM5CXPAXOXYWSENEDGTJ5","bundle":"https://pith.science/pith/FUP4HCM5CXPAXOXYWSENEDGTJ5/bundle.json","state":"https://pith.science/pith/FUP4HCM5CXPAXOXYWSENEDGTJ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FUP4HCM5CXPAXOXYWSENEDGTJ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FUP4HCM5CXPAXOXYWSENEDGTJ5","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":"d74d8222989c5b981e3665b822aae1a60699b8c98014053add478c5c1a600fb2","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T19:11:12Z","title_canon_sha256":"98e1d8b76fba3a8c0dca20aaf35b1fa8c8928b8acb6bf75d32512b12bee28481"},"schema_version":"1.0","source":{"id":"1507.01926","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01926","created_at":"2026-05-18T01:36:22Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01926v2","created_at":"2026-05-18T01:36:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01926","created_at":"2026-05-18T01:36:22Z"},{"alias_kind":"pith_short_12","alias_value":"FUP4HCM5CXPA","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FUP4HCM5CXPAXOXY","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FUP4HCM5","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:50a05a5ff86f55ccb1ca7feb43fbfef157ad40fcb8fd1cf4e1e352b8994b3972","target":"graph","created_at":"2026-05-18T01:36:22Z","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":"Motivated by the observation that FIFO-based push-relabel algorithms are able to outperform highest label-based variants on modern, large maximum flow problem instances, we introduce an efficient implementation of the algorithm that uses coarse-grained parallelism to avoid the problems of existing parallel approaches. We demonstrate good relative and absolute speedups of our algorithm on a set of large graph instances taken from real-world applications. On a modern 40-core machine, our parallel implementation outperforms existing sequential implementations by up to a factor of 12 and other par","authors_text":"Guy Blelloch, Julian Shun, Niklas Baumstark","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T19:11:12Z","title":"Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01926","kind":"arxiv","version":2},"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:0b29f7d35fe5110ff150f9a9ef547de12b1aff2f5726d233b033885824c3e645","target":"record","created_at":"2026-05-18T01:36:22Z","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":"d74d8222989c5b981e3665b822aae1a60699b8c98014053add478c5c1a600fb2","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-07T19:11:12Z","title_canon_sha256":"98e1d8b76fba3a8c0dca20aaf35b1fa8c8928b8acb6bf75d32512b12bee28481"},"schema_version":"1.0","source":{"id":"1507.01926","kind":"arxiv","version":2}},"canonical_sha256":"2d1fc3899d15de0bbaf8b488d20cd34f6fb2b40f1913422736e4d565e56f178e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d1fc3899d15de0bbaf8b488d20cd34f6fb2b40f1913422736e4d565e56f178e","first_computed_at":"2026-05-18T01:36:22.762230Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:22.762230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fmf1MbSd3snw+JfdOPKvKdh3lVTe5Ujy3j05GvH88csa4O6z72yEJDu81ex9gNlb6fOUrb9Tq5bJis2auxZvCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:22.762655Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01926","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b29f7d35fe5110ff150f9a9ef547de12b1aff2f5726d233b033885824c3e645","sha256:50a05a5ff86f55ccb1ca7feb43fbfef157ad40fcb8fd1cf4e1e352b8994b3972"],"state_sha256":"8419c50f4f065a6dee1ab2d7dbb12042df5eedcb485d4038d04334f3b11c131e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rSB6Jn8I7DVAtO/TeT5+MWrnxMF3pxGFB146Ma7gLDaMbXgRwNqTUl+2HOwpIB/LWz/QC3UGATHRi6lzQmbFBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:49:01.679495Z","bundle_sha256":"0822c9cab5823153104da343c59227fb55b5b908ef6ee2609cea95e356afcf49"}}