{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:VJJL2KJWH7RNQ2NKQQNIXVGKY6","short_pith_number":"pith:VJJL2KJW","schema_version":"1.0","canonical_sha256":"aa52bd29363fe2d869aa841a8bd4cac79b8ed1747f3764e22d84c819c3c8696a","source":{"kind":"arxiv","id":"1109.3893","version":3},"attestation_state":"computed","paper":{"title":"Concave Generalized Flows with Applications to Market Equilibria","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.GT","q-fin.CP"],"primary_cat":"cs.DS","authors_text":"Laszlo A. Vegh","submitted_at":"2011-09-18T17:50:26Z","abstract_excerpt":"We consider a nonlinear extension of the generalized network flow model, with the flow leaving an arc being an increasing concave function of the flow entering it, as proposed by Truemper and Shigeno. We give a polynomial time combinatorial algorithm for solving corresponding flow maximization problems, finding an epsilon-approximate solution in O(m(m+log n)log(MUm/epsilon)) arithmetic operations and value oracle queries, where M and U are upper bounds on simple parameters. This also gives a new algorithm for linear generalized flows, an efficient, purely scaling variant of the Fat-Path algori"},"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":"1109.3893","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-18T17:50:26Z","cross_cats_sorted":["cs.DM","cs.GT","q-fin.CP"],"title_canon_sha256":"70ef5c7fd6810d5a0f5c55a2a1b83659be1a272df4c2caeda06490331198287b","abstract_canon_sha256":"273c614cc98de972cff942f62f56f534fcfdee4d4d7538a0193486db8cb109ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:36.786950Z","signature_b64":"mpk82W2aPUfrb7xEjD8arPh7J5mgYZA1Yd25TiQFbqiwmo2++kRpsRn4jcipwBdY1o6/r9tiTngXIOx9km/nDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa52bd29363fe2d869aa841a8bd4cac79b8ed1747f3764e22d84c819c3c8696a","last_reissued_at":"2026-05-18T03:58:36.786267Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:36.786267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Concave Generalized Flows with Applications to Market Equilibria","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.GT","q-fin.CP"],"primary_cat":"cs.DS","authors_text":"Laszlo A. Vegh","submitted_at":"2011-09-18T17:50:26Z","abstract_excerpt":"We consider a nonlinear extension of the generalized network flow model, with the flow leaving an arc being an increasing concave function of the flow entering it, as proposed by Truemper and Shigeno. We give a polynomial time combinatorial algorithm for solving corresponding flow maximization problems, finding an epsilon-approximate solution in O(m(m+log n)log(MUm/epsilon)) arithmetic operations and value oracle queries, where M and U are upper bounds on simple parameters. This also gives a new algorithm for linear generalized flows, an efficient, purely scaling variant of the Fat-Path algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3893","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1109.3893","created_at":"2026-05-18T03:58:36.786378+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.3893v3","created_at":"2026-05-18T03:58:36.786378+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3893","created_at":"2026-05-18T03:58:36.786378+00:00"},{"alias_kind":"pith_short_12","alias_value":"VJJL2KJWH7RN","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"VJJL2KJWH7RNQ2NK","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"VJJL2KJW","created_at":"2026-05-18T12:26:44.992195+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/VJJL2KJWH7RNQ2NKQQNIXVGKY6","json":"https://pith.science/pith/VJJL2KJWH7RNQ2NKQQNIXVGKY6.json","graph_json":"https://pith.science/api/pith-number/VJJL2KJWH7RNQ2NKQQNIXVGKY6/graph.json","events_json":"https://pith.science/api/pith-number/VJJL2KJWH7RNQ2NKQQNIXVGKY6/events.json","paper":"https://pith.science/paper/VJJL2KJW"},"agent_actions":{"view_html":"https://pith.science/pith/VJJL2KJWH7RNQ2NKQQNIXVGKY6","download_json":"https://pith.science/pith/VJJL2KJWH7RNQ2NKQQNIXVGKY6.json","view_paper":"https://pith.science/paper/VJJL2KJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.3893&json=true","fetch_graph":"https://pith.science/api/pith-number/VJJL2KJWH7RNQ2NKQQNIXVGKY6/graph.json","fetch_events":"https://pith.science/api/pith-number/VJJL2KJWH7RNQ2NKQQNIXVGKY6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VJJL2KJWH7RNQ2NKQQNIXVGKY6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VJJL2KJWH7RNQ2NKQQNIXVGKY6/action/storage_attestation","attest_author":"https://pith.science/pith/VJJL2KJWH7RNQ2NKQQNIXVGKY6/action/author_attestation","sign_citation":"https://pith.science/pith/VJJL2KJWH7RNQ2NKQQNIXVGKY6/action/citation_signature","submit_replication":"https://pith.science/pith/VJJL2KJWH7RNQ2NKQQNIXVGKY6/action/replication_record"}},"created_at":"2026-05-18T03:58:36.786378+00:00","updated_at":"2026-05-18T03:58:36.786378+00:00"}