{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3YBIESCSMJTHINZULUEIM7IDSO","short_pith_number":"pith:3YBIESCS","schema_version":"1.0","canonical_sha256":"de0282485262667437345d08867d0393ac2f9c5d2b66f2499d6aba1ddbaf434b","source":{"kind":"arxiv","id":"2404.00765","version":2},"attestation_state":"computed","paper":{"title":"Convex Network Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alan Edelman, Guillermo Angeris, Theo Diamandis","submitted_at":"2024-03-31T18:36:27Z","abstract_excerpt":"We introduce a general framework for flow problems over hypergraphs. In our problem formulation, which we call the convex flow problem, we have a concave utility function for the net flow at every node and a concave utility function for each edge flow. The objective is to maximize the sum of these utilities, subject to constraints on the flows allowed at each edge, which we only assume to be a convex set. This framework not only includes many classic problems in network optimization, such as max flow, min-cost flow, and multi-commodity flows, but also generalizes these problems to allow, for e"},"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":"2404.00765","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-31T18:36:27Z","cross_cats_sorted":[],"title_canon_sha256":"a5f42d332b68cdb8d69eabd1489543a420d536f0fdead3ae55848b8ad73a2b3b","abstract_canon_sha256":"2a8be14d9134f1e0a09374cacb41ef4742b7146fb983b0d1566e9d69cdc103f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:20:28.717208Z","signature_b64":"MMhlNUsFFMLd5eQ9rl8FXjbh3Afp7w6wTZGwkrKE0cP/mFd/L5PD7v3faAbf4uau0rzVrfm9QWYVlC2oCi05Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de0282485262667437345d08867d0393ac2f9c5d2b66f2499d6aba1ddbaf434b","last_reissued_at":"2026-07-05T08:20:28.716708Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:20:28.716708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex Network Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alan Edelman, Guillermo Angeris, Theo Diamandis","submitted_at":"2024-03-31T18:36:27Z","abstract_excerpt":"We introduce a general framework for flow problems over hypergraphs. In our problem formulation, which we call the convex flow problem, we have a concave utility function for the net flow at every node and a concave utility function for each edge flow. The objective is to maximize the sum of these utilities, subject to constraints on the flows allowed at each edge, which we only assume to be a convex set. This framework not only includes many classic problems in network optimization, such as max flow, min-cost flow, and multi-commodity flows, but also generalizes these problems to allow, for e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.00765","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.00765/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2404.00765","created_at":"2026-07-05T08:20:28.716772+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.00765v2","created_at":"2026-07-05T08:20:28.716772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.00765","created_at":"2026-07-05T08:20:28.716772+00:00"},{"alias_kind":"pith_short_12","alias_value":"3YBIESCSMJTH","created_at":"2026-07-05T08:20:28.716772+00:00"},{"alias_kind":"pith_short_16","alias_value":"3YBIESCSMJTHINZU","created_at":"2026-07-05T08:20:28.716772+00:00"},{"alias_kind":"pith_short_8","alias_value":"3YBIESCS","created_at":"2026-07-05T08:20:28.716772+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.02909","citing_title":"Concave Continuation: Linking Routing to Arbitrage","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3YBIESCSMJTHINZULUEIM7IDSO","json":"https://pith.science/pith/3YBIESCSMJTHINZULUEIM7IDSO.json","graph_json":"https://pith.science/api/pith-number/3YBIESCSMJTHINZULUEIM7IDSO/graph.json","events_json":"https://pith.science/api/pith-number/3YBIESCSMJTHINZULUEIM7IDSO/events.json","paper":"https://pith.science/paper/3YBIESCS"},"agent_actions":{"view_html":"https://pith.science/pith/3YBIESCSMJTHINZULUEIM7IDSO","download_json":"https://pith.science/pith/3YBIESCSMJTHINZULUEIM7IDSO.json","view_paper":"https://pith.science/paper/3YBIESCS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.00765&json=true","fetch_graph":"https://pith.science/api/pith-number/3YBIESCSMJTHINZULUEIM7IDSO/graph.json","fetch_events":"https://pith.science/api/pith-number/3YBIESCSMJTHINZULUEIM7IDSO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3YBIESCSMJTHINZULUEIM7IDSO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3YBIESCSMJTHINZULUEIM7IDSO/action/storage_attestation","attest_author":"https://pith.science/pith/3YBIESCSMJTHINZULUEIM7IDSO/action/author_attestation","sign_citation":"https://pith.science/pith/3YBIESCSMJTHINZULUEIM7IDSO/action/citation_signature","submit_replication":"https://pith.science/pith/3YBIESCSMJTHINZULUEIM7IDSO/action/replication_record"}},"created_at":"2026-07-05T08:20:28.716772+00:00","updated_at":"2026-07-05T08:20:28.716772+00:00"}