{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MVRHULFSBB2XO66EI6GCUHNB2J","short_pith_number":"pith:MVRHULFS","canonical_record":{"source":{"id":"1501.05493","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-22T13:43:01Z","cross_cats_sorted":[],"title_canon_sha256":"43868c3d74b8a2002d951948fdfa7a1bc5b063e4e78556a4240f00388eb86d48","abstract_canon_sha256":"cac6d264393d1a748ca9e47493423618cdea9ed5865dd41e3296553ac67764ba"},"schema_version":"1.0"},"canonical_sha256":"65627a2cb20875777bc4478c2a1da1d2481bc78100d538752bab1a45530138d9","source":{"kind":"arxiv","id":"1501.05493","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05493","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05493v2","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05493","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"pith_short_12","alias_value":"MVRHULFSBB2X","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MVRHULFSBB2XO66E","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MVRHULFS","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MVRHULFSBB2XO66EI6GCUHNB2J","target":"record","payload":{"canonical_record":{"source":{"id":"1501.05493","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-22T13:43:01Z","cross_cats_sorted":[],"title_canon_sha256":"43868c3d74b8a2002d951948fdfa7a1bc5b063e4e78556a4240f00388eb86d48","abstract_canon_sha256":"cac6d264393d1a748ca9e47493423618cdea9ed5865dd41e3296553ac67764ba"},"schema_version":"1.0"},"canonical_sha256":"65627a2cb20875777bc4478c2a1da1d2481bc78100d538752bab1a45530138d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:07.760193Z","signature_b64":"b4r7woG7/JUUxqATThyfVcBP/m6OyfchUnIvxoICUgH/bAcp1lWseL96EDY2tnoY+jKMWqf3whX2S+hX95uVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65627a2cb20875777bc4478c2a1da1d2481bc78100d538752bab1a45530138d9","last_reissued_at":"2026-05-18T01:33:07.759786Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:07.759786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.05493","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:33:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LqS5W8a3h3ZyqM3G/cOpgBjDAcLoJCujiONIL10XOL3H8SjS1mNvJ5RHx+yfd3qxEdo9AdFwNfP/UG7nNc7jCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:39:36.268704Z"},"content_sha256":"b153e80d2757a2d36e2f0a26f38eec877d9174fc50c36dfd413df2af71d571b3","schema_version":"1.0","event_id":"sha256:b153e80d2757a2d36e2f0a26f38eec877d9174fc50c36dfd413df2af71d571b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MVRHULFSBB2XO66EI6GCUHNB2J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Smoothed Analysis of the Successive Shortest Path Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bodo Manthey, Clemens R\\\"osner, Heiko R\\\"oglin, Kamiel Cornelissen, Tobias Brunsch","submitted_at":"2015-01-22T13:43:01Z","abstract_excerpt":"The minimum-cost flow problem is a classic problem in combinatorial optimization with various applications. Several pseudo-polynomial, polynomial, and strongly polynomial algorithms have been developed in the past decades, and it seems that both the problem and the algorithms are well understood. However, some of the algorithms' running times observed in empirical studies contrast the running times obtained by worst-case analysis not only in the order of magnitude but also in the ranking when compared to each other. For example, the Successive Shortest Path (SSP) algorithm, which has an expone"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05493","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:33:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R2bvwhCmug7kn/tOPiRh2kvjrrkcT/qY/FSmHLvI2dmJHqVEYZxvS80XODDR+PTyAEek0ue3avAmY6DjeHtDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:39:36.269394Z"},"content_sha256":"147c3271fc217ec05cb10618f161cc2677d37f13bc6aa2098a819c19a396c4c6","schema_version":"1.0","event_id":"sha256:147c3271fc217ec05cb10618f161cc2677d37f13bc6aa2098a819c19a396c4c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MVRHULFSBB2XO66EI6GCUHNB2J/bundle.json","state_url":"https://pith.science/pith/MVRHULFSBB2XO66EI6GCUHNB2J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MVRHULFSBB2XO66EI6GCUHNB2J/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:39:36Z","links":{"resolver":"https://pith.science/pith/MVRHULFSBB2XO66EI6GCUHNB2J","bundle":"https://pith.science/pith/MVRHULFSBB2XO66EI6GCUHNB2J/bundle.json","state":"https://pith.science/pith/MVRHULFSBB2XO66EI6GCUHNB2J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MVRHULFSBB2XO66EI6GCUHNB2J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MVRHULFSBB2XO66EI6GCUHNB2J","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":"cac6d264393d1a748ca9e47493423618cdea9ed5865dd41e3296553ac67764ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-22T13:43:01Z","title_canon_sha256":"43868c3d74b8a2002d951948fdfa7a1bc5b063e4e78556a4240f00388eb86d48"},"schema_version":"1.0","source":{"id":"1501.05493","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05493","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05493v2","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05493","created_at":"2026-05-18T01:33:07Z"},{"alias_kind":"pith_short_12","alias_value":"MVRHULFSBB2X","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MVRHULFSBB2XO66E","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MVRHULFS","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:147c3271fc217ec05cb10618f161cc2677d37f13bc6aa2098a819c19a396c4c6","target":"graph","created_at":"2026-05-18T01:33:07Z","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 problem is a classic problem in combinatorial optimization with various applications. Several pseudo-polynomial, polynomial, and strongly polynomial algorithms have been developed in the past decades, and it seems that both the problem and the algorithms are well understood. However, some of the algorithms' running times observed in empirical studies contrast the running times obtained by worst-case analysis not only in the order of magnitude but also in the ranking when compared to each other. For example, the Successive Shortest Path (SSP) algorithm, which has an expone","authors_text":"Bodo Manthey, Clemens R\\\"osner, Heiko R\\\"oglin, Kamiel Cornelissen, Tobias Brunsch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-22T13:43:01Z","title":"Smoothed Analysis of the Successive Shortest Path Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05493","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:b153e80d2757a2d36e2f0a26f38eec877d9174fc50c36dfd413df2af71d571b3","target":"record","created_at":"2026-05-18T01:33:07Z","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":"cac6d264393d1a748ca9e47493423618cdea9ed5865dd41e3296553ac67764ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-22T13:43:01Z","title_canon_sha256":"43868c3d74b8a2002d951948fdfa7a1bc5b063e4e78556a4240f00388eb86d48"},"schema_version":"1.0","source":{"id":"1501.05493","kind":"arxiv","version":2}},"canonical_sha256":"65627a2cb20875777bc4478c2a1da1d2481bc78100d538752bab1a45530138d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65627a2cb20875777bc4478c2a1da1d2481bc78100d538752bab1a45530138d9","first_computed_at":"2026-05-18T01:33:07.759786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:07.759786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b4r7woG7/JUUxqATThyfVcBP/m6OyfchUnIvxoICUgH/bAcp1lWseL96EDY2tnoY+jKMWqf3whX2S+hX95uVDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:07.760193Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.05493","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b153e80d2757a2d36e2f0a26f38eec877d9174fc50c36dfd413df2af71d571b3","sha256:147c3271fc217ec05cb10618f161cc2677d37f13bc6aa2098a819c19a396c4c6"],"state_sha256":"199e85982a3b9c53306581547565ecaea5df7ce8e5698caca40b29aaf9912656"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EAH5DZ1ULafaHUeF+vJ0lIs2zioNEZWFr8fHXnTftUTndd6yerYUNxy3gx37Jj/pGHmx7Lp9rGpS+g2PKCqBDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:39:36.273071Z","bundle_sha256":"26abdda0b6fc8bccb2038f22103d1366a7592861d21625d3802f69fd52a5eff5"}}