{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FCI25PF7UANGAGR3TXBBPDQJDA","short_pith_number":"pith:FCI25PF7","schema_version":"1.0","canonical_sha256":"2891aebcbfa01a601a3b9dc2178e09180b23765b0cf68171237261ccf83048ff","source":{"kind":"arxiv","id":"1307.6809","version":4},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.6809","created_at":"2026-05-18T01:19:55.791282+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.6809v4","created_at":"2026-05-18T01:19:55.791282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.6809","created_at":"2026-05-18T01:19:55.791282+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCI25PF7UANG","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCI25PF7UANGAGR3","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCI25PF7","created_at":"2026-05-18T12:27:45.050594+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FCI25PF7UANGAGR3TXBBPDQJDA","json":"https://pith.science/pith/FCI25PF7UANGAGR3TXBBPDQJDA.json","graph_json":"https://pith.science/api/pith-number/FCI25PF7UANGAGR3TXBBPDQJDA/graph.json","events_json":"https://pith.science/api/pith-number/FCI25PF7UANGAGR3TXBBPDQJDA/events.json","paper":"https://pith.science/paper/FCI25PF7"},"agent_actions":{"view_html":"https://pith.science/pith/FCI25PF7UANGAGR3TXBBPDQJDA","download_json":"https://pith.science/pith/FCI25PF7UANGAGR3TXBBPDQJDA.json","view_paper":"https://pith.science/paper/FCI25PF7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.6809&json=true","fetch_graph":"https://pith.science/api/pith-number/FCI25PF7UANGAGR3TXBBPDQJDA/graph.json","fetch_events":"https://pith.science/api/pith-number/FCI25PF7UANGAGR3TXBBPDQJDA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCI25PF7UANGAGR3TXBBPDQJDA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCI25PF7UANGAGR3TXBBPDQJDA/action/storage_attestation","attest_author":"https://pith.science/pith/FCI25PF7UANGAGR3TXBBPDQJDA/action/author_attestation","sign_citation":"https://pith.science/pith/FCI25PF7UANGAGR3TXBBPDQJDA/action/citation_signature","submit_replication":"https://pith.science/pith/FCI25PF7UANGAGR3TXBBPDQJDA/action/replication_record"}},"created_at":"2026-05-18T01:19:55.791282+00:00","updated_at":"2026-05-18T01:19:55.791282+00:00"}