{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MV5GOIP7AMQZA7SGXNCRRZDJ52","short_pith_number":"pith:MV5GOIP7","canonical_record":{"source":{"id":"1408.3518","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-15T12:28:09Z","cross_cats_sorted":[],"title_canon_sha256":"bbefcb5fd5a4dcc94d6857150a1fc3e28bf3fa6cbdeb974ffcdb5ee2191ece46","abstract_canon_sha256":"3d589b12b86628be9e8b73a9282e69c004e63e0c60f9ef4fc5742581ce608638"},"schema_version":"1.0"},"canonical_sha256":"657a6721ff0321907e46bb4518e469ee81245f43e94881c6614dace9ac30d336","source":{"kind":"arxiv","id":"1408.3518","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.3518","created_at":"2026-05-18T01:14:45Z"},{"alias_kind":"arxiv_version","alias_value":"1408.3518v3","created_at":"2026-05-18T01:14:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3518","created_at":"2026-05-18T01:14:45Z"},{"alias_kind":"pith_short_12","alias_value":"MV5GOIP7AMQZ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MV5GOIP7AMQZA7SG","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MV5GOIP7","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MV5GOIP7AMQZA7SGXNCRRZDJ52","target":"record","payload":{"canonical_record":{"source":{"id":"1408.3518","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-15T12:28:09Z","cross_cats_sorted":[],"title_canon_sha256":"bbefcb5fd5a4dcc94d6857150a1fc3e28bf3fa6cbdeb974ffcdb5ee2191ece46","abstract_canon_sha256":"3d589b12b86628be9e8b73a9282e69c004e63e0c60f9ef4fc5742581ce608638"},"schema_version":"1.0"},"canonical_sha256":"657a6721ff0321907e46bb4518e469ee81245f43e94881c6614dace9ac30d336","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:45.716088Z","signature_b64":"zmRB6UgYr4C5FGBe3C8Q/SNYpCyqtzB4lupAhibPNzH7F5oFcIJBChhNnZ5xW2t6r/bISBwrWGReIxSInlmhCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"657a6721ff0321907e46bb4518e469ee81245f43e94881c6614dace9ac30d336","last_reissued_at":"2026-05-18T01:14:45.715368Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:45.715368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.3518","source_version":3,"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:14:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oNiN0zrJVYVgXwRFufM10DE+uYmWllGS1siT9uXau2MMwrI89JHJIl8T5xraE9rvBc8PDsYPikz85lqzvF18CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:18:14.494061Z"},"content_sha256":"fc04122fd392855e621e07b972b2b5fb9b0b75f0b003058cb149fce14c13a930","schema_version":"1.0","event_id":"sha256:fc04122fd392855e621e07b972b2b5fb9b0b75f0b003058cb149fce14c13a930"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MV5GOIP7AMQZA7SGXNCRRZDJ52","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds-Karp to Bland and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jesus A. De Loera, Jon Lee, Raymond Hemmecke","submitted_at":"2014-08-15T12:28:09Z","abstract_excerpt":"Motivated by Bland's linear-programming generalization of the renowned Edmonds-Karp efficient refinement of the Ford-Fulkerson maximum-flow algorithm, we discuss three closely-related natural augmentation rules for linear and integer-linear optimization. In several nice situations, we show that polynomially-many augmentation steps suffice to reach an optimum. In particular, when using \"discrete steepest-descent augmentations\" (i.e., directions with the best ratio of cost improvement per unit 1-norm length), we show that the number of augmentation steps is bounded by the number of elements in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3518","kind":"arxiv","version":3},"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:14:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I0EzJ71y/DXJSp9FG8/KjT79SzDpy3LTcRW3CtNMt2Hh/pZfjoTTFMB1TvR2FOcJvKsT9D+oZmudKdKchKUHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:18:14.494469Z"},"content_sha256":"f7d3635ab7964c3e47c1a167898bf9649c26913064f9894bdaad86d55a8c05a1","schema_version":"1.0","event_id":"sha256:f7d3635ab7964c3e47c1a167898bf9649c26913064f9894bdaad86d55a8c05a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MV5GOIP7AMQZA7SGXNCRRZDJ52/bundle.json","state_url":"https://pith.science/pith/MV5GOIP7AMQZA7SGXNCRRZDJ52/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MV5GOIP7AMQZA7SGXNCRRZDJ52/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-28T07:18:14Z","links":{"resolver":"https://pith.science/pith/MV5GOIP7AMQZA7SGXNCRRZDJ52","bundle":"https://pith.science/pith/MV5GOIP7AMQZA7SGXNCRRZDJ52/bundle.json","state":"https://pith.science/pith/MV5GOIP7AMQZA7SGXNCRRZDJ52/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MV5GOIP7AMQZA7SGXNCRRZDJ52/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MV5GOIP7AMQZA7SGXNCRRZDJ52","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":"3d589b12b86628be9e8b73a9282e69c004e63e0c60f9ef4fc5742581ce608638","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-15T12:28:09Z","title_canon_sha256":"bbefcb5fd5a4dcc94d6857150a1fc3e28bf3fa6cbdeb974ffcdb5ee2191ece46"},"schema_version":"1.0","source":{"id":"1408.3518","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.3518","created_at":"2026-05-18T01:14:45Z"},{"alias_kind":"arxiv_version","alias_value":"1408.3518v3","created_at":"2026-05-18T01:14:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3518","created_at":"2026-05-18T01:14:45Z"},{"alias_kind":"pith_short_12","alias_value":"MV5GOIP7AMQZ","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MV5GOIP7AMQZA7SG","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MV5GOIP7","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:f7d3635ab7964c3e47c1a167898bf9649c26913064f9894bdaad86d55a8c05a1","target":"graph","created_at":"2026-05-18T01:14:45Z","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 Bland's linear-programming generalization of the renowned Edmonds-Karp efficient refinement of the Ford-Fulkerson maximum-flow algorithm, we discuss three closely-related natural augmentation rules for linear and integer-linear optimization. In several nice situations, we show that polynomially-many augmentation steps suffice to reach an optimum. In particular, when using \"discrete steepest-descent augmentations\" (i.e., directions with the best ratio of cost improvement per unit 1-norm length), we show that the number of augmentation steps is bounded by the number of elements in t","authors_text":"Jesus A. De Loera, Jon Lee, Raymond Hemmecke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-15T12:28:09Z","title":"On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds-Karp to Bland and Beyond"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3518","kind":"arxiv","version":3},"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:fc04122fd392855e621e07b972b2b5fb9b0b75f0b003058cb149fce14c13a930","target":"record","created_at":"2026-05-18T01:14:45Z","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":"3d589b12b86628be9e8b73a9282e69c004e63e0c60f9ef4fc5742581ce608638","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-15T12:28:09Z","title_canon_sha256":"bbefcb5fd5a4dcc94d6857150a1fc3e28bf3fa6cbdeb974ffcdb5ee2191ece46"},"schema_version":"1.0","source":{"id":"1408.3518","kind":"arxiv","version":3}},"canonical_sha256":"657a6721ff0321907e46bb4518e469ee81245f43e94881c6614dace9ac30d336","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"657a6721ff0321907e46bb4518e469ee81245f43e94881c6614dace9ac30d336","first_computed_at":"2026-05-18T01:14:45.715368Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:45.715368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zmRB6UgYr4C5FGBe3C8Q/SNYpCyqtzB4lupAhibPNzH7F5oFcIJBChhNnZ5xW2t6r/bISBwrWGReIxSInlmhCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:45.716088Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.3518","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc04122fd392855e621e07b972b2b5fb9b0b75f0b003058cb149fce14c13a930","sha256:f7d3635ab7964c3e47c1a167898bf9649c26913064f9894bdaad86d55a8c05a1"],"state_sha256":"971fd98ac4afa8c31b8529d9330f309eeed575882e2bff8ca4f4f65fc08edf04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dqu2X7OCC3ohUoQ22Q1ALRLNuyi0gv+oonvjJrMWmoPZ58znPTUqvnHSa0TDEi8cjU0W/EulHl81Vkh7DNwHCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:18:14.496775Z","bundle_sha256":"ca7c71b55d4f46f884109d37c3cdbe7e5eaa3c4cf1528ef39a2e31d6f4d68904"}}