{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:U6PB3BRW75IQBB3TLKP5ZP6Q57","short_pith_number":"pith:U6PB3BRW","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"},"canonical_sha256":"a79e1d8636ff510087735a9fdcbfd0efe507c2de45d6e0b44e2f3e868e44c7fb","source":{"kind":"arxiv","id":"1612.00201","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00201","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00201v1","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00201","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"pith_short_12","alias_value":"U6PB3BRW75IQ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"U6PB3BRW75IQBB3T","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"U6PB3BRW","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:U6PB3BRW75IQBB3TLKP5ZP6Q57","target":"record","payload":{"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"},"canonical_sha256":"a79e1d8636ff510087735a9fdcbfd0efe507c2de45d6e0b44e2f3e868e44c7fb","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"},"source_kind":"arxiv","source_id":"1612.00201","source_version":1,"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-05-18T00:56:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ize8O60I0/UgoplhtSJa4aqB/0AHlDaX7vcJVww7OV5RgT2tKS8M+Pk9JnJRbfZjZVXY5P1pdulzYp2CX9u5Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T12:10:16.040396Z"},"content_sha256":"37d2da3d11aa0ae8fc8aaeda3bb2fe280c0151ae7e2701566f2207ae78052088","schema_version":"1.0","event_id":"sha256:37d2da3d11aa0ae8fc8aaeda3bb2fe280c0151ae7e2701566f2207ae78052088"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:U6PB3BRW75IQBB3TLKP5ZP6Q57","target":"graph","payload":{"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"},"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-05-18T00:56:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MBSkdLQyPl7Vxb6aFxsJKrxRUcP3MOBmAcBEPU2fNt8M7aXStLdrwMFMnRQFWFJJvFrJ5Vw+w9CDVOOmyO8NCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T12:10:16.041138Z"},"content_sha256":"e6bccab9dc820421ce973f79b9c0cea40c09395f4d0a43b4063423faa57bcab3","schema_version":"1.0","event_id":"sha256:e6bccab9dc820421ce973f79b9c0cea40c09395f4d0a43b4063423faa57bcab3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U6PB3BRW75IQBB3TLKP5ZP6Q57/bundle.json","state_url":"https://pith.science/pith/U6PB3BRW75IQBB3TLKP5ZP6Q57/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U6PB3BRW75IQBB3TLKP5ZP6Q57/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-05-23T12:10:16Z","links":{"resolver":"https://pith.science/pith/U6PB3BRW75IQBB3TLKP5ZP6Q57","bundle":"https://pith.science/pith/U6PB3BRW75IQBB3TLKP5ZP6Q57/bundle.json","state":"https://pith.science/pith/U6PB3BRW75IQBB3TLKP5ZP6Q57/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U6PB3BRW75IQBB3TLKP5ZP6Q57/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:U6PB3BRW75IQBB3TLKP5ZP6Q57","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":"c923b26f7fa4d04b5be81b81fee10b768a5b4b715c46c3e831588a71fe9ca75e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-01T11:10:42Z","title_canon_sha256":"9f19eda7615aea7f88cb2115d3970b9b00e1b2679c1d73441556fb149dda9c13"},"schema_version":"1.0","source":{"id":"1612.00201","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00201","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00201v1","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00201","created_at":"2026-05-18T00:56:05Z"},{"alias_kind":"pith_short_12","alias_value":"U6PB3BRW75IQ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"U6PB3BRW75IQBB3T","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"U6PB3BRW","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:e6bccab9dc820421ce973f79b9c0cea40c09395f4d0a43b4063423faa57bcab3","target":"graph","created_at":"2026-05-18T00:56:05Z","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"},"paper":{"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","authors_text":"Alessio Quaglino, Rolf Krause","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-01T11:10:42Z","title":"Towards a multigrid method for the minimum-cost flow problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00201","kind":"arxiv","version":1},"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:37d2da3d11aa0ae8fc8aaeda3bb2fe280c0151ae7e2701566f2207ae78052088","target":"record","created_at":"2026-05-18T00:56:05Z","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":"c923b26f7fa4d04b5be81b81fee10b768a5b4b715c46c3e831588a71fe9ca75e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-01T11:10:42Z","title_canon_sha256":"9f19eda7615aea7f88cb2115d3970b9b00e1b2679c1d73441556fb149dda9c13"},"schema_version":"1.0","source":{"id":"1612.00201","kind":"arxiv","version":1}},"canonical_sha256":"a79e1d8636ff510087735a9fdcbfd0efe507c2de45d6e0b44e2f3e868e44c7fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a79e1d8636ff510087735a9fdcbfd0efe507c2de45d6e0b44e2f3e868e44c7fb","first_computed_at":"2026-05-18T00:56:05.790487Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:05.790487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NbKEyM+35xLGMT8dc77e3o/nIFXtLzz+rJKc9mPudpB2X1pO8C4ZRchVM/+CvNZvwnXujDqUPn9G5ULXNaamDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:05.791034Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.00201","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37d2da3d11aa0ae8fc8aaeda3bb2fe280c0151ae7e2701566f2207ae78052088","sha256:e6bccab9dc820421ce973f79b9c0cea40c09395f4d0a43b4063423faa57bcab3"],"state_sha256":"1c7281a35f2f2d0511b7b102963ba57946797ac5db33046a9509461d7ac3ab49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8zndBXjTqvpYjd5DJlMpu42GNVbgk/CHWGAB5jOQG/y3/YmNEMTn7VMGIsb8Nopa8iHeyLfCad/50Oiw6pqCDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T12:10:16.044904Z","bundle_sha256":"58d044db751a43eef7a1e569bc21fafecfb8604b7b6a49d46f03f042afd30f40"}}