{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:3YBIESCSMJTHINZULUEIM7IDSO","short_pith_number":"pith:3YBIESCS","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"},"canonical_sha256":"de0282485262667437345d08867d0393ac2f9c5d2b66f2499d6aba1ddbaf434b","source":{"kind":"arxiv","id":"2404.00765","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.00765","created_at":"2026-07-05T08:20:28Z"},{"alias_kind":"arxiv_version","alias_value":"2404.00765v2","created_at":"2026-07-05T08:20:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.00765","created_at":"2026-07-05T08:20:28Z"},{"alias_kind":"pith_short_12","alias_value":"3YBIESCSMJTH","created_at":"2026-07-05T08:20:28Z"},{"alias_kind":"pith_short_16","alias_value":"3YBIESCSMJTHINZU","created_at":"2026-07-05T08:20:28Z"},{"alias_kind":"pith_short_8","alias_value":"3YBIESCS","created_at":"2026-07-05T08:20:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:3YBIESCSMJTHINZULUEIM7IDSO","target":"record","payload":{"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"},"canonical_sha256":"de0282485262667437345d08867d0393ac2f9c5d2b66f2499d6aba1ddbaf434b","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"},"source_kind":"arxiv","source_id":"2404.00765","source_version":2,"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-07-05T08:20:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MCUINEqVdAQEeaWXQdyXlDisKEqTpLLokkYad2DpLOeqUKCwK/LoKrBXoApSnhPxRQzEaXQCGg60aymZSqxmAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T04:48:19.963398Z"},"content_sha256":"951e3351550593bafd876508ead95a6a0e325ab07f55d6b450049eba75fb9de5","schema_version":"1.0","event_id":"sha256:951e3351550593bafd876508ead95a6a0e325ab07f55d6b450049eba75fb9de5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:3YBIESCSMJTHINZULUEIM7IDSO","target":"graph","payload":{"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"},"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-07-05T08:20:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RdLk4tWawRwo808X3GJXyS9LXPBuSqFQS7QgUEY/gFswtyKHEHyMPoDOLJiqnBughD9ldPL2Tg/3Zd72N16ABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T04:48:19.963932Z"},"content_sha256":"2ccae7ffd519d92c25157d5ce2fcb48ac3d747598c6feaba47d85dba069c7625","schema_version":"1.0","event_id":"sha256:2ccae7ffd519d92c25157d5ce2fcb48ac3d747598c6feaba47d85dba069c7625"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3YBIESCSMJTHINZULUEIM7IDSO/bundle.json","state_url":"https://pith.science/pith/3YBIESCSMJTHINZULUEIM7IDSO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3YBIESCSMJTHINZULUEIM7IDSO/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-08-09T04:48:19Z","links":{"resolver":"https://pith.science/pith/3YBIESCSMJTHINZULUEIM7IDSO","bundle":"https://pith.science/pith/3YBIESCSMJTHINZULUEIM7IDSO/bundle.json","state":"https://pith.science/pith/3YBIESCSMJTHINZULUEIM7IDSO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3YBIESCSMJTHINZULUEIM7IDSO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:3YBIESCSMJTHINZULUEIM7IDSO","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":"2a8be14d9134f1e0a09374cacb41ef4742b7146fb983b0d1566e9d69cdc103f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-31T18:36:27Z","title_canon_sha256":"a5f42d332b68cdb8d69eabd1489543a420d536f0fdead3ae55848b8ad73a2b3b"},"schema_version":"1.0","source":{"id":"2404.00765","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.00765","created_at":"2026-07-05T08:20:28Z"},{"alias_kind":"arxiv_version","alias_value":"2404.00765v2","created_at":"2026-07-05T08:20:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.00765","created_at":"2026-07-05T08:20:28Z"},{"alias_kind":"pith_short_12","alias_value":"3YBIESCSMJTH","created_at":"2026-07-05T08:20:28Z"},{"alias_kind":"pith_short_16","alias_value":"3YBIESCSMJTHINZU","created_at":"2026-07-05T08:20:28Z"},{"alias_kind":"pith_short_8","alias_value":"3YBIESCS","created_at":"2026-07-05T08:20:28Z"}],"graph_snapshots":[{"event_id":"sha256:2ccae7ffd519d92c25157d5ce2fcb48ac3d747598c6feaba47d85dba069c7625","target":"graph","created_at":"2026-07-05T08:20:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.00765/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Alan Edelman, Guillermo Angeris, Theo Diamandis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-31T18:36:27Z","title":"Convex Network Flows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.00765","kind":"arxiv","version":2},"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:951e3351550593bafd876508ead95a6a0e325ab07f55d6b450049eba75fb9de5","target":"record","created_at":"2026-07-05T08:20:28Z","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":"2a8be14d9134f1e0a09374cacb41ef4742b7146fb983b0d1566e9d69cdc103f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-31T18:36:27Z","title_canon_sha256":"a5f42d332b68cdb8d69eabd1489543a420d536f0fdead3ae55848b8ad73a2b3b"},"schema_version":"1.0","source":{"id":"2404.00765","kind":"arxiv","version":2}},"canonical_sha256":"de0282485262667437345d08867d0393ac2f9c5d2b66f2499d6aba1ddbaf434b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de0282485262667437345d08867d0393ac2f9c5d2b66f2499d6aba1ddbaf434b","first_computed_at":"2026-07-05T08:20:28.716708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:20:28.716708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MMhlNUsFFMLd5eQ9rl8FXjbh3Afp7w6wTZGwkrKE0cP/mFd/L5PD7v3faAbf4uau0rzVrfm9QWYVlC2oCi05Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:20:28.717208Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.00765","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:951e3351550593bafd876508ead95a6a0e325ab07f55d6b450049eba75fb9de5","sha256:2ccae7ffd519d92c25157d5ce2fcb48ac3d747598c6feaba47d85dba069c7625"],"state_sha256":"c5d5ab233624e191ed64ce4adeee6704ad8208e50d8f0c6f2425c4fafda6ce8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rPSWOtnJnOFiFsVf4pFmo5RbPpZ/blbB6yFwl7geCVXburh34hfQtZwZtkehWjeBzPrpiL8od1XX6iA8z9ofDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T04:48:19.969313Z","bundle_sha256":"a4626403eef77a8052cb79cdb5d1c9634a493f575740185baa7a6f5d065deb51"}}