{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:UIFDZFCUUGXJACLMG6XVI5ODYV","short_pith_number":"pith:UIFDZFCU","canonical_record":{"source":{"id":"1003.2958","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-03-15T16:37:51Z","cross_cats_sorted":[],"title_canon_sha256":"498a615e3c197d5d5957de1a8e8468e2d4cbe8655aede1a301ee0f6d565cf63b","abstract_canon_sha256":"d3a070cdf5716cc7c7181b1296f9edda80f8f5660d07637ee059827173dfdb6e"},"schema_version":"1.0"},"canonical_sha256":"a20a3c9454a1ae90096c37af5475c3c561175fd3ca846e51bbe3a3fc14d185b4","source":{"kind":"arxiv","id":"1003.2958","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.2958","created_at":"2026-05-18T02:24:37Z"},{"alias_kind":"arxiv_version","alias_value":"1003.2958v3","created_at":"2026-05-18T02:24:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.2958","created_at":"2026-05-18T02:24:37Z"},{"alias_kind":"pith_short_12","alias_value":"UIFDZFCUUGXJ","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UIFDZFCUUGXJACLM","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UIFDZFCU","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:UIFDZFCUUGXJACLMG6XVI5ODYV","target":"record","payload":{"canonical_record":{"source":{"id":"1003.2958","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-03-15T16:37:51Z","cross_cats_sorted":[],"title_canon_sha256":"498a615e3c197d5d5957de1a8e8468e2d4cbe8655aede1a301ee0f6d565cf63b","abstract_canon_sha256":"d3a070cdf5716cc7c7181b1296f9edda80f8f5660d07637ee059827173dfdb6e"},"schema_version":"1.0"},"canonical_sha256":"a20a3c9454a1ae90096c37af5475c3c561175fd3ca846e51bbe3a3fc14d185b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:37.124946Z","signature_b64":"os+F2DI9IkVH608un2vpBgmWZQUr6jazrHF9FQqpU2pPpexAH2fwXCne/PWLEzuKTAMM3h1o7Bk4qMFXcaJfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a20a3c9454a1ae90096c37af5475c3c561175fd3ca846e51bbe3a3fc14d185b4","last_reissued_at":"2026-05-18T02:24:37.124236Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:37.124236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1003.2958","source_version":3,"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-18T02:24:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PYeVX8BQYmVdhEpRc1IABrY+WSmvvqCIV4qmUhyncz51MoGr71Osv47bp7H/rH0WSp+L1cbX2yy/ym5JFUkpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:47:26.090619Z"},"content_sha256":"ff16a557d6721eedf739a4407b03a9d97b641ec75c48feb7d7392ea9248f6e7e","schema_version":"1.0","event_id":"sha256:ff16a557d6721eedf739a4407b03a9d97b641ec75c48feb7d7392ea9248f6e7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:UIFDZFCUUGXJACLMG6XVI5ODYV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approaching optimality for solving SDD systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gary L. Miller, Ioannis Koutis, Richard Peng","submitted_at":"2010-03-15T16:37:51Z","abstract_excerpt":"We present an algorithm that on input of an $n$-vertex $m$-edge weighted graph $G$ and a value $k$, produces an {\\em incremental sparsifier} $\\hat{G}$ with $n-1 + m/k$ edges, such that the condition number of $G$ with $\\hat{G}$ is bounded above by $\\tilde{O}(k\\log^2 n)$, with probability $1-p$. The algorithm runs in time\n  $$\\tilde{O}((m \\log{n} + n\\log^2{n})\\log(1/p)).$$\n  As a result, we obtain an algorithm that on input of an $n\\times n$ symmetric diagonally dominant matrix $A$ with $m$ non-zero entries and a vector $b$, computes a vector ${x}$ satisfying $||{x}-A^{+}b||_A<\\epsilon ||A^{+}b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.2958","kind":"arxiv","version":3},"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-18T02:24:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BqW1stLXsORgASRG47MXcFMwT391CPkprOz+MV12AzvGR73uDObJZt/jILObNBDJ7lEHlZrbx8ZT3P01LfugBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:47:26.091277Z"},"content_sha256":"a3d7803419dea3942289182858c718a255b9abff19a59e508bd671d41d66e280","schema_version":"1.0","event_id":"sha256:a3d7803419dea3942289182858c718a255b9abff19a59e508bd671d41d66e280"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UIFDZFCUUGXJACLMG6XVI5ODYV/bundle.json","state_url":"https://pith.science/pith/UIFDZFCUUGXJACLMG6XVI5ODYV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UIFDZFCUUGXJACLMG6XVI5ODYV/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-26T15:47:26Z","links":{"resolver":"https://pith.science/pith/UIFDZFCUUGXJACLMG6XVI5ODYV","bundle":"https://pith.science/pith/UIFDZFCUUGXJACLMG6XVI5ODYV/bundle.json","state":"https://pith.science/pith/UIFDZFCUUGXJACLMG6XVI5ODYV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UIFDZFCUUGXJACLMG6XVI5ODYV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:UIFDZFCUUGXJACLMG6XVI5ODYV","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":"d3a070cdf5716cc7c7181b1296f9edda80f8f5660d07637ee059827173dfdb6e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-03-15T16:37:51Z","title_canon_sha256":"498a615e3c197d5d5957de1a8e8468e2d4cbe8655aede1a301ee0f6d565cf63b"},"schema_version":"1.0","source":{"id":"1003.2958","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.2958","created_at":"2026-05-18T02:24:37Z"},{"alias_kind":"arxiv_version","alias_value":"1003.2958v3","created_at":"2026-05-18T02:24:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.2958","created_at":"2026-05-18T02:24:37Z"},{"alias_kind":"pith_short_12","alias_value":"UIFDZFCUUGXJ","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"UIFDZFCUUGXJACLM","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"UIFDZFCU","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:a3d7803419dea3942289182858c718a255b9abff19a59e508bd671d41d66e280","target":"graph","created_at":"2026-05-18T02:24:37Z","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 algorithm that on input of an $n$-vertex $m$-edge weighted graph $G$ and a value $k$, produces an {\\em incremental sparsifier} $\\hat{G}$ with $n-1 + m/k$ edges, such that the condition number of $G$ with $\\hat{G}$ is bounded above by $\\tilde{O}(k\\log^2 n)$, with probability $1-p$. The algorithm runs in time\n  $$\\tilde{O}((m \\log{n} + n\\log^2{n})\\log(1/p)).$$\n  As a result, we obtain an algorithm that on input of an $n\\times n$ symmetric diagonally dominant matrix $A$ with $m$ non-zero entries and a vector $b$, computes a vector ${x}$ satisfying $||{x}-A^{+}b||_A<\\epsilon ||A^{+}b","authors_text":"Gary L. Miller, Ioannis Koutis, Richard Peng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-03-15T16:37:51Z","title":"Approaching optimality for solving SDD systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.2958","kind":"arxiv","version":3},"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:ff16a557d6721eedf739a4407b03a9d97b641ec75c48feb7d7392ea9248f6e7e","target":"record","created_at":"2026-05-18T02:24:37Z","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":"d3a070cdf5716cc7c7181b1296f9edda80f8f5660d07637ee059827173dfdb6e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-03-15T16:37:51Z","title_canon_sha256":"498a615e3c197d5d5957de1a8e8468e2d4cbe8655aede1a301ee0f6d565cf63b"},"schema_version":"1.0","source":{"id":"1003.2958","kind":"arxiv","version":3}},"canonical_sha256":"a20a3c9454a1ae90096c37af5475c3c561175fd3ca846e51bbe3a3fc14d185b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a20a3c9454a1ae90096c37af5475c3c561175fd3ca846e51bbe3a3fc14d185b4","first_computed_at":"2026-05-18T02:24:37.124236Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:37.124236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"os+F2DI9IkVH608un2vpBgmWZQUr6jazrHF9FQqpU2pPpexAH2fwXCne/PWLEzuKTAMM3h1o7Bk4qMFXcaJfDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:37.124946Z","signed_message":"canonical_sha256_bytes"},"source_id":"1003.2958","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff16a557d6721eedf739a4407b03a9d97b641ec75c48feb7d7392ea9248f6e7e","sha256:a3d7803419dea3942289182858c718a255b9abff19a59e508bd671d41d66e280"],"state_sha256":"73b5b6464c4e6c1cdf86ee3e61001d727eef6549b20577135345b803114e8d26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Kr8s28hs9tGrEW+DCL0SkJURIYfObJAQi5EQrI8p1rl9dFsk7NrIfaqyiFWxnlkG083s9IeClXYG2alTeloBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:47:26.094478Z","bundle_sha256":"ec3c82102573c3f32a84f99787e0bfcc798d45f776e25743cedf8b119240165a"}}