{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:AEZDHYXHKAST3E3EREIYTSYXAF","short_pith_number":"pith:AEZDHYXH","canonical_record":{"source":{"id":"0808.4134","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-08-29T17:17:29Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"39b7f4ca04a071f4b2c2d6eb65615352684878a224149395801363a3ab32111f","abstract_canon_sha256":"56b22f95bef8aab4d997e72be4bd0e2fa095cd7d434ccde3477dd040d8ea5233"},"schema_version":"1.0"},"canonical_sha256":"013233e2e750253d9364891189cb17014ffb876eaa7c905c4a41a1047efd3a09","source":{"kind":"arxiv","id":"0808.4134","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0808.4134","created_at":"2026-07-04T17:31:59Z"},{"alias_kind":"arxiv_version","alias_value":"0808.4134v3","created_at":"2026-07-04T17:31:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.4134","created_at":"2026-07-04T17:31:59Z"},{"alias_kind":"pith_short_12","alias_value":"AEZDHYXHKAST","created_at":"2026-07-04T17:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"AEZDHYXHKAST3E3E","created_at":"2026-07-04T17:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"AEZDHYXH","created_at":"2026-07-04T17:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:AEZDHYXHKAST3E3EREIYTSYXAF","target":"record","payload":{"canonical_record":{"source":{"id":"0808.4134","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-08-29T17:17:29Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"39b7f4ca04a071f4b2c2d6eb65615352684878a224149395801363a3ab32111f","abstract_canon_sha256":"56b22f95bef8aab4d997e72be4bd0e2fa095cd7d434ccde3477dd040d8ea5233"},"schema_version":"1.0"},"canonical_sha256":"013233e2e750253d9364891189cb17014ffb876eaa7c905c4a41a1047efd3a09","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:31:59.405003Z","signature_b64":"j1t7EDHJZTX74kkOhLTBq64WwwC4WCUZQf/yxVARjUeabWdlId0b4v73JlQLbZHlMrNbQZtf7vmn5DisgaYZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"013233e2e750253d9364891189cb17014ffb876eaa7c905c4a41a1047efd3a09","last_reissued_at":"2026-07-04T17:31:59.404658Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:31:59.404658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0808.4134","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-07-04T17:31:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zABeT8/rNlSKJnWq53erE3EtzRWODSupoBSkqDd1D4UP6172otIZsmM3xTAC/HpwjpxJ1n2/kNuq/tDHwYv3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T16:50:34.056633Z"},"content_sha256":"c3f64d5f96300f3e1c6695431a752a94c4c9d53724318bf0861abe3f3c7f407f","schema_version":"1.0","event_id":"sha256:c3f64d5f96300f3e1c6695431a752a94c4c9d53724318bf0861abe3f3c7f407f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:AEZDHYXHKAST3E3EREIYTSYXAF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spectral Sparsification of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Daniel A. Spielman, Shang-Hua Teng","submitted_at":"2008-08-29T17:17:29Z","abstract_excerpt":"We introduce a new notion of graph sparsificaiton based on spectral similarity of graph Laplacians: spectral sparsification requires that the Laplacian quadratic form of the sparsifier approximate that of the original. This is equivalent to saying that the Laplacian of the sparsifier is a good preconditioner for the Laplacian of the original. We prove that every graph has a spectral sparsifier of nearly linear size. Moreover, we present an algorithm that produces spectral sparsifiers in time $\\softO{m}$, where $m$ is the number of edges in the original graph. This construction is a key compone"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.4134","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0808.4134/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T17:31:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XdzmsRgn9Z0We8wipTdaYGp4kQbxDHMghQFRSiZkokUszJvrz7GdUrqZvHD5EHOfqy2sRNrMXXOsTTYnf+23Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T16:50:34.057162Z"},"content_sha256":"8cc14fd38705d95bc2b9fbd94beef5c1d9d1b79bf226472f312112a377e1c08c","schema_version":"1.0","event_id":"sha256:8cc14fd38705d95bc2b9fbd94beef5c1d9d1b79bf226472f312112a377e1c08c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AEZDHYXHKAST3E3EREIYTSYXAF/bundle.json","state_url":"https://pith.science/pith/AEZDHYXHKAST3E3EREIYTSYXAF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AEZDHYXHKAST3E3EREIYTSYXAF/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-08-15T16:50:34Z","links":{"resolver":"https://pith.science/pith/AEZDHYXHKAST3E3EREIYTSYXAF","bundle":"https://pith.science/pith/AEZDHYXHKAST3E3EREIYTSYXAF/bundle.json","state":"https://pith.science/pith/AEZDHYXHKAST3E3EREIYTSYXAF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AEZDHYXHKAST3E3EREIYTSYXAF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:AEZDHYXHKAST3E3EREIYTSYXAF","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":"56b22f95bef8aab4d997e72be4bd0e2fa095cd7d434ccde3477dd040d8ea5233","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-08-29T17:17:29Z","title_canon_sha256":"39b7f4ca04a071f4b2c2d6eb65615352684878a224149395801363a3ab32111f"},"schema_version":"1.0","source":{"id":"0808.4134","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0808.4134","created_at":"2026-07-04T17:31:59Z"},{"alias_kind":"arxiv_version","alias_value":"0808.4134v3","created_at":"2026-07-04T17:31:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.4134","created_at":"2026-07-04T17:31:59Z"},{"alias_kind":"pith_short_12","alias_value":"AEZDHYXHKAST","created_at":"2026-07-04T17:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"AEZDHYXHKAST3E3E","created_at":"2026-07-04T17:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"AEZDHYXH","created_at":"2026-07-04T17:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:8cc14fd38705d95bc2b9fbd94beef5c1d9d1b79bf226472f312112a377e1c08c","target":"graph","created_at":"2026-07-04T17:31:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0808.4134/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce a new notion of graph sparsificaiton based on spectral similarity of graph Laplacians: spectral sparsification requires that the Laplacian quadratic form of the sparsifier approximate that of the original. This is equivalent to saying that the Laplacian of the sparsifier is a good preconditioner for the Laplacian of the original. We prove that every graph has a spectral sparsifier of nearly linear size. Moreover, we present an algorithm that produces spectral sparsifiers in time $\\softO{m}$, where $m$ is the number of edges in the original graph. This construction is a key compone","authors_text":"Daniel A. Spielman, Shang-Hua Teng","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-08-29T17:17:29Z","title":"Spectral Sparsification of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.4134","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:c3f64d5f96300f3e1c6695431a752a94c4c9d53724318bf0861abe3f3c7f407f","target":"record","created_at":"2026-07-04T17:31:59Z","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":"56b22f95bef8aab4d997e72be4bd0e2fa095cd7d434ccde3477dd040d8ea5233","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2008-08-29T17:17:29Z","title_canon_sha256":"39b7f4ca04a071f4b2c2d6eb65615352684878a224149395801363a3ab32111f"},"schema_version":"1.0","source":{"id":"0808.4134","kind":"arxiv","version":3}},"canonical_sha256":"013233e2e750253d9364891189cb17014ffb876eaa7c905c4a41a1047efd3a09","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"013233e2e750253d9364891189cb17014ffb876eaa7c905c4a41a1047efd3a09","first_computed_at":"2026-07-04T17:31:59.404658Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T17:31:59.404658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j1t7EDHJZTX74kkOhLTBq64WwwC4WCUZQf/yxVARjUeabWdlId0b4v73JlQLbZHlMrNbQZtf7vmn5DisgaYZBg==","signature_status":"signed_v1","signed_at":"2026-07-04T17:31:59.405003Z","signed_message":"canonical_sha256_bytes"},"source_id":"0808.4134","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3f64d5f96300f3e1c6695431a752a94c4c9d53724318bf0861abe3f3c7f407f","sha256:8cc14fd38705d95bc2b9fbd94beef5c1d9d1b79bf226472f312112a377e1c08c"],"state_sha256":"b1fd21edea9c2e5993d6805f50e47a5149620ef3cc81347c3e9b29449dce268d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RIycG4CljhnFPjXL2lmNghnx/Nh5EswuvKGOv2kGYKAfiV3U/3ivEDfhpkaFMpUQN5Fq90qOQwyRl3v+pKthCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T16:50:34.062536Z","bundle_sha256":"45e8e6e347c3d5ded3971f5f7576549f77f0db2e56b63356ff5414aee8e36c60"}}