{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6G724PKI3NPDYIFG3FRI4H4JIA","short_pith_number":"pith:6G724PKI","canonical_record":{"source":{"id":"1507.07497","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-07-27T17:39:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5ffde815b1d88a85257c4cec533fe6642d248f905a8cddaf8275d034ebfe70d5","abstract_canon_sha256":"0f4e405b2f1b75bb38367da0eb10edf836235f228985742727f90b0f7799c402"},"schema_version":"1.0"},"canonical_sha256":"f1bfae3d48db5e3c20a6d9628e1f894004cb2191832e51812fce8c17032ce299","source":{"kind":"arxiv","id":"1507.07497","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07497","created_at":"2026-05-18T01:16:33Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07497v4","created_at":"2026-05-18T01:16:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07497","created_at":"2026-05-18T01:16:33Z"},{"alias_kind":"pith_short_12","alias_value":"6G724PKI3NPD","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6G724PKI3NPDYIFG","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6G724PKI","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6G724PKI3NPDYIFG3FRI4H4JIA","target":"record","payload":{"canonical_record":{"source":{"id":"1507.07497","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-07-27T17:39:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5ffde815b1d88a85257c4cec533fe6642d248f905a8cddaf8275d034ebfe70d5","abstract_canon_sha256":"0f4e405b2f1b75bb38367da0eb10edf836235f228985742727f90b0f7799c402"},"schema_version":"1.0"},"canonical_sha256":"f1bfae3d48db5e3c20a6d9628e1f894004cb2191832e51812fce8c17032ce299","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:33.332153Z","signature_b64":"LMLQVPZgifU679xHZgwf/Nd3rInLKjOTYIHn7PNNjHLUhBZMcNFxI8ztTxdD9uAhkdWuYUCByV+/aAT9g/MfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1bfae3d48db5e3c20a6d9628e1f894004cb2191832e51812fce8c17032ce299","last_reissued_at":"2026-05-18T01:16:33.331461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:33.331461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.07497","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-18T01:16:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w7OkAg0RmDtHcZKLPlPjQbG8NN1jNigcSI6ONkZhddG9IgpkxHDDjQdk9+J3DNRbdDZQeI+HuzgQw51oLsylBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:41:59.640845Z"},"content_sha256":"5a7f00eb9540ec8a83f915095f063c2f94041439bd15e8bf26f03db28793fae0","schema_version":"1.0","event_id":"sha256:5a7f00eb9540ec8a83f915095f063c2f94041439bd15e8bf26f03db28793fae0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6G724PKI3NPDYIFG3FRI4H4JIA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Parallel Algorithm for Spectral Sparsification of Laplacian and SDDM Matrix Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Gorav Jindal, Pavel Kolev","submitted_at":"2015-07-27T17:39:21Z","abstract_excerpt":"For \"large\" class $\\mathcal{C}$ of continuous probability density functions (p.d.f.), we demonstrate that for every $w\\in\\mathcal{C}$ there is mixture of discrete Binomial distributions (MDBD) with $T\\geq N\\sqrt{\\phi_{w}/\\delta}$ distinct Binomial distributions $B(\\cdot,N)$ that $\\delta$-approximates a discretized p.d.f. $\\widehat{w}(i/N)\\triangleq w(i/N)/[\\sum_{\\ell=0}^{N}w(\\ell/N)]$ for all $i\\in[3:N-3]$, where $\\phi_{w}\\geq\\max_{x\\in[0,1]}|w(x)|$. Also, we give two efficient parallel algorithms to find such MDBD.\n  Moreover, we propose a sequential algorithm that on input MDBD with $N=2^k$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07497","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-18T01:16:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H8+x+hg2OP/lOjKGOMp0NuP0utFTx8oyeUKvU7ua/oyE/+zqY7vXAY3LodZJ0jhvFP+cg494HjJTcDszLHUzBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:41:59.641545Z"},"content_sha256":"340faafb3d3e7aebe79de56b38809a8512669117150ce2eed33aa5cf878566bb","schema_version":"1.0","event_id":"sha256:340faafb3d3e7aebe79de56b38809a8512669117150ce2eed33aa5cf878566bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6G724PKI3NPDYIFG3FRI4H4JIA/bundle.json","state_url":"https://pith.science/pith/6G724PKI3NPDYIFG3FRI4H4JIA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6G724PKI3NPDYIFG3FRI4H4JIA/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-30T08:41:59Z","links":{"resolver":"https://pith.science/pith/6G724PKI3NPDYIFG3FRI4H4JIA","bundle":"https://pith.science/pith/6G724PKI3NPDYIFG3FRI4H4JIA/bundle.json","state":"https://pith.science/pith/6G724PKI3NPDYIFG3FRI4H4JIA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6G724PKI3NPDYIFG3FRI4H4JIA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6G724PKI3NPDYIFG3FRI4H4JIA","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":"0f4e405b2f1b75bb38367da0eb10edf836235f228985742727f90b0f7799c402","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-07-27T17:39:21Z","title_canon_sha256":"5ffde815b1d88a85257c4cec533fe6642d248f905a8cddaf8275d034ebfe70d5"},"schema_version":"1.0","source":{"id":"1507.07497","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07497","created_at":"2026-05-18T01:16:33Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07497v4","created_at":"2026-05-18T01:16:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07497","created_at":"2026-05-18T01:16:33Z"},{"alias_kind":"pith_short_12","alias_value":"6G724PKI3NPD","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6G724PKI3NPDYIFG","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6G724PKI","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:340faafb3d3e7aebe79de56b38809a8512669117150ce2eed33aa5cf878566bb","target":"graph","created_at":"2026-05-18T01:16:33Z","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":"For \"large\" class $\\mathcal{C}$ of continuous probability density functions (p.d.f.), we demonstrate that for every $w\\in\\mathcal{C}$ there is mixture of discrete Binomial distributions (MDBD) with $T\\geq N\\sqrt{\\phi_{w}/\\delta}$ distinct Binomial distributions $B(\\cdot,N)$ that $\\delta$-approximates a discretized p.d.f. $\\widehat{w}(i/N)\\triangleq w(i/N)/[\\sum_{\\ell=0}^{N}w(\\ell/N)]$ for all $i\\in[3:N-3]$, where $\\phi_{w}\\geq\\max_{x\\in[0,1]}|w(x)|$. Also, we give two efficient parallel algorithms to find such MDBD.\n  Moreover, we propose a sequential algorithm that on input MDBD with $N=2^k$ ","authors_text":"Gorav Jindal, Pavel Kolev","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-07-27T17:39:21Z","title":"An Efficient Parallel Algorithm for Spectral Sparsification of Laplacian and SDDM Matrix Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07497","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:5a7f00eb9540ec8a83f915095f063c2f94041439bd15e8bf26f03db28793fae0","target":"record","created_at":"2026-05-18T01:16:33Z","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":"0f4e405b2f1b75bb38367da0eb10edf836235f228985742727f90b0f7799c402","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-07-27T17:39:21Z","title_canon_sha256":"5ffde815b1d88a85257c4cec533fe6642d248f905a8cddaf8275d034ebfe70d5"},"schema_version":"1.0","source":{"id":"1507.07497","kind":"arxiv","version":4}},"canonical_sha256":"f1bfae3d48db5e3c20a6d9628e1f894004cb2191832e51812fce8c17032ce299","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1bfae3d48db5e3c20a6d9628e1f894004cb2191832e51812fce8c17032ce299","first_computed_at":"2026-05-18T01:16:33.331461Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:33.331461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LMLQVPZgifU679xHZgwf/Nd3rInLKjOTYIHn7PNNjHLUhBZMcNFxI8ztTxdD9uAhkdWuYUCByV+/aAT9g/MfCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:33.332153Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.07497","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a7f00eb9540ec8a83f915095f063c2f94041439bd15e8bf26f03db28793fae0","sha256:340faafb3d3e7aebe79de56b38809a8512669117150ce2eed33aa5cf878566bb"],"state_sha256":"15986703cfc1e0d651f9f3aa551d7c589be4a0f134e4caaca60b059b90c59b09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4iLUBTwhMNUck6Ui8ol2UuQnmfUm6cTv+fofYip+pCNTfcGTMIbzrnuxw3zwf0Su0FlgfbAEal8PwJnw7bY7CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:41:59.645518Z","bundle_sha256":"5171358caa26d3781413cd6a5bf4050d93cd522405099e35d98cb6fdeac9a72b"}}