{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7TAHPWX4D4DUVAXGZQEDNXVPRO","short_pith_number":"pith:7TAHPWX4","canonical_record":{"source":{"id":"1504.08251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-30T14:48:15Z","cross_cats_sorted":[],"title_canon_sha256":"ba5e2c543b8e16d0d4e047f5bc03126e82e89f56b421b487b3fd3f77fb52cff4","abstract_canon_sha256":"28b35e5631489990e3b35e21c0a3f451401939722d878e4e92ecb3b88352cda3"},"schema_version":"1.0"},"canonical_sha256":"fcc077dafc1f074a82e6cc0836deaf8b9c0b899a6a24b21ed4a06be668450f05","source":{"kind":"arxiv","id":"1504.08251","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.08251","created_at":"2026-05-18T02:17:22Z"},{"alias_kind":"arxiv_version","alias_value":"1504.08251v1","created_at":"2026-05-18T02:17:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.08251","created_at":"2026-05-18T02:17:22Z"},{"alias_kind":"pith_short_12","alias_value":"7TAHPWX4D4DU","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7TAHPWX4D4DUVAXG","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7TAHPWX4","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7TAHPWX4D4DUVAXGZQEDNXVPRO","target":"record","payload":{"canonical_record":{"source":{"id":"1504.08251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-30T14:48:15Z","cross_cats_sorted":[],"title_canon_sha256":"ba5e2c543b8e16d0d4e047f5bc03126e82e89f56b421b487b3fd3f77fb52cff4","abstract_canon_sha256":"28b35e5631489990e3b35e21c0a3f451401939722d878e4e92ecb3b88352cda3"},"schema_version":"1.0"},"canonical_sha256":"fcc077dafc1f074a82e6cc0836deaf8b9c0b899a6a24b21ed4a06be668450f05","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:22.909668Z","signature_b64":"BW7UfaXF/fXfoixkd1W526CHdHZcTL1mVs6EvyR+YXabKToueKzbkFnrgvoczDFTJfb5oX/fNK/iF8rQ4bcOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcc077dafc1f074a82e6cc0836deaf8b9c0b899a6a24b21ed4a06be668450f05","last_reissued_at":"2026-05-18T02:17:22.909006Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:22.909006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.08251","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-18T02:17:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q5DBzrFNAyA4C+LJo6hmA1264kVlKuaPdn/2DJZhRce90o/yeGoWuxXZeMBr0QABHyQr+DjI6KG1wqzRfzCkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T17:32:01.398463Z"},"content_sha256":"c50301356a1a0ee59b867503f19932fa17623576cb20cdccc391d99b4e5813dd","schema_version":"1.0","event_id":"sha256:c50301356a1a0ee59b867503f19932fa17623576cb20cdccc391d99b4e5813dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7TAHPWX4D4DUVAXGZQEDNXVPRO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bodo Manthey, Kamiel Cornelissen","submitted_at":"2015-04-30T14:48:15Z","abstract_excerpt":"The minimum-cost flow (MCF) problem is a fundamental optimization problem with many applications and seems to be well understood. Over the last half century many algorithms have been developed to solve the MCF problem and these algorithms have varying worst-case bounds on their running time. However, these worst-case bounds are not always a good indication of the algorithms' performance in practice. The Network Simplex (NS) algorithm needs an exponential number of iterations for some instances, but it is considered the best algorithm in practice and performs best in experimental studies. On th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.08251","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-18T02:17:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DcURHxmUXM4zhdaYqF9vVoHjqGaLDETUdOiguPCLLuY3/1UjGz7/zMhnw9ZOz5EqTxZjUT4S5IfBIQhR577HDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T17:32:01.398888Z"},"content_sha256":"66d4942456366276705b54e74ddea388ac84bed7a729517054e57e46172088ce","schema_version":"1.0","event_id":"sha256:66d4942456366276705b54e74ddea388ac84bed7a729517054e57e46172088ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7TAHPWX4D4DUVAXGZQEDNXVPRO/bundle.json","state_url":"https://pith.science/pith/7TAHPWX4D4DUVAXGZQEDNXVPRO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7TAHPWX4D4DUVAXGZQEDNXVPRO/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-22T17:32:01Z","links":{"resolver":"https://pith.science/pith/7TAHPWX4D4DUVAXGZQEDNXVPRO","bundle":"https://pith.science/pith/7TAHPWX4D4DUVAXGZQEDNXVPRO/bundle.json","state":"https://pith.science/pith/7TAHPWX4D4DUVAXGZQEDNXVPRO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7TAHPWX4D4DUVAXGZQEDNXVPRO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7TAHPWX4D4DUVAXGZQEDNXVPRO","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":"28b35e5631489990e3b35e21c0a3f451401939722d878e4e92ecb3b88352cda3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-30T14:48:15Z","title_canon_sha256":"ba5e2c543b8e16d0d4e047f5bc03126e82e89f56b421b487b3fd3f77fb52cff4"},"schema_version":"1.0","source":{"id":"1504.08251","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.08251","created_at":"2026-05-18T02:17:22Z"},{"alias_kind":"arxiv_version","alias_value":"1504.08251v1","created_at":"2026-05-18T02:17:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.08251","created_at":"2026-05-18T02:17:22Z"},{"alias_kind":"pith_short_12","alias_value":"7TAHPWX4D4DU","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7TAHPWX4D4DUVAXG","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7TAHPWX4","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:66d4942456366276705b54e74ddea388ac84bed7a729517054e57e46172088ce","target":"graph","created_at":"2026-05-18T02:17: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":"The minimum-cost flow (MCF) problem is a fundamental optimization problem with many applications and seems to be well understood. Over the last half century many algorithms have been developed to solve the MCF problem and these algorithms have varying worst-case bounds on their running time. However, these worst-case bounds are not always a good indication of the algorithms' performance in practice. The Network Simplex (NS) algorithm needs an exponential number of iterations for some instances, but it is considered the best algorithm in practice and performs best in experimental studies. On th","authors_text":"Bodo Manthey, Kamiel Cornelissen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-30T14:48:15Z","title":"Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.08251","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:c50301356a1a0ee59b867503f19932fa17623576cb20cdccc391d99b4e5813dd","target":"record","created_at":"2026-05-18T02:17: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":"28b35e5631489990e3b35e21c0a3f451401939722d878e4e92ecb3b88352cda3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-30T14:48:15Z","title_canon_sha256":"ba5e2c543b8e16d0d4e047f5bc03126e82e89f56b421b487b3fd3f77fb52cff4"},"schema_version":"1.0","source":{"id":"1504.08251","kind":"arxiv","version":1}},"canonical_sha256":"fcc077dafc1f074a82e6cc0836deaf8b9c0b899a6a24b21ed4a06be668450f05","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcc077dafc1f074a82e6cc0836deaf8b9c0b899a6a24b21ed4a06be668450f05","first_computed_at":"2026-05-18T02:17:22.909006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:22.909006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BW7UfaXF/fXfoixkd1W526CHdHZcTL1mVs6EvyR+YXabKToueKzbkFnrgvoczDFTJfb5oX/fNK/iF8rQ4bcOBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:22.909668Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.08251","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c50301356a1a0ee59b867503f19932fa17623576cb20cdccc391d99b4e5813dd","sha256:66d4942456366276705b54e74ddea388ac84bed7a729517054e57e46172088ce"],"state_sha256":"2976731d6c58b9b341ac9030f38018c5a59cfd60ff541740e99dcefb6f260c31"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MxTdteLkF6sk5Oyo4hkDlVv+4OOHH+rZuYVV+DOmY6OfZDfmcNhYQVLiOvwmDa3242IxV7yK94Z1smS46zofDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T17:32:01.401538Z","bundle_sha256":"059e7317bcc02cb0db6a8ada3faf2ba1580aea288d2567f5c68cab8ee3d0ff8c"}}