{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PNTLLV4SXFXHYKUKW2PWVZLYKN","short_pith_number":"pith:PNTLLV4S","schema_version":"1.0","canonical_sha256":"7b66b5d792b96e7c2a8ab69f6ae57853501277fdc9ce8e6745f64dbf081bbf38","source":{"kind":"arxiv","id":"1705.05920","version":1},"attestation_state":"computed","paper":{"title":"Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Alper Atamturk, Birce Tezel, Simge Kucukyavuz","submitted_at":"2017-05-16T20:59:00Z","abstract_excerpt":"Capacitated fixed-charge network flows are used to model a variety of problems in telecommunication, facility location, production planning and supply chain management. In this paper, we investigate capacitated path substructures and derive strong and easy-to-compute \\emph{path cover and path pack inequalities}. These inequalities are based on an explicit characterization of the submodular inequalities through a fast computation of parametric minimum cuts on a path, and they generalize the well-known flow cover and flow pack inequalities for the single-node relaxations of fixed-charge flow mod"},"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":"1705.05920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-16T20:59:00Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8f4859d7fd42c9ea3c07789a5181999949878f9dc7613661ebded2599e567d71","abstract_canon_sha256":"47144b441f566857e5dfe01fda22bb2b76659b2b7dbc1c65620153576c37768e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:19.420303Z","signature_b64":"YiiQhVRztQvcEzu8X/SMNWcCGHdETXTrq+1AXt5xdqChOv9c7n4EwAuCmjm5Z7Uez4cSN05m6N67M8fdI+rkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b66b5d792b96e7c2a8ab69f6ae57853501277fdc9ce8e6745f64dbf081bbf38","last_reissued_at":"2026-05-18T00:44:19.419758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:19.419758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Alper Atamturk, Birce Tezel, Simge Kucukyavuz","submitted_at":"2017-05-16T20:59:00Z","abstract_excerpt":"Capacitated fixed-charge network flows are used to model a variety of problems in telecommunication, facility location, production planning and supply chain management. In this paper, we investigate capacitated path substructures and derive strong and easy-to-compute \\emph{path cover and path pack inequalities}. These inequalities are based on an explicit characterization of the submodular inequalities through a fast computation of parametric minimum cuts on a path, and they generalize the well-known flow cover and flow pack inequalities for the single-node relaxations of fixed-charge flow mod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05920","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":"1705.05920","created_at":"2026-05-18T00:44:19.419850+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.05920v1","created_at":"2026-05-18T00:44:19.419850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05920","created_at":"2026-05-18T00:44:19.419850+00:00"},{"alias_kind":"pith_short_12","alias_value":"PNTLLV4SXFXH","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PNTLLV4SXFXHYKUK","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PNTLLV4S","created_at":"2026-05-18T12:31:37.085036+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/PNTLLV4SXFXHYKUKW2PWVZLYKN","json":"https://pith.science/pith/PNTLLV4SXFXHYKUKW2PWVZLYKN.json","graph_json":"https://pith.science/api/pith-number/PNTLLV4SXFXHYKUKW2PWVZLYKN/graph.json","events_json":"https://pith.science/api/pith-number/PNTLLV4SXFXHYKUKW2PWVZLYKN/events.json","paper":"https://pith.science/paper/PNTLLV4S"},"agent_actions":{"view_html":"https://pith.science/pith/PNTLLV4SXFXHYKUKW2PWVZLYKN","download_json":"https://pith.science/pith/PNTLLV4SXFXHYKUKW2PWVZLYKN.json","view_paper":"https://pith.science/paper/PNTLLV4S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.05920&json=true","fetch_graph":"https://pith.science/api/pith-number/PNTLLV4SXFXHYKUKW2PWVZLYKN/graph.json","fetch_events":"https://pith.science/api/pith-number/PNTLLV4SXFXHYKUKW2PWVZLYKN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PNTLLV4SXFXHYKUKW2PWVZLYKN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PNTLLV4SXFXHYKUKW2PWVZLYKN/action/storage_attestation","attest_author":"https://pith.science/pith/PNTLLV4SXFXHYKUKW2PWVZLYKN/action/author_attestation","sign_citation":"https://pith.science/pith/PNTLLV4SXFXHYKUKW2PWVZLYKN/action/citation_signature","submit_replication":"https://pith.science/pith/PNTLLV4SXFXHYKUKW2PWVZLYKN/action/replication_record"}},"created_at":"2026-05-18T00:44:19.419850+00:00","updated_at":"2026-05-18T00:44:19.419850+00:00"}