{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:H5CTUY4QAUWKLSO5BVNS4KSXHV","short_pith_number":"pith:H5CTUY4Q","canonical_record":{"source":{"id":"1102.4842","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-23T20:53:03Z","cross_cats_sorted":[],"title_canon_sha256":"120e05c7502f8c8b3394ea820666270bb5bc3c01e094d65cad393c6549d3f061","abstract_canon_sha256":"68bbbcb6a322ca36f4fad0ca2aa8a27ad43673a1ddfd2056506d45d727356291"},"schema_version":"1.0"},"canonical_sha256":"3f453a6390052ca5c9dd0d5b2e2a573d7360231743dddfa5f661e2a81c8284a5","source":{"kind":"arxiv","id":"1102.4842","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4842","created_at":"2026-05-18T04:15:06Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4842v4","created_at":"2026-05-18T04:15:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4842","created_at":"2026-05-18T04:15:06Z"},{"alias_kind":"pith_short_12","alias_value":"H5CTUY4QAUWK","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"H5CTUY4QAUWKLSO5","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"H5CTUY4Q","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:H5CTUY4QAUWKLSO5BVNS4KSXHV","target":"record","payload":{"canonical_record":{"source":{"id":"1102.4842","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-23T20:53:03Z","cross_cats_sorted":[],"title_canon_sha256":"120e05c7502f8c8b3394ea820666270bb5bc3c01e094d65cad393c6549d3f061","abstract_canon_sha256":"68bbbcb6a322ca36f4fad0ca2aa8a27ad43673a1ddfd2056506d45d727356291"},"schema_version":"1.0"},"canonical_sha256":"3f453a6390052ca5c9dd0d5b2e2a573d7360231743dddfa5f661e2a81c8284a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:06.535141Z","signature_b64":"bdIdktuQYe3eH5qlh/Q8OKbDlp6VWSx155DOxo05RvClUB2MExy4twxN1CLoPGGghBNzYqVwbOdPDNuSMUVTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f453a6390052ca5c9dd0d5b2e2a573d7360231743dddfa5f661e2a81c8284a5","last_reissued_at":"2026-05-18T04:15:06.534501Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:06.534501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.4842","source_version":4,"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-18T04:15:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CUlIqpBzunX4bzBw2q1dvVrB8l6S/UyUIU8cfZ6+VvCzz53F31m3QwPy8xmLZIAAB2iCLJBqA2Z/yajwqSExDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:55:32.954810Z"},"content_sha256":"8a9536a2005036af53b5e89d41095c29859db0690d938999e554ea65aef92061","schema_version":"1.0","event_id":"sha256:8a9536a2005036af53b5e89d41095c29859db0690d938999e554ea65aef92061"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:H5CTUY4QAUWKLSO5BVNS4KSXHV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A nearly-mlogn time solver for SDD linear systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gary Miller, Ioannis Koutis, Richard Peng","submitted_at":"2011-02-23T20:53:03Z","abstract_excerpt":"We present an improved algorithm for solving symmetrically diagonally dominant linear systems. On input of an $n\\times n$ symmetric diagonally dominant matrix $A$ with $m$ non-zero entries and a vector $b$ such that $A\\bar{x} = b$ for some (unknown) vector $\\bar{x}$, our algorithm computes a vector $x$ such that $||{x}-\\bar{x}||_A < \\epsilon ||\\bar{x}||_A $ {$||\\cdot||_A$ denotes the A-norm} in time $${\\tilde O}(m\\log n \\log (1/\\epsilon)).$$\n  The solver utilizes in a standard way a `preconditioning' chain of progressively sparser graphs. To claim the faster running time we make a two-fold imp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4842","kind":"arxiv","version":4},"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-18T04:15:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hiXVizT2PF3XnuHCbjeL3iukcTtklyWw+O/dowZCRXly6XnndQR4OTuO6ymd4zjyU5n1zhQevFOsQh5gIV5GDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:55:32.955152Z"},"content_sha256":"f55f6bab21a4789f0f2a113149fd461f3a5f4ca2c50f72f1ba0e43ca42119461","schema_version":"1.0","event_id":"sha256:f55f6bab21a4789f0f2a113149fd461f3a5f4ca2c50f72f1ba0e43ca42119461"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H5CTUY4QAUWKLSO5BVNS4KSXHV/bundle.json","state_url":"https://pith.science/pith/H5CTUY4QAUWKLSO5BVNS4KSXHV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H5CTUY4QAUWKLSO5BVNS4KSXHV/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-30T18:55:32Z","links":{"resolver":"https://pith.science/pith/H5CTUY4QAUWKLSO5BVNS4KSXHV","bundle":"https://pith.science/pith/H5CTUY4QAUWKLSO5BVNS4KSXHV/bundle.json","state":"https://pith.science/pith/H5CTUY4QAUWKLSO5BVNS4KSXHV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H5CTUY4QAUWKLSO5BVNS4KSXHV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:H5CTUY4QAUWKLSO5BVNS4KSXHV","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":"68bbbcb6a322ca36f4fad0ca2aa8a27ad43673a1ddfd2056506d45d727356291","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-23T20:53:03Z","title_canon_sha256":"120e05c7502f8c8b3394ea820666270bb5bc3c01e094d65cad393c6549d3f061"},"schema_version":"1.0","source":{"id":"1102.4842","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4842","created_at":"2026-05-18T04:15:06Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4842v4","created_at":"2026-05-18T04:15:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4842","created_at":"2026-05-18T04:15:06Z"},{"alias_kind":"pith_short_12","alias_value":"H5CTUY4QAUWK","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"H5CTUY4QAUWKLSO5","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"H5CTUY4Q","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:f55f6bab21a4789f0f2a113149fd461f3a5f4ca2c50f72f1ba0e43ca42119461","target":"graph","created_at":"2026-05-18T04:15:06Z","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 an improved algorithm for solving symmetrically diagonally dominant linear systems. On input of an $n\\times n$ symmetric diagonally dominant matrix $A$ with $m$ non-zero entries and a vector $b$ such that $A\\bar{x} = b$ for some (unknown) vector $\\bar{x}$, our algorithm computes a vector $x$ such that $||{x}-\\bar{x}||_A < \\epsilon ||\\bar{x}||_A $ {$||\\cdot||_A$ denotes the A-norm} in time $${\\tilde O}(m\\log n \\log (1/\\epsilon)).$$\n  The solver utilizes in a standard way a `preconditioning' chain of progressively sparser graphs. To claim the faster running time we make a two-fold imp","authors_text":"Gary Miller, Ioannis Koutis, Richard Peng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-23T20:53:03Z","title":"A nearly-mlogn time solver for SDD linear systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4842","kind":"arxiv","version":4},"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:8a9536a2005036af53b5e89d41095c29859db0690d938999e554ea65aef92061","target":"record","created_at":"2026-05-18T04:15:06Z","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":"68bbbcb6a322ca36f4fad0ca2aa8a27ad43673a1ddfd2056506d45d727356291","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-02-23T20:53:03Z","title_canon_sha256":"120e05c7502f8c8b3394ea820666270bb5bc3c01e094d65cad393c6549d3f061"},"schema_version":"1.0","source":{"id":"1102.4842","kind":"arxiv","version":4}},"canonical_sha256":"3f453a6390052ca5c9dd0d5b2e2a573d7360231743dddfa5f661e2a81c8284a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f453a6390052ca5c9dd0d5b2e2a573d7360231743dddfa5f661e2a81c8284a5","first_computed_at":"2026-05-18T04:15:06.534501Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:06.534501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bdIdktuQYe3eH5qlh/Q8OKbDlp6VWSx155DOxo05RvClUB2MExy4twxN1CLoPGGghBNzYqVwbOdPDNuSMUVTAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:06.535141Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.4842","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a9536a2005036af53b5e89d41095c29859db0690d938999e554ea65aef92061","sha256:f55f6bab21a4789f0f2a113149fd461f3a5f4ca2c50f72f1ba0e43ca42119461"],"state_sha256":"42303a338025d80b4212081ad7f032ab730c2b546334bd00d2cf5022206204e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZNIUeioVPLkQpJ4L2tkpIUuVaFla5qbOxggxYIa2QWhMagzWG9Gyq2axnm+EmrGKuLRiB/Gq6Skm7fcbqS/9AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:55:32.957144Z","bundle_sha256":"29693e340ece3309680bfa7f3442dadfbb18450e08a590eea8a0e8ccac772b33"}}