{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FCI25PF7UANGAGR3TXBBPDQJDA","short_pith_number":"pith:FCI25PF7","canonical_record":{"source":{"id":"1307.6809","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-25T16:33:52Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"c02fcbcafd9676320b3675c4234d79fd35cf3e832c47084642566198c1a9cd8f","abstract_canon_sha256":"c1df9fde2fb2236a5fee104ea49bfd02b71be6a49da3518ed2518e983d9617bd"},"schema_version":"1.0"},"canonical_sha256":"2891aebcbfa01a601a3b9dc2178e09180b23765b0cf68171237261ccf83048ff","source":{"kind":"arxiv","id":"1307.6809","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6809","created_at":"2026-05-18T01:19:55Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6809v4","created_at":"2026-05-18T01:19:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6809","created_at":"2026-05-18T01:19:55Z"},{"alias_kind":"pith_short_12","alias_value":"FCI25PF7UANG","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FCI25PF7UANGAGR3","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FCI25PF7","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FCI25PF7UANGAGR3TXBBPDQJDA","target":"record","payload":{"canonical_record":{"source":{"id":"1307.6809","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-25T16:33:52Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"c02fcbcafd9676320b3675c4234d79fd35cf3e832c47084642566198c1a9cd8f","abstract_canon_sha256":"c1df9fde2fb2236a5fee104ea49bfd02b71be6a49da3518ed2518e983d9617bd"},"schema_version":"1.0"},"canonical_sha256":"2891aebcbfa01a601a3b9dc2178e09180b23765b0cf68171237261ccf83048ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:55.791757Z","signature_b64":"hqG8gvHEZmwXxYiJAYvwmbj38ernGfgzGv1Er0vT3L/JbK72HIhoLvBL84q0es8gz02DNKQ3J3Cgp4avKmqgCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2891aebcbfa01a601a3b9dc2178e09180b23765b0cf68171237261ccf83048ff","last_reissued_at":"2026-05-18T01:19:55.791204Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:55.791204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.6809","source_version":4,"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:19:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6RM1OGwM/jR6lPS5t5NuUIQr4YlCI7yuuXmBYKPzSC18YjMl0u7wAGj7F0M8QbPj/0xsG0rqSSFQcIAa93pCBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T14:21:42.190362Z"},"content_sha256":"1a2f3860e1296a596fe7d1a18450607371fc88facbe9c03c36f1241f05c52078","schema_version":"1.0","event_id":"sha256:1a2f3860e1296a596fe7d1a18450607371fc88facbe9c03c36f1241f05c52078"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FCI25PF7UANGAGR3TXBBPDQJDA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A strongly polynomial algorithm for generalized flow maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"cs.DS","authors_text":"L\\'aszl\\'o A. V\\'egh","submitted_at":"2013-07-25T16:33:52Z","abstract_excerpt":"A strongly polynomial algorithm is given for the generalized flow maximization problem. It uses a new variant of the scaling technique, called continuous scaling. The main measure of progress is that within a strongly polynomial number of steps, an arc can be identified that must be tight in every dual optimal solution, and thus can be contracted. As a consequence of the result, we also obtain a strongly polynomial algorithm for the linear feasibility problem with at most two nonzero entries per column in the constraint matrix."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6809","kind":"arxiv","version":4},"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:19:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ozwxyV4/fwvS2Nw5kUnTXz4/PfQpEiyNVV3yLZt/utKS0zfmxIZ+F2dM8BiHPAMaufGwkvwhCSRX9ahtVxFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T14:21:42.190747Z"},"content_sha256":"9da04c8563c4687e842e489b0b17e9af6ff7a3c02dec0d3f9ba92af04cc0c920","schema_version":"1.0","event_id":"sha256:9da04c8563c4687e842e489b0b17e9af6ff7a3c02dec0d3f9ba92af04cc0c920"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FCI25PF7UANGAGR3TXBBPDQJDA/bundle.json","state_url":"https://pith.science/pith/FCI25PF7UANGAGR3TXBBPDQJDA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FCI25PF7UANGAGR3TXBBPDQJDA/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-27T14:21:42Z","links":{"resolver":"https://pith.science/pith/FCI25PF7UANGAGR3TXBBPDQJDA","bundle":"https://pith.science/pith/FCI25PF7UANGAGR3TXBBPDQJDA/bundle.json","state":"https://pith.science/pith/FCI25PF7UANGAGR3TXBBPDQJDA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FCI25PF7UANGAGR3TXBBPDQJDA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FCI25PF7UANGAGR3TXBBPDQJDA","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":"c1df9fde2fb2236a5fee104ea49bfd02b71be6a49da3518ed2518e983d9617bd","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-25T16:33:52Z","title_canon_sha256":"c02fcbcafd9676320b3675c4234d79fd35cf3e832c47084642566198c1a9cd8f"},"schema_version":"1.0","source":{"id":"1307.6809","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.6809","created_at":"2026-05-18T01:19:55Z"},{"alias_kind":"arxiv_version","alias_value":"1307.6809v4","created_at":"2026-05-18T01:19:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6809","created_at":"2026-05-18T01:19:55Z"},{"alias_kind":"pith_short_12","alias_value":"FCI25PF7UANG","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FCI25PF7UANGAGR3","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FCI25PF7","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:9da04c8563c4687e842e489b0b17e9af6ff7a3c02dec0d3f9ba92af04cc0c920","target":"graph","created_at":"2026-05-18T01:19:55Z","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":"A strongly polynomial algorithm is given for the generalized flow maximization problem. It uses a new variant of the scaling technique, called continuous scaling. The main measure of progress is that within a strongly polynomial number of steps, an arc can be identified that must be tight in every dual optimal solution, and thus can be contracted. As a consequence of the result, we also obtain a strongly polynomial algorithm for the linear feasibility problem with at most two nonzero entries per column in the constraint matrix.","authors_text":"L\\'aszl\\'o A. V\\'egh","cross_cats":["cs.DM","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-25T16:33:52Z","title":"A strongly polynomial algorithm for generalized flow maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.6809","kind":"arxiv","version":4},"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:1a2f3860e1296a596fe7d1a18450607371fc88facbe9c03c36f1241f05c52078","target":"record","created_at":"2026-05-18T01:19:55Z","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":"c1df9fde2fb2236a5fee104ea49bfd02b71be6a49da3518ed2518e983d9617bd","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-25T16:33:52Z","title_canon_sha256":"c02fcbcafd9676320b3675c4234d79fd35cf3e832c47084642566198c1a9cd8f"},"schema_version":"1.0","source":{"id":"1307.6809","kind":"arxiv","version":4}},"canonical_sha256":"2891aebcbfa01a601a3b9dc2178e09180b23765b0cf68171237261ccf83048ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2891aebcbfa01a601a3b9dc2178e09180b23765b0cf68171237261ccf83048ff","first_computed_at":"2026-05-18T01:19:55.791204Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:55.791204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hqG8gvHEZmwXxYiJAYvwmbj38ernGfgzGv1Er0vT3L/JbK72HIhoLvBL84q0es8gz02DNKQ3J3Cgp4avKmqgCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:55.791757Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.6809","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a2f3860e1296a596fe7d1a18450607371fc88facbe9c03c36f1241f05c52078","sha256:9da04c8563c4687e842e489b0b17e9af6ff7a3c02dec0d3f9ba92af04cc0c920"],"state_sha256":"0a1477cf354c3865ca7ee99902bac5dae4819989ce442430c9b5560891701778"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EhVhKe6N9M0UTSfGKw92KZpN0X8E9FDZIQkcEC7FoKbE3dYPflUiBX0esHaVg8ipuYbb9AciwRkC7BMN0ryZBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T14:21:42.192733Z","bundle_sha256":"5f04bf08c622c54d70b9e633fcfea3d804e537186089308a7d796de521921ad6"}}