{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:HWVMZUTBOVCIOPIXHBPVGZ4Z2D","short_pith_number":"pith:HWVMZUTB","canonical_record":{"source":{"id":"1111.1750","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-07T21:17:09Z","cross_cats_sorted":["cs.DC","cs.NA"],"title_canon_sha256":"5ecbb6d544dbbbf7971e6154fc1cf897e4a7c66b832e0e2466d274563c85074b","abstract_canon_sha256":"17d08381712843951e909a706581f4b625ddccebe5ba674fc182c611d5d9eba7"},"schema_version":"1.0"},"canonical_sha256":"3daaccd2617544873d17385f536799d0f10f2a9399fabbe18a5522b7cc4be0f2","source":{"kind":"arxiv","id":"1111.1750","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1750","created_at":"2026-05-18T04:09:24Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1750v1","created_at":"2026-05-18T04:09:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1750","created_at":"2026-05-18T04:09:24Z"},{"alias_kind":"pith_short_12","alias_value":"HWVMZUTBOVCI","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HWVMZUTBOVCIOPIX","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HWVMZUTB","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:HWVMZUTBOVCIOPIXHBPVGZ4Z2D","target":"record","payload":{"canonical_record":{"source":{"id":"1111.1750","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-07T21:17:09Z","cross_cats_sorted":["cs.DC","cs.NA"],"title_canon_sha256":"5ecbb6d544dbbbf7971e6154fc1cf897e4a7c66b832e0e2466d274563c85074b","abstract_canon_sha256":"17d08381712843951e909a706581f4b625ddccebe5ba674fc182c611d5d9eba7"},"schema_version":"1.0"},"canonical_sha256":"3daaccd2617544873d17385f536799d0f10f2a9399fabbe18a5522b7cc4be0f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:24.809746Z","signature_b64":"ZSLsFz3RqTJyQ1UPFjo9bPW/OYf3ufl6XOYEu2jJnGqq6UggIV8cySrFOMA+rAw0MpNxmHmMi/hVq2BwoIwgCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3daaccd2617544873d17385f536799d0f10f2a9399fabbe18a5522b7cc4be0f2","last_reissued_at":"2026-05-18T04:09:24.809069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:24.809069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.1750","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-18T04:09:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Bzsv4/t2Y+a7cGtWQk/oOtYczEUt09BHgBLK4365w2BqgIMvqGnkJkvXHAuiY9SggbU6mFhLc6AcdpRJCRbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:39:29.896377Z"},"content_sha256":"cf0d2ec59fe65903cc73d00d965c3ccf885ba9e1569e7cf640380e156bb10880","schema_version":"1.0","event_id":"sha256:cf0d2ec59fe65903cc73d00d965c3ccf885ba9e1569e7cf640380e156bb10880"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:HWVMZUTBOVCIOPIXHBPVGZ4Z2D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NA"],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, Gary L. Miller, Guy E. Blelloch, Ioannis Koutis, Kanat Tangwongsan, Richard Peng","submitted_at":"2011-11-07T21:17:09Z","abstract_excerpt":"We present the design and analysis of a near linear-work parallel algorithm for solving symmetric diagonally dominant (SDD) linear systems. On input of a SDD $n$-by-$n$ matrix $A$ with $m$ non-zero entries and a vector $b$, our algorithm computes a vector $\\tilde{x}$ such that $\\norm[A]{\\tilde{x} - A^+b} \\leq \\vareps \\cdot \\norm[A]{A^+b}$ in $O(m\\log^{O(1)}{n}\\log{\\frac1\\epsilon})$ work and $O(m^{1/3+\\theta}\\log \\frac1\\epsilon)$ depth for any fixed $\\theta > 0$.\n  The algorithm relies on a parallel algorithm for generating low-stretch spanning trees or spanning subgraphs. To this end, we first"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1750","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-18T04:09:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZdB5C8nURNcxKLSESXfyAFxV3Xq+mIf53nmdn6x4OETkcqeBzK7ryNgpeZ0wjJD3eSFeA4KGoYYAnrXUj5rfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:39:29.896944Z"},"content_sha256":"fd00c62ab719cb352560fcae40733361de2ef52a34991cc9520eb46f8a5f4584","schema_version":"1.0","event_id":"sha256:fd00c62ab719cb352560fcae40733361de2ef52a34991cc9520eb46f8a5f4584"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HWVMZUTBOVCIOPIXHBPVGZ4Z2D/bundle.json","state_url":"https://pith.science/pith/HWVMZUTBOVCIOPIXHBPVGZ4Z2D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HWVMZUTBOVCIOPIXHBPVGZ4Z2D/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-06-05T02:39:29Z","links":{"resolver":"https://pith.science/pith/HWVMZUTBOVCIOPIXHBPVGZ4Z2D","bundle":"https://pith.science/pith/HWVMZUTBOVCIOPIXHBPVGZ4Z2D/bundle.json","state":"https://pith.science/pith/HWVMZUTBOVCIOPIXHBPVGZ4Z2D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HWVMZUTBOVCIOPIXHBPVGZ4Z2D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HWVMZUTBOVCIOPIXHBPVGZ4Z2D","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":"17d08381712843951e909a706581f4b625ddccebe5ba674fc182c611d5d9eba7","cross_cats_sorted":["cs.DC","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-07T21:17:09Z","title_canon_sha256":"5ecbb6d544dbbbf7971e6154fc1cf897e4a7c66b832e0e2466d274563c85074b"},"schema_version":"1.0","source":{"id":"1111.1750","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.1750","created_at":"2026-05-18T04:09:24Z"},{"alias_kind":"arxiv_version","alias_value":"1111.1750v1","created_at":"2026-05-18T04:09:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1750","created_at":"2026-05-18T04:09:24Z"},{"alias_kind":"pith_short_12","alias_value":"HWVMZUTBOVCI","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HWVMZUTBOVCIOPIX","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HWVMZUTB","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:fd00c62ab719cb352560fcae40733361de2ef52a34991cc9520eb46f8a5f4584","target":"graph","created_at":"2026-05-18T04:09:24Z","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 the design and analysis of a near linear-work parallel algorithm for solving symmetric diagonally dominant (SDD) linear systems. On input of a SDD $n$-by-$n$ matrix $A$ with $m$ non-zero entries and a vector $b$, our algorithm computes a vector $\\tilde{x}$ such that $\\norm[A]{\\tilde{x} - A^+b} \\leq \\vareps \\cdot \\norm[A]{A^+b}$ in $O(m\\log^{O(1)}{n}\\log{\\frac1\\epsilon})$ work and $O(m^{1/3+\\theta}\\log \\frac1\\epsilon)$ depth for any fixed $\\theta > 0$.\n  The algorithm relies on a parallel algorithm for generating low-stretch spanning trees or spanning subgraphs. To this end, we first","authors_text":"Anupam Gupta, Gary L. Miller, Guy E. Blelloch, Ioannis Koutis, Kanat Tangwongsan, Richard Peng","cross_cats":["cs.DC","cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-07T21:17:09Z","title":"Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1750","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:cf0d2ec59fe65903cc73d00d965c3ccf885ba9e1569e7cf640380e156bb10880","target":"record","created_at":"2026-05-18T04:09:24Z","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":"17d08381712843951e909a706581f4b625ddccebe5ba674fc182c611d5d9eba7","cross_cats_sorted":["cs.DC","cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-07T21:17:09Z","title_canon_sha256":"5ecbb6d544dbbbf7971e6154fc1cf897e4a7c66b832e0e2466d274563c85074b"},"schema_version":"1.0","source":{"id":"1111.1750","kind":"arxiv","version":1}},"canonical_sha256":"3daaccd2617544873d17385f536799d0f10f2a9399fabbe18a5522b7cc4be0f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3daaccd2617544873d17385f536799d0f10f2a9399fabbe18a5522b7cc4be0f2","first_computed_at":"2026-05-18T04:09:24.809069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:24.809069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZSLsFz3RqTJyQ1UPFjo9bPW/OYf3ufl6XOYEu2jJnGqq6UggIV8cySrFOMA+rAw0MpNxmHmMi/hVq2BwoIwgCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:24.809746Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.1750","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf0d2ec59fe65903cc73d00d965c3ccf885ba9e1569e7cf640380e156bb10880","sha256:fd00c62ab719cb352560fcae40733361de2ef52a34991cc9520eb46f8a5f4584"],"state_sha256":"03041a761a1957b4ea22f1f8009ad1137194badb41b827deab1e9b6e1bc6166f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RErOoGqrcs4x+7UXLTWucABJvTB2XgPmTpdGVFsXEHIT4uqziBHZAyf0tAc3TTwfOeM91pnc2CSQ+urie4f2Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T02:39:29.899854Z","bundle_sha256":"c3762b31253b4c6a1f263f4efd1456a4c9113d00c4e5d6162ae7acc6cb618f21"}}