{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LJNW2QPKNSASRE6VXWGQUZQHCL","short_pith_number":"pith:LJNW2QPK","canonical_record":{"source":{"id":"1905.01495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-04T13:58:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3bd2a330934d1785724521619360a050a9e37c880afaab4c79c860076760fdaf","abstract_canon_sha256":"6cc088462b700d82a2ebc39cf751111152fc57686c3b3511bca2f439108323c6"},"schema_version":"1.0"},"canonical_sha256":"5a5b6d41ea6c812893d5bd8d0a660712d889ed6b51381aadec7217d6f193e787","source":{"kind":"arxiv","id":"1905.01495","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01495","created_at":"2026-05-17T23:46:58Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01495v1","created_at":"2026-05-17T23:46:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01495","created_at":"2026-05-17T23:46:58Z"},{"alias_kind":"pith_short_12","alias_value":"LJNW2QPKNSAS","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LJNW2QPKNSASRE6V","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LJNW2QPK","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LJNW2QPKNSASRE6VXWGQUZQHCL","target":"record","payload":{"canonical_record":{"source":{"id":"1905.01495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-04T13:58:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3bd2a330934d1785724521619360a050a9e37c880afaab4c79c860076760fdaf","abstract_canon_sha256":"6cc088462b700d82a2ebc39cf751111152fc57686c3b3511bca2f439108323c6"},"schema_version":"1.0"},"canonical_sha256":"5a5b6d41ea6c812893d5bd8d0a660712d889ed6b51381aadec7217d6f193e787","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:58.406509Z","signature_b64":"UYDRPBWvFXieiCsrMFCjUH2FydzG5LQYMgn1Ivaaokvr5FcYraGSZqUdBYWD4bXcPZRnlXtpPShNKjBZ58HeBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a5b6d41ea6c812893d5bd8d0a660712d889ed6b51381aadec7217d6f193e787","last_reissued_at":"2026-05-17T23:46:58.405866Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:58.405866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.01495","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-17T23:46:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YBHGGB+N4I1+S7E02rzhbvpiLbgUxo2TG03vZMrNkJIwU52UMuYwEYG9o4Xavj6uc7ovWk0KR4cuT9MT9XE4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:40:05.407407Z"},"content_sha256":"b4306ebbf60c1cd6a91ce4df30b9bd2ee01644ffcad4fc3c3b12bd24da671f42","schema_version":"1.0","event_id":"sha256:b4306ebbf60c1cd6a91ce4df30b9bd2ee01644ffcad4fc3c3b12bd24da671f42"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LJNW2QPKNSASRE6VXWGQUZQHCL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Notions and Constructions of Sparsification for Graphs and Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Luca Trevisan, Nikhil Bansal, Ola Svensson","submitted_at":"2019-05-04T13:58:37Z","abstract_excerpt":"A sparsifier of a graph $G$ (Bencz\\'ur and Karger; Spielman and Teng) is a sparse weighted subgraph $\\tilde G$ that approximately retains the cut structure of $G$. For general graphs, non-trivial sparsification is possible only by using weighted graphs in which different edges have different weights. Even for graphs that admit unweighted sparsifiers, there are no known polynomial time algorithms that find such unweighted sparsifiers.\n  We study a weaker notion of sparsification suggested by Oveis Gharan, in which the number of edges in each cut $(S,\\bar S)$ is not approximated within a multipl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01495","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-17T23:46:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4iyKWiVNmdW4sAah3fAhOapLmZVegDNDMTJ95Irp1ipvQHFg53oaWC3vcSfK0Bu19qTV05q/aZ28uGWDTsb1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:40:05.408116Z"},"content_sha256":"7971b4efad45387f02425feff1ed5af67bc9d612e3e97b30b976024bc7fc562a","schema_version":"1.0","event_id":"sha256:7971b4efad45387f02425feff1ed5af67bc9d612e3e97b30b976024bc7fc562a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LJNW2QPKNSASRE6VXWGQUZQHCL/bundle.json","state_url":"https://pith.science/pith/LJNW2QPKNSASRE6VXWGQUZQHCL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LJNW2QPKNSASRE6VXWGQUZQHCL/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-27T09:40:05Z","links":{"resolver":"https://pith.science/pith/LJNW2QPKNSASRE6VXWGQUZQHCL","bundle":"https://pith.science/pith/LJNW2QPKNSASRE6VXWGQUZQHCL/bundle.json","state":"https://pith.science/pith/LJNW2QPKNSASRE6VXWGQUZQHCL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LJNW2QPKNSASRE6VXWGQUZQHCL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LJNW2QPKNSASRE6VXWGQUZQHCL","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":"6cc088462b700d82a2ebc39cf751111152fc57686c3b3511bca2f439108323c6","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-04T13:58:37Z","title_canon_sha256":"3bd2a330934d1785724521619360a050a9e37c880afaab4c79c860076760fdaf"},"schema_version":"1.0","source":{"id":"1905.01495","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01495","created_at":"2026-05-17T23:46:58Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01495v1","created_at":"2026-05-17T23:46:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01495","created_at":"2026-05-17T23:46:58Z"},{"alias_kind":"pith_short_12","alias_value":"LJNW2QPKNSAS","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LJNW2QPKNSASRE6V","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LJNW2QPK","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:7971b4efad45387f02425feff1ed5af67bc9d612e3e97b30b976024bc7fc562a","target":"graph","created_at":"2026-05-17T23:46:58Z","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 sparsifier of a graph $G$ (Bencz\\'ur and Karger; Spielman and Teng) is a sparse weighted subgraph $\\tilde G$ that approximately retains the cut structure of $G$. For general graphs, non-trivial sparsification is possible only by using weighted graphs in which different edges have different weights. Even for graphs that admit unweighted sparsifiers, there are no known polynomial time algorithms that find such unweighted sparsifiers.\n  We study a weaker notion of sparsification suggested by Oveis Gharan, in which the number of edges in each cut $(S,\\bar S)$ is not approximated within a multipl","authors_text":"Luca Trevisan, Nikhil Bansal, Ola Svensson","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-04T13:58:37Z","title":"New Notions and Constructions of Sparsification for Graphs and Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01495","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:b4306ebbf60c1cd6a91ce4df30b9bd2ee01644ffcad4fc3c3b12bd24da671f42","target":"record","created_at":"2026-05-17T23:46:58Z","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":"6cc088462b700d82a2ebc39cf751111152fc57686c3b3511bca2f439108323c6","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-04T13:58:37Z","title_canon_sha256":"3bd2a330934d1785724521619360a050a9e37c880afaab4c79c860076760fdaf"},"schema_version":"1.0","source":{"id":"1905.01495","kind":"arxiv","version":1}},"canonical_sha256":"5a5b6d41ea6c812893d5bd8d0a660712d889ed6b51381aadec7217d6f193e787","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a5b6d41ea6c812893d5bd8d0a660712d889ed6b51381aadec7217d6f193e787","first_computed_at":"2026-05-17T23:46:58.405866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:58.405866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UYDRPBWvFXieiCsrMFCjUH2FydzG5LQYMgn1Ivaaokvr5FcYraGSZqUdBYWD4bXcPZRnlXtpPShNKjBZ58HeBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:58.406509Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.01495","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4306ebbf60c1cd6a91ce4df30b9bd2ee01644ffcad4fc3c3b12bd24da671f42","sha256:7971b4efad45387f02425feff1ed5af67bc9d612e3e97b30b976024bc7fc562a"],"state_sha256":"d60a801ac21c4c4f436b8edb56d7efe1361913c686c35a73fb9fab58e100e53b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eIuq5KX07Tt1QKxBoot5g0uQ6nuRu/1u303G56HinycwwJ/icDE8GX0l5J9cIUqSWnPUq94dByu53Jk3JVNEDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:40:05.412400Z","bundle_sha256":"b15ed42e1bb2673d00b65524f4df8ed0e0d6060098c1bc6222b3cd0859cc5a87"}}