{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:UG3SJOBNQJ6BVBUKDOQN37CMS7","short_pith_number":"pith:UG3SJOBN","canonical_record":{"source":{"id":"0803.0988","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2008-03-06T21:57:53Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"f74927c56e45eddd8556ddf751605b68459475f92eb38a3b7ba6d2511d0e396a","abstract_canon_sha256":"964102df9b2c4e5f6cc776fd18c56853f97c4a6b359107e473c280cd33fd2c44"},"schema_version":"1.0"},"canonical_sha256":"a1b724b82d827c1a868a1ba0ddfc4c97f4c58f7376099dc20641f935cc8fca70","source":{"kind":"arxiv","id":"0803.0988","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0803.0988","created_at":"2026-06-03T22:06:04Z"},{"alias_kind":"arxiv_version","alias_value":"0803.0988v2","created_at":"2026-06-03T22:06:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0803.0988","created_at":"2026-06-03T22:06:04Z"},{"alias_kind":"pith_short_12","alias_value":"UG3SJOBNQJ6B","created_at":"2026-06-03T22:06:04Z"},{"alias_kind":"pith_short_16","alias_value":"UG3SJOBNQJ6BVBUK","created_at":"2026-06-03T22:06:04Z"},{"alias_kind":"pith_short_8","alias_value":"UG3SJOBN","created_at":"2026-06-03T22:06:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:UG3SJOBNQJ6BVBUKDOQN37CMS7","target":"record","payload":{"canonical_record":{"source":{"id":"0803.0988","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2008-03-06T21:57:53Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"f74927c56e45eddd8556ddf751605b68459475f92eb38a3b7ba6d2511d0e396a","abstract_canon_sha256":"964102df9b2c4e5f6cc776fd18c56853f97c4a6b359107e473c280cd33fd2c44"},"schema_version":"1.0"},"canonical_sha256":"a1b724b82d827c1a868a1ba0ddfc4c97f4c58f7376099dc20641f935cc8fca70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T22:06:04.881431Z","signature_b64":"/qNvKRQYIudtgneh6ha6WxDj4ILLsye+Ntxau5bhBdeQ3bsZEgWS1xdA+eYPEghVZSmEuS7IA8yFjumJVKP5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1b724b82d827c1a868a1ba0ddfc4c97f4c58f7376099dc20641f935cc8fca70","last_reissued_at":"2026-06-03T22:06:04.881017Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T22:06:04.881017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0803.0988","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-06-03T22:06:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T8iuXLNVe1vqJim9ATGN0IqMZv9aYgwy2eDNhCiPZRQaKLEucWLG3Zu6Ab9cNYkHtGV8iFPDIPZ9h5h8+ygeBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-15T01:41:29.100603Z"},"content_sha256":"1853b0e78974cb06fb94bc35e1abc1969e38a61a395fa84e7eb5a38d2facdadc","schema_version":"1.0","event_id":"sha256:1853b0e78974cb06fb94bc35e1abc1969e38a61a395fa84e7eb5a38d2facdadc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:UG3SJOBNQJ6BVBUKDOQN37CMS7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Approximate Lossy Generalized Flow via Interior Point Algorithms","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"Daniel A. Spielman, Samuel I. Daitch","submitted_at":"2008-03-06T21:57:53Z","abstract_excerpt":"We present faster approximation algorithms for generalized network flow problems. A generalized flow is one in which the flow out of an edge differs from the flow into the edge by a constant factor. We limit ourselves to the lossy case, when these factors are at most 1.\n  Our algorithm uses a standard interior-point algorithm to solve a linear program formulation of the network flow problem. The system of linear equations that arises at each step of the interior-point algorithm takes the form of a symmetric M-matrix. We present an algorithm for solving such systems in nearly linear time. The a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0803.0988","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/0803.0988/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-06-03T22:06:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"60Rlgs5iQtZkBBybLgRDkCw8LZUq1Ghhd9e+EOV/qtdtuEM+tneNkuuUxGLWB1tgHyvIJfuGkm3A0WJLcQg7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-15T01:41:29.100979Z"},"content_sha256":"4a3a5f4f35bc015c3d548b84c41087066bbad870e9f03edd04780fe7e8a63aa9","schema_version":"1.0","event_id":"sha256:4a3a5f4f35bc015c3d548b84c41087066bbad870e9f03edd04780fe7e8a63aa9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UG3SJOBNQJ6BVBUKDOQN37CMS7/bundle.json","state_url":"https://pith.science/pith/UG3SJOBNQJ6BVBUKDOQN37CMS7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UG3SJOBNQJ6BVBUKDOQN37CMS7/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-07-15T01:41:29Z","links":{"resolver":"https://pith.science/pith/UG3SJOBNQJ6BVBUKDOQN37CMS7","bundle":"https://pith.science/pith/UG3SJOBNQJ6BVBUKDOQN37CMS7/bundle.json","state":"https://pith.science/pith/UG3SJOBNQJ6BVBUKDOQN37CMS7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UG3SJOBNQJ6BVBUKDOQN37CMS7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:UG3SJOBNQJ6BVBUKDOQN37CMS7","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":"964102df9b2c4e5f6cc776fd18c56853f97c4a6b359107e473c280cd33fd2c44","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2008-03-06T21:57:53Z","title_canon_sha256":"f74927c56e45eddd8556ddf751605b68459475f92eb38a3b7ba6d2511d0e396a"},"schema_version":"1.0","source":{"id":"0803.0988","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0803.0988","created_at":"2026-06-03T22:06:04Z"},{"alias_kind":"arxiv_version","alias_value":"0803.0988v2","created_at":"2026-06-03T22:06:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0803.0988","created_at":"2026-06-03T22:06:04Z"},{"alias_kind":"pith_short_12","alias_value":"UG3SJOBNQJ6B","created_at":"2026-06-03T22:06:04Z"},{"alias_kind":"pith_short_16","alias_value":"UG3SJOBNQJ6BVBUK","created_at":"2026-06-03T22:06:04Z"},{"alias_kind":"pith_short_8","alias_value":"UG3SJOBN","created_at":"2026-06-03T22:06:04Z"}],"graph_snapshots":[{"event_id":"sha256:4a3a5f4f35bc015c3d548b84c41087066bbad870e9f03edd04780fe7e8a63aa9","target":"graph","created_at":"2026-06-03T22:06:04Z","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/0803.0988/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present faster approximation algorithms for generalized network flow problems. A generalized flow is one in which the flow out of an edge differs from the flow into the edge by a constant factor. We limit ourselves to the lossy case, when these factors are at most 1.\n  Our algorithm uses a standard interior-point algorithm to solve a linear program formulation of the network flow problem. The system of linear equations that arises at each step of the interior-point algorithm takes the form of a symmetric M-matrix. We present an algorithm for solving such systems in nearly linear time. The a","authors_text":"Daniel A. Spielman, Samuel I. Daitch","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2008-03-06T21:57:53Z","title":"Faster Approximate Lossy Generalized Flow via Interior Point Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0803.0988","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:1853b0e78974cb06fb94bc35e1abc1969e38a61a395fa84e7eb5a38d2facdadc","target":"record","created_at":"2026-06-03T22:06:04Z","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":"964102df9b2c4e5f6cc776fd18c56853f97c4a6b359107e473c280cd33fd2c44","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2008-03-06T21:57:53Z","title_canon_sha256":"f74927c56e45eddd8556ddf751605b68459475f92eb38a3b7ba6d2511d0e396a"},"schema_version":"1.0","source":{"id":"0803.0988","kind":"arxiv","version":2}},"canonical_sha256":"a1b724b82d827c1a868a1ba0ddfc4c97f4c58f7376099dc20641f935cc8fca70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1b724b82d827c1a868a1ba0ddfc4c97f4c58f7376099dc20641f935cc8fca70","first_computed_at":"2026-06-03T22:06:04.881017Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T22:06:04.881017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/qNvKRQYIudtgneh6ha6WxDj4ILLsye+Ntxau5bhBdeQ3bsZEgWS1xdA+eYPEghVZSmEuS7IA8yFjumJVKP5BQ==","signature_status":"signed_v1","signed_at":"2026-06-03T22:06:04.881431Z","signed_message":"canonical_sha256_bytes"},"source_id":"0803.0988","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1853b0e78974cb06fb94bc35e1abc1969e38a61a395fa84e7eb5a38d2facdadc","sha256:4a3a5f4f35bc015c3d548b84c41087066bbad870e9f03edd04780fe7e8a63aa9"],"state_sha256":"77292ad045d0e736e0bd58def2d7df30f4de32620650c120902155bfae5f53a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kBpk1zxbeivFEpjSphPIVMCF6edtIm92bnhugH9PMVUCaFNwkum2/Cvh12mLq8fWeI351byvPicQ3lhSKg9wAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-15T01:41:29.102997Z","bundle_sha256":"103818dc6caa254a9bb345c8558842de71481d573e9fd3602f1c06259f3a3821"}}