{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YBGUU6PETZHTCKT7B23EUNPLGA","short_pith_number":"pith:YBGUU6PE","schema_version":"1.0","canonical_sha256":"c04d4a79e49e4f312a7f0eb64a35eb30059aef880c515c01b628fb5fb00deaa4","source":{"kind":"arxiv","id":"1706.00880","version":1},"attestation_state":"computed","paper":{"title":"Cycle flow formulation of optimal network flow problems for centralized and decentralized solvers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Reza Asadi, Solmaz S. Kia","submitted_at":"2017-06-03T01:22:14Z","abstract_excerpt":"When the underlying physical network layer in optimal network flow problems is a large graph, the associated optimization problem has a large set of decision variables. In this paper, we discuss how the cycle basis from graph theory can be used to reduce the size of this decision variable space. The idea is to eliminate the aggregated flow conservation constraint of these problems by explicitly characterizing its solutions in terms of the span of the columns of the transpose of a fundamental cycle basis matrix of the network plus a particular solution. We show that for any given input/output f"},"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":"1706.00880","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SY","submitted_at":"2017-06-03T01:22:14Z","cross_cats_sorted":[],"title_canon_sha256":"7325ade9e3cc90bf27f82319053e19e78fdd8558da3ee581250955dae81e84bc","abstract_canon_sha256":"6699b2f04bbb233764f62ba6ca29dc4008022fb43b264d612b5f13c073d7c078"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:07.579303Z","signature_b64":"8z9aB8hFAKoyejjiz8S+onFuoRAKUoRRcQqQP4NEJ9YhR/3uU7bvLApSdsa1tPWuF+TlSFa0xHCB3SidIv+XBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c04d4a79e49e4f312a7f0eb64a35eb30059aef880c515c01b628fb5fb00deaa4","last_reissued_at":"2026-05-18T00:43:07.578540Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:07.578540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cycle flow formulation of optimal network flow problems for centralized and decentralized solvers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Reza Asadi, Solmaz S. Kia","submitted_at":"2017-06-03T01:22:14Z","abstract_excerpt":"When the underlying physical network layer in optimal network flow problems is a large graph, the associated optimization problem has a large set of decision variables. In this paper, we discuss how the cycle basis from graph theory can be used to reduce the size of this decision variable space. The idea is to eliminate the aggregated flow conservation constraint of these problems by explicitly characterizing its solutions in terms of the span of the columns of the transpose of a fundamental cycle basis matrix of the network plus a particular solution. We show that for any given input/output f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00880","kind":"arxiv","version":1},"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":"1706.00880","created_at":"2026-05-18T00:43:07.578671+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.00880v1","created_at":"2026-05-18T00:43:07.578671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00880","created_at":"2026-05-18T00:43:07.578671+00:00"},{"alias_kind":"pith_short_12","alias_value":"YBGUU6PETZHT","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YBGUU6PETZHTCKT7","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YBGUU6PE","created_at":"2026-05-18T12:31:56.362134+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/YBGUU6PETZHTCKT7B23EUNPLGA","json":"https://pith.science/pith/YBGUU6PETZHTCKT7B23EUNPLGA.json","graph_json":"https://pith.science/api/pith-number/YBGUU6PETZHTCKT7B23EUNPLGA/graph.json","events_json":"https://pith.science/api/pith-number/YBGUU6PETZHTCKT7B23EUNPLGA/events.json","paper":"https://pith.science/paper/YBGUU6PE"},"agent_actions":{"view_html":"https://pith.science/pith/YBGUU6PETZHTCKT7B23EUNPLGA","download_json":"https://pith.science/pith/YBGUU6PETZHTCKT7B23EUNPLGA.json","view_paper":"https://pith.science/paper/YBGUU6PE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.00880&json=true","fetch_graph":"https://pith.science/api/pith-number/YBGUU6PETZHTCKT7B23EUNPLGA/graph.json","fetch_events":"https://pith.science/api/pith-number/YBGUU6PETZHTCKT7B23EUNPLGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YBGUU6PETZHTCKT7B23EUNPLGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YBGUU6PETZHTCKT7B23EUNPLGA/action/storage_attestation","attest_author":"https://pith.science/pith/YBGUU6PETZHTCKT7B23EUNPLGA/action/author_attestation","sign_citation":"https://pith.science/pith/YBGUU6PETZHTCKT7B23EUNPLGA/action/citation_signature","submit_replication":"https://pith.science/pith/YBGUU6PETZHTCKT7B23EUNPLGA/action/replication_record"}},"created_at":"2026-05-18T00:43:07.578671+00:00","updated_at":"2026-05-18T00:43:07.578671+00:00"}