{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:U6PB3BRW75IQBB3TLKP5ZP6Q57","short_pith_number":"pith:U6PB3BRW","schema_version":"1.0","canonical_sha256":"a79e1d8636ff510087735a9fdcbfd0efe507c2de45d6e0b44e2f3e868e44c7fb","source":{"kind":"arxiv","id":"1612.00201","version":1},"attestation_state":"computed","paper":{"title":"Towards a multigrid method for the minimum-cost flow problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alessio Quaglino, Rolf Krause","submitted_at":"2016-12-01T11:10:42Z","abstract_excerpt":"We present a first step towards a multigrid method for solving the min-cost flow problem. Specifically, we present a strategy that takes advantage of existing black-box fast iterative linear solvers, i.e. algebraic multigrid methods. We show with standard benchmarks that, while less competitive than combinatorial techniques on small problems that run on a single core, our approach scales well with problem size, complexity, and number of processors, allowing for tackling large-scale problems on modern parallel architectures. Our approach is based on combining interior-point with multigrid metho"},"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":"1612.00201","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-01T11:10:42Z","cross_cats_sorted":[],"title_canon_sha256":"9f19eda7615aea7f88cb2115d3970b9b00e1b2679c1d73441556fb149dda9c13","abstract_canon_sha256":"c923b26f7fa4d04b5be81b81fee10b768a5b4b715c46c3e831588a71fe9ca75e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:05.791034Z","signature_b64":"NbKEyM+35xLGMT8dc77e3o/nIFXtLzz+rJKc9mPudpB2X1pO8C4ZRchVM/+CvNZvwnXujDqUPn9G5ULXNaamDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a79e1d8636ff510087735a9fdcbfd0efe507c2de45d6e0b44e2f3e868e44c7fb","last_reissued_at":"2026-05-18T00:56:05.790487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:05.790487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards a multigrid method for the minimum-cost flow problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alessio Quaglino, Rolf Krause","submitted_at":"2016-12-01T11:10:42Z","abstract_excerpt":"We present a first step towards a multigrid method for solving the min-cost flow problem. Specifically, we present a strategy that takes advantage of existing black-box fast iterative linear solvers, i.e. algebraic multigrid methods. We show with standard benchmarks that, while less competitive than combinatorial techniques on small problems that run on a single core, our approach scales well with problem size, complexity, and number of processors, allowing for tackling large-scale problems on modern parallel architectures. Our approach is based on combining interior-point with multigrid metho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00201","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":"1612.00201","created_at":"2026-05-18T00:56:05.790576+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.00201v1","created_at":"2026-05-18T00:56:05.790576+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00201","created_at":"2026-05-18T00:56:05.790576+00:00"},{"alias_kind":"pith_short_12","alias_value":"U6PB3BRW75IQ","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"U6PB3BRW75IQBB3T","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"U6PB3BRW","created_at":"2026-05-18T12:30:46.583412+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/U6PB3BRW75IQBB3TLKP5ZP6Q57","json":"https://pith.science/pith/U6PB3BRW75IQBB3TLKP5ZP6Q57.json","graph_json":"https://pith.science/api/pith-number/U6PB3BRW75IQBB3TLKP5ZP6Q57/graph.json","events_json":"https://pith.science/api/pith-number/U6PB3BRW75IQBB3TLKP5ZP6Q57/events.json","paper":"https://pith.science/paper/U6PB3BRW"},"agent_actions":{"view_html":"https://pith.science/pith/U6PB3BRW75IQBB3TLKP5ZP6Q57","download_json":"https://pith.science/pith/U6PB3BRW75IQBB3TLKP5ZP6Q57.json","view_paper":"https://pith.science/paper/U6PB3BRW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.00201&json=true","fetch_graph":"https://pith.science/api/pith-number/U6PB3BRW75IQBB3TLKP5ZP6Q57/graph.json","fetch_events":"https://pith.science/api/pith-number/U6PB3BRW75IQBB3TLKP5ZP6Q57/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U6PB3BRW75IQBB3TLKP5ZP6Q57/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U6PB3BRW75IQBB3TLKP5ZP6Q57/action/storage_attestation","attest_author":"https://pith.science/pith/U6PB3BRW75IQBB3TLKP5ZP6Q57/action/author_attestation","sign_citation":"https://pith.science/pith/U6PB3BRW75IQBB3TLKP5ZP6Q57/action/citation_signature","submit_replication":"https://pith.science/pith/U6PB3BRW75IQBB3TLKP5ZP6Q57/action/replication_record"}},"created_at":"2026-05-18T00:56:05.790576+00:00","updated_at":"2026-05-18T00:56:05.790576+00:00"}