{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:R55UWJDRGO2BNUFIWFGYTWMG4V","short_pith_number":"pith:R55UWJDR","canonical_record":{"source":{"id":"1207.6381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-26T19:33:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8a4827fea5077346357518a34c568e11d903eefa6b183467beb70f7204d962ed","abstract_canon_sha256":"a588c2104260bca6a51568ad9e3386b125b090f31c80c7b4bdebd26ac1a40dec"},"schema_version":"1.0"},"canonical_sha256":"8f7b4b247133b416d0a8b14d89d986e5694431a024c35953faf83d4adee7c11f","source":{"kind":"arxiv","id":"1207.6381","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6381","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6381v1","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6381","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"pith_short_12","alias_value":"R55UWJDRGO2B","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"R55UWJDRGO2BNUFI","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"R55UWJDR","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:R55UWJDRGO2BNUFIWFGYTWMG4V","target":"record","payload":{"canonical_record":{"source":{"id":"1207.6381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-26T19:33:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8a4827fea5077346357518a34c568e11d903eefa6b183467beb70f7204d962ed","abstract_canon_sha256":"a588c2104260bca6a51568ad9e3386b125b090f31c80c7b4bdebd26ac1a40dec"},"schema_version":"1.0"},"canonical_sha256":"8f7b4b247133b416d0a8b14d89d986e5694431a024c35953faf83d4adee7c11f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:50:00.408588Z","signature_b64":"qYgg/lKHgR8lOSqqQmK142Fy56xH2243iYK5347Noxz8GPhREZkOzOwsokU1ciLBVpRtbSVuOcDJLzatzCuxBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f7b4b247133b416d0a8b14d89d986e5694431a024c35953faf83d4adee7c11f","last_reissued_at":"2026-05-18T03:50:00.408131Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:50:00.408131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.6381","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:50:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LzXgU/WVfR5Unq8MtoyN2poKmT4Ih+pQ68gp5YwJcmRz2BNNUTqmZJenRG34+k4D1UWjj6x+5pveqokYZi/hCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:56:51.093461Z"},"content_sha256":"496a075b4c8527109f6e8a9efc35e63cba3f0d2c09e65b291a7a777152fefec1","schema_version":"1.0","event_id":"sha256:496a075b4c8527109f6e8a9efc35e63cba3f0d2c09e65b291a7a777152fefec1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:R55UWJDRGO2BNUFIWFGYTWMG4V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient implementations of minimum-cost flow algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"P. Kov\\'acs, Z. Kir\\'aly","submitted_at":"2012-07-26T19:33:22Z","abstract_excerpt":"This paper presents efficient implementations of several algorithms for solving the minimum-cost network flow problem. Various practical heuristics and other important implementation aspects are also discussed. A novel result of this work is the application of Goldberg's recent partial augment-relabel method in the cost-scaling algorithm. The presented implementations are available as part of the LEMON open source C++ optimization library (\\url{http://lemon.cs.elte.hu/}). The performance of these codes is compared to well-known and efficient minimum-cost flow solvers, namely CS2, RelaxIV, MCF,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6381","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:50:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S9FqzrQ0JKkr7S6EbF8HiY9964FigQSMYZuyidCv4eyvxR+jmUZuhsTsPlOPWHK/N4O4Fx5zBnNFRfkuKuv4Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T21:56:51.093823Z"},"content_sha256":"ab6ab80ea317edc406404e5c1a9d1144a4ab5f48d314b962c2589549665be12b","schema_version":"1.0","event_id":"sha256:ab6ab80ea317edc406404e5c1a9d1144a4ab5f48d314b962c2589549665be12b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R55UWJDRGO2BNUFIWFGYTWMG4V/bundle.json","state_url":"https://pith.science/pith/R55UWJDRGO2BNUFIWFGYTWMG4V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R55UWJDRGO2BNUFIWFGYTWMG4V/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-10T21:56:51Z","links":{"resolver":"https://pith.science/pith/R55UWJDRGO2BNUFIWFGYTWMG4V","bundle":"https://pith.science/pith/R55UWJDRGO2BNUFIWFGYTWMG4V/bundle.json","state":"https://pith.science/pith/R55UWJDRGO2BNUFIWFGYTWMG4V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R55UWJDRGO2BNUFIWFGYTWMG4V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:R55UWJDRGO2BNUFIWFGYTWMG4V","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":"a588c2104260bca6a51568ad9e3386b125b090f31c80c7b4bdebd26ac1a40dec","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-26T19:33:22Z","title_canon_sha256":"8a4827fea5077346357518a34c568e11d903eefa6b183467beb70f7204d962ed"},"schema_version":"1.0","source":{"id":"1207.6381","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.6381","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"arxiv_version","alias_value":"1207.6381v1","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6381","created_at":"2026-05-18T03:50:00Z"},{"alias_kind":"pith_short_12","alias_value":"R55UWJDRGO2B","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"R55UWJDRGO2BNUFI","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"R55UWJDR","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:ab6ab80ea317edc406404e5c1a9d1144a4ab5f48d314b962c2589549665be12b","target":"graph","created_at":"2026-05-18T03:50:00Z","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":"This paper presents efficient implementations of several algorithms for solving the minimum-cost network flow problem. Various practical heuristics and other important implementation aspects are also discussed. A novel result of this work is the application of Goldberg's recent partial augment-relabel method in the cost-scaling algorithm. The presented implementations are available as part of the LEMON open source C++ optimization library (\\url{http://lemon.cs.elte.hu/}). The performance of these codes is compared to well-known and efficient minimum-cost flow solvers, namely CS2, RelaxIV, MCF,","authors_text":"P. Kov\\'acs, Z. Kir\\'aly","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-26T19:33:22Z","title":"Efficient implementations of minimum-cost flow algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6381","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:496a075b4c8527109f6e8a9efc35e63cba3f0d2c09e65b291a7a777152fefec1","target":"record","created_at":"2026-05-18T03:50:00Z","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":"a588c2104260bca6a51568ad9e3386b125b090f31c80c7b4bdebd26ac1a40dec","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-26T19:33:22Z","title_canon_sha256":"8a4827fea5077346357518a34c568e11d903eefa6b183467beb70f7204d962ed"},"schema_version":"1.0","source":{"id":"1207.6381","kind":"arxiv","version":1}},"canonical_sha256":"8f7b4b247133b416d0a8b14d89d986e5694431a024c35953faf83d4adee7c11f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f7b4b247133b416d0a8b14d89d986e5694431a024c35953faf83d4adee7c11f","first_computed_at":"2026-05-18T03:50:00.408131Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:50:00.408131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qYgg/lKHgR8lOSqqQmK142Fy56xH2243iYK5347Noxz8GPhREZkOzOwsokU1ciLBVpRtbSVuOcDJLzatzCuxBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:50:00.408588Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.6381","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:496a075b4c8527109f6e8a9efc35e63cba3f0d2c09e65b291a7a777152fefec1","sha256:ab6ab80ea317edc406404e5c1a9d1144a4ab5f48d314b962c2589549665be12b"],"state_sha256":"d29c93cdefa3ea1278e5ef931dc0dd0707492dcac108e852cdea3df79662446e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g0Gk8jV4hKSUmhp47M6mhyG8oCUn4VJKaBkJ/25ENFb6LQ80dnMk7vazsJPgLQQZAx8ia38YWcVsitZ+vF4BBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T21:56:51.095812Z","bundle_sha256":"8e346620c6f780f46e355d2ff83fc34d1f5636d718af45851f68a26e8c62e7ac"}}