{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BDKYK6XSD77TCOF6KFIMYQ5FBU","short_pith_number":"pith:BDKYK6XS","canonical_record":{"source":{"id":"1906.10340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-25T06:34:40Z","cross_cats_sorted":[],"title_canon_sha256":"8fea5cf126be0b042b8a3c7969a77cdbdb6d636d55a19e63a14fc6bdb538bbbd","abstract_canon_sha256":"b819d4380c925f9e711cda7762e2af4443f6169f5567677b6daaa8c73d7dc252"},"schema_version":"1.0"},"canonical_sha256":"08d5857af21fff3138be5150cc43a50d299d8d155e2c46d60b13ea6c117fa442","source":{"kind":"arxiv","id":"1906.10340","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10340","created_at":"2026-05-17T23:42:31Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10340v1","created_at":"2026-05-17T23:42:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10340","created_at":"2026-05-17T23:42:31Z"},{"alias_kind":"pith_short_12","alias_value":"BDKYK6XSD77T","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BDKYK6XSD77TCOF6","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BDKYK6XS","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BDKYK6XSD77TCOF6KFIMYQ5FBU","target":"record","payload":{"canonical_record":{"source":{"id":"1906.10340","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-25T06:34:40Z","cross_cats_sorted":[],"title_canon_sha256":"8fea5cf126be0b042b8a3c7969a77cdbdb6d636d55a19e63a14fc6bdb538bbbd","abstract_canon_sha256":"b819d4380c925f9e711cda7762e2af4443f6169f5567677b6daaa8c73d7dc252"},"schema_version":"1.0"},"canonical_sha256":"08d5857af21fff3138be5150cc43a50d299d8d155e2c46d60b13ea6c117fa442","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:31.557491Z","signature_b64":"qB5cJP12nsUhuPCOQabz7a+K9lnu6ARqQQRNOYXB805R8k7sHvm16ZP4VsZ/6oTe6XtpHQgbb/j07/+Vv8hZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08d5857af21fff3138be5150cc43a50d299d8d155e2c46d60b13ea6c117fa442","last_reissued_at":"2026-05-17T23:42:31.556863Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:31.556863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.10340","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-17T23:42:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qynk5JeIcbv1801glI0N5ZzucZKmbAfpea0xwNqtANSqnOstz6zgr6mZxkMayu6kJBG4f3jb3V6hsQoiWbsJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:37:11.597409Z"},"content_sha256":"93961d9bf9ac5d0b6430e026567cd842b6f968c3864710cddd35b40cd49387af","schema_version":"1.0","event_id":"sha256:93961d9bf9ac5d0b6430e026567cd842b6f968c3864710cddd35b40cd49387af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BDKYK6XSD77TCOF6KFIMYQ5FBU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Flows in Almost Linear Time via Adaptive Preconditioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Di Wang, Rasmus Kyng, Richard Peng, Sushant Sachdeva","submitted_at":"2019-06-25T06:34:40Z","abstract_excerpt":"We present algorithms for solving a large class of flow and regression problems on unit weighted graphs to $(1 + 1 / poly(n))$ accuracy in almost-linear time. These problems include $\\ell_p$-norm minimizing flow for $p$ large ($p \\in [\\omega(1), o(\\log^{2/3} n) ]$), and their duals, $\\ell_p$-norm semi-supervised learning for $p$ close to $1$.\n  As $p$ tends to infinity, $\\ell_p$-norm flow and its dual tend to max-flow and min-cut respectively. Using this connection and our algorithms, we give an alternate approach for approximating undirected max-flow, and the first almost-linear time approxim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10340","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-17T23:42:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cRFwTvHHG9v+ZUhNzC0TeCSOxuQ3sTBMC3yUjjVuY+n6kAIjrHBzqeu3AH6t+xzbjYHzYLEKmWhneCZiojBsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:37:11.597880Z"},"content_sha256":"c6287f4a3ab2a367c4f253ba9be35c385d818c77d9b9ed239b824ae4a9350e4e","schema_version":"1.0","event_id":"sha256:c6287f4a3ab2a367c4f253ba9be35c385d818c77d9b9ed239b824ae4a9350e4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BDKYK6XSD77TCOF6KFIMYQ5FBU/bundle.json","state_url":"https://pith.science/pith/BDKYK6XSD77TCOF6KFIMYQ5FBU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BDKYK6XSD77TCOF6KFIMYQ5FBU/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-26T14:37:11Z","links":{"resolver":"https://pith.science/pith/BDKYK6XSD77TCOF6KFIMYQ5FBU","bundle":"https://pith.science/pith/BDKYK6XSD77TCOF6KFIMYQ5FBU/bundle.json","state":"https://pith.science/pith/BDKYK6XSD77TCOF6KFIMYQ5FBU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BDKYK6XSD77TCOF6KFIMYQ5FBU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BDKYK6XSD77TCOF6KFIMYQ5FBU","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":"b819d4380c925f9e711cda7762e2af4443f6169f5567677b6daaa8c73d7dc252","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-25T06:34:40Z","title_canon_sha256":"8fea5cf126be0b042b8a3c7969a77cdbdb6d636d55a19e63a14fc6bdb538bbbd"},"schema_version":"1.0","source":{"id":"1906.10340","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10340","created_at":"2026-05-17T23:42:31Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10340v1","created_at":"2026-05-17T23:42:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10340","created_at":"2026-05-17T23:42:31Z"},{"alias_kind":"pith_short_12","alias_value":"BDKYK6XSD77T","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BDKYK6XSD77TCOF6","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BDKYK6XS","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:c6287f4a3ab2a367c4f253ba9be35c385d818c77d9b9ed239b824ae4a9350e4e","target":"graph","created_at":"2026-05-17T23:42:31Z","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 algorithms for solving a large class of flow and regression problems on unit weighted graphs to $(1 + 1 / poly(n))$ accuracy in almost-linear time. These problems include $\\ell_p$-norm minimizing flow for $p$ large ($p \\in [\\omega(1), o(\\log^{2/3} n) ]$), and their duals, $\\ell_p$-norm semi-supervised learning for $p$ close to $1$.\n  As $p$ tends to infinity, $\\ell_p$-norm flow and its dual tend to max-flow and min-cut respectively. Using this connection and our algorithms, we give an alternate approach for approximating undirected max-flow, and the first almost-linear time approxim","authors_text":"Di Wang, Rasmus Kyng, Richard Peng, Sushant Sachdeva","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-25T06:34:40Z","title":"Flows in Almost Linear Time via Adaptive Preconditioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10340","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:93961d9bf9ac5d0b6430e026567cd842b6f968c3864710cddd35b40cd49387af","target":"record","created_at":"2026-05-17T23:42:31Z","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":"b819d4380c925f9e711cda7762e2af4443f6169f5567677b6daaa8c73d7dc252","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-25T06:34:40Z","title_canon_sha256":"8fea5cf126be0b042b8a3c7969a77cdbdb6d636d55a19e63a14fc6bdb538bbbd"},"schema_version":"1.0","source":{"id":"1906.10340","kind":"arxiv","version":1}},"canonical_sha256":"08d5857af21fff3138be5150cc43a50d299d8d155e2c46d60b13ea6c117fa442","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08d5857af21fff3138be5150cc43a50d299d8d155e2c46d60b13ea6c117fa442","first_computed_at":"2026-05-17T23:42:31.556863Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:31.556863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qB5cJP12nsUhuPCOQabz7a+K9lnu6ARqQQRNOYXB805R8k7sHvm16ZP4VsZ/6oTe6XtpHQgbb/j07/+Vv8hZAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:31.557491Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.10340","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93961d9bf9ac5d0b6430e026567cd842b6f968c3864710cddd35b40cd49387af","sha256:c6287f4a3ab2a367c4f253ba9be35c385d818c77d9b9ed239b824ae4a9350e4e"],"state_sha256":"0c821c0641313199bf38f06946405d81da99d5a810c51b7531ede277c7c877aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i2vkP/QcRLBYjTqtr48ClD6IIEn6dQzT8gL/jgX+NNyWdL67l2KFr3DRA/G3GA1m97GFZMCxF/Xor9qPH0eWAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:37:11.600652Z","bundle_sha256":"25dd0d1e4b403e2208cf7ba44009310a5dc953d4c9586590d06d9e6b357290c2"}}