{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FCZYQHPPYEJCPKZL4HBV2FI2RS","short_pith_number":"pith:FCZYQHPP","canonical_record":{"source":{"id":"1611.06940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-21T18:44:25Z","cross_cats_sorted":[],"title_canon_sha256":"3bec404a0949f6b77dfc306e4bca947dc2ac9e48e1cbdc8df3dc2f641278b265","abstract_canon_sha256":"e619c2924b5098225ee77e3c1076ef3ea3f7ed903fcc71295f1d84e838c86b52"},"schema_version":"1.0"},"canonical_sha256":"28b3881defc11227ab2be1c35d151a8c868191a5fd76ba1b093a7570c3ad4a86","source":{"kind":"arxiv","id":"1611.06940","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06940","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06940v1","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06940","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"pith_short_12","alias_value":"FCZYQHPPYEJC","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FCZYQHPPYEJCPKZL","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FCZYQHPP","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FCZYQHPPYEJCPKZL4HBV2FI2RS","target":"record","payload":{"canonical_record":{"source":{"id":"1611.06940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-21T18:44:25Z","cross_cats_sorted":[],"title_canon_sha256":"3bec404a0949f6b77dfc306e4bca947dc2ac9e48e1cbdc8df3dc2f641278b265","abstract_canon_sha256":"e619c2924b5098225ee77e3c1076ef3ea3f7ed903fcc71295f1d84e838c86b52"},"schema_version":"1.0"},"canonical_sha256":"28b3881defc11227ab2be1c35d151a8c868191a5fd76ba1b093a7570c3ad4a86","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:32.473170Z","signature_b64":"8a6z8c5P7O2GVPrQoZTrE6C4AY9iROIUqahSo9JQumpF0pE1Ut1A206hAKYSVkruz6RfacFTJnQ42MGqDxVADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28b3881defc11227ab2be1c35d151a8c868191a5fd76ba1b093a7570c3ad4a86","last_reissued_at":"2026-05-18T00:57:32.472542Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:32.472542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.06940","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-18T00:57:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qtDuqgQVd492md8Qnjl2sJ5i5ilPXKnAYH91O/iPgQ1YLgxP364BJ9svzwi78QQ7acZRPENuMymLj9Ib8NSmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:38:48.295492Z"},"content_sha256":"ad642f74a5df5ba019f50a4bf0994edbe95ddf11b58d093332ee4bbe1c059a90","schema_version":"1.0","event_id":"sha256:ad642f74a5df5ba019f50a4bf0994edbe95ddf11b58d093332ee4bbe1c059a90"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FCZYQHPPYEJCPKZL4HBV2FI2RS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Framework for Analyzing Resparsification Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakub Pachocki, Rasmus Kyng, Richard Peng, Sushant Sachdeva","submitted_at":"2016-11-21T18:44:25Z","abstract_excerpt":"A spectral sparsifier of a graph $G$ is a sparser graph $H$ that approximately preserves the quadratic form of $G$, i.e. for all vectors $x$, $x^T L_G x \\approx x^T L_H x$, where $L_G$ and $L_H$ denote the respective graph Laplacians. Spectral sparsifiers generalize cut sparsifiers, and have found many applications in designing graph algorithms. In recent years, there has been interest in computing spectral sparsifiers in semi-streaming and dynamic settings. Natural algorithms in these settings often involve repeated sparsification of a graph, and accumulation of errors across these steps. We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06940","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-18T00:57:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HP3Ct68bame+YS1JVlrdNPloAavLKY5Gg9dTiSpfCh8OLUn6pMU2qJ2/mChHyTExrwecE5rru7SSgIgoMqyLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:38:48.295837Z"},"content_sha256":"688eb7b1707b41f2cd5b32ec2993d34028512576ff10c6f4673d3ef78264e790","schema_version":"1.0","event_id":"sha256:688eb7b1707b41f2cd5b32ec2993d34028512576ff10c6f4673d3ef78264e790"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FCZYQHPPYEJCPKZL4HBV2FI2RS/bundle.json","state_url":"https://pith.science/pith/FCZYQHPPYEJCPKZL4HBV2FI2RS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FCZYQHPPYEJCPKZL4HBV2FI2RS/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-27T02:38:48Z","links":{"resolver":"https://pith.science/pith/FCZYQHPPYEJCPKZL4HBV2FI2RS","bundle":"https://pith.science/pith/FCZYQHPPYEJCPKZL4HBV2FI2RS/bundle.json","state":"https://pith.science/pith/FCZYQHPPYEJCPKZL4HBV2FI2RS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FCZYQHPPYEJCPKZL4HBV2FI2RS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FCZYQHPPYEJCPKZL4HBV2FI2RS","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":"e619c2924b5098225ee77e3c1076ef3ea3f7ed903fcc71295f1d84e838c86b52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-21T18:44:25Z","title_canon_sha256":"3bec404a0949f6b77dfc306e4bca947dc2ac9e48e1cbdc8df3dc2f641278b265"},"schema_version":"1.0","source":{"id":"1611.06940","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06940","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06940v1","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06940","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"pith_short_12","alias_value":"FCZYQHPPYEJC","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FCZYQHPPYEJCPKZL","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FCZYQHPP","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:688eb7b1707b41f2cd5b32ec2993d34028512576ff10c6f4673d3ef78264e790","target":"graph","created_at":"2026-05-18T00:57:32Z","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":"A spectral sparsifier of a graph $G$ is a sparser graph $H$ that approximately preserves the quadratic form of $G$, i.e. for all vectors $x$, $x^T L_G x \\approx x^T L_H x$, where $L_G$ and $L_H$ denote the respective graph Laplacians. Spectral sparsifiers generalize cut sparsifiers, and have found many applications in designing graph algorithms. In recent years, there has been interest in computing spectral sparsifiers in semi-streaming and dynamic settings. Natural algorithms in these settings often involve repeated sparsification of a graph, and accumulation of errors across these steps. We ","authors_text":"Jakub Pachocki, Rasmus Kyng, Richard Peng, Sushant Sachdeva","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-21T18:44:25Z","title":"A Framework for Analyzing Resparsification Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06940","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:ad642f74a5df5ba019f50a4bf0994edbe95ddf11b58d093332ee4bbe1c059a90","target":"record","created_at":"2026-05-18T00:57:32Z","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":"e619c2924b5098225ee77e3c1076ef3ea3f7ed903fcc71295f1d84e838c86b52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-21T18:44:25Z","title_canon_sha256":"3bec404a0949f6b77dfc306e4bca947dc2ac9e48e1cbdc8df3dc2f641278b265"},"schema_version":"1.0","source":{"id":"1611.06940","kind":"arxiv","version":1}},"canonical_sha256":"28b3881defc11227ab2be1c35d151a8c868191a5fd76ba1b093a7570c3ad4a86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28b3881defc11227ab2be1c35d151a8c868191a5fd76ba1b093a7570c3ad4a86","first_computed_at":"2026-05-18T00:57:32.472542Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:32.472542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8a6z8c5P7O2GVPrQoZTrE6C4AY9iROIUqahSo9JQumpF0pE1Ut1A206hAKYSVkruz6RfacFTJnQ42MGqDxVADQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:32.473170Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.06940","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad642f74a5df5ba019f50a4bf0994edbe95ddf11b58d093332ee4bbe1c059a90","sha256:688eb7b1707b41f2cd5b32ec2993d34028512576ff10c6f4673d3ef78264e790"],"state_sha256":"d613a8a0354fb12fb80f34b5583dfcfefdca601948721e6737c821e41df7212c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3IrBFhAGB4I2rk814eTkIhZxk1+6VKqST/KY2eLfnQ4dfjAUBRvZtTpUJuTAaLK/cxy5FGuVvX3DsW2Tu+IMCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:38:48.298177Z","bundle_sha256":"bfb9644ce579ca325b74fd9bae4c077e038e7b7603be45841d99e566900fc032"}}