{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:SQWD43DWQQ6GSUU2WB44X26JJ7","short_pith_number":"pith:SQWD43DW","canonical_record":{"source":{"id":"2411.03451","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-05T19:08:07Z","cross_cats_sorted":["cs.DM","cs.IT","cs.LO","math.CO","math.IT"],"title_canon_sha256":"14d8a155634856616009c20a5bbba9e0a0879031f3ded93a8209b7cf4e0218ad","abstract_canon_sha256":"41add8e0f03a756cd04ff656d523960d983ca652613f2af54d41bd626d2ac217"},"schema_version":"1.0"},"canonical_sha256":"942c3e6c76843c69529ab079cbebc94febda9ae9910ef8409339a7ea4dda5937","source":{"kind":"arxiv","id":"2411.03451","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.03451","created_at":"2026-05-20T00:02:03Z"},{"alias_kind":"arxiv_version","alias_value":"2411.03451v2","created_at":"2026-05-20T00:02:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03451","created_at":"2026-05-20T00:02:03Z"},{"alias_kind":"pith_short_12","alias_value":"SQWD43DWQQ6G","created_at":"2026-05-20T00:02:03Z"},{"alias_kind":"pith_short_16","alias_value":"SQWD43DWQQ6GSUU2","created_at":"2026-05-20T00:02:03Z"},{"alias_kind":"pith_short_8","alias_value":"SQWD43DW","created_at":"2026-05-20T00:02:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:SQWD43DWQQ6GSUU2WB44X26JJ7","target":"record","payload":{"canonical_record":{"source":{"id":"2411.03451","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-05T19:08:07Z","cross_cats_sorted":["cs.DM","cs.IT","cs.LO","math.CO","math.IT"],"title_canon_sha256":"14d8a155634856616009c20a5bbba9e0a0879031f3ded93a8209b7cf4e0218ad","abstract_canon_sha256":"41add8e0f03a756cd04ff656d523960d983ca652613f2af54d41bd626d2ac217"},"schema_version":"1.0"},"canonical_sha256":"942c3e6c76843c69529ab079cbebc94febda9ae9910ef8409339a7ea4dda5937","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:03.265425Z","signature_b64":"0l/AZ1g6oI2bZHaxaN3KKBXxsA+wRAiEFWTjJOMC/JnI1mdoLAXpNYLAsopWdhDiPZoC44F2AH2g+Yu7S1snAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"942c3e6c76843c69529ab079cbebc94febda9ae9910ef8409339a7ea4dda5937","last_reissued_at":"2026-05-20T00:02:03.264630Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:03.264630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.03451","source_version":2,"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-20T00:02:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+rp12C5TZCCZHvYrSIcilpIXj/0Bn1nmE6uk8n5A8y3AzJhQ9U7QP8+K3Onvo4exOX0ij5v2hdyVkxqiy4P+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:54:55.520444Z"},"content_sha256":"04698aefd6712f6b8f901d9d2b868107ac762cb37605e449f8e20873df8f8e9e","schema_version":"1.0","event_id":"sha256:04698aefd6712f6b8f901d9d2b868107ac762cb37605e449f8e20873df8f8e9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:SQWD43DWQQ6GSUU2WB44X26JJ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Redundancy Is All You Need (for CSP Sparsification)","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.DM","cs.IT","cs.LO","math.CO","math.IT"],"primary_cat":"cs.DS","authors_text":"Joshua Brakensiek, Venkatesan Guruswami","submitted_at":"2024-11-05T19:08:07Z","abstract_excerpt":"The seminal work of Bencz\\'ur and Karger demonstrated cut sparsifiers of near-linear size. Subsequent extensions have yielded sparsifiers for hypergraph cuts and more recently linear codes over Abelian groups. A decade ago, Kogan and Krauthgamer asked about the sparsifiability of arbitrary constraint satisfaction problems (CSPs). For this question, a trivial lower bound is the size of a non-redundant CSP instance, which admits, for each constraint, an assignment satisfying only that constraint (so that no constraint can be dropped by the sparsifier). For instance, for graph cuts, spanning tree"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.03451","kind":"arxiv","version":2},"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/2411.03451/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-05-20T00:02:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aUlbt96Y7e+oDWBRDc4oJYNemveo7qLFAn64GUCQTmjf+uoHSV3EL9nAdrbnwn8fLN2RhtnUis18OE+/wC/cCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:54:55.521197Z"},"content_sha256":"ba6be19904df80d16bddfd4a5aea90adcb77eefc0d1f4f588d0b430846d41575","schema_version":"1.0","event_id":"sha256:ba6be19904df80d16bddfd4a5aea90adcb77eefc0d1f4f588d0b430846d41575"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SQWD43DWQQ6GSUU2WB44X26JJ7/bundle.json","state_url":"https://pith.science/pith/SQWD43DWQQ6GSUU2WB44X26JJ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SQWD43DWQQ6GSUU2WB44X26JJ7/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-28T17:54:55Z","links":{"resolver":"https://pith.science/pith/SQWD43DWQQ6GSUU2WB44X26JJ7","bundle":"https://pith.science/pith/SQWD43DWQQ6GSUU2WB44X26JJ7/bundle.json","state":"https://pith.science/pith/SQWD43DWQQ6GSUU2WB44X26JJ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SQWD43DWQQ6GSUU2WB44X26JJ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:SQWD43DWQQ6GSUU2WB44X26JJ7","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":"41add8e0f03a756cd04ff656d523960d983ca652613f2af54d41bd626d2ac217","cross_cats_sorted":["cs.DM","cs.IT","cs.LO","math.CO","math.IT"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-05T19:08:07Z","title_canon_sha256":"14d8a155634856616009c20a5bbba9e0a0879031f3ded93a8209b7cf4e0218ad"},"schema_version":"1.0","source":{"id":"2411.03451","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.03451","created_at":"2026-05-20T00:02:03Z"},{"alias_kind":"arxiv_version","alias_value":"2411.03451v2","created_at":"2026-05-20T00:02:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03451","created_at":"2026-05-20T00:02:03Z"},{"alias_kind":"pith_short_12","alias_value":"SQWD43DWQQ6G","created_at":"2026-05-20T00:02:03Z"},{"alias_kind":"pith_short_16","alias_value":"SQWD43DWQQ6GSUU2","created_at":"2026-05-20T00:02:03Z"},{"alias_kind":"pith_short_8","alias_value":"SQWD43DW","created_at":"2026-05-20T00:02:03Z"}],"graph_snapshots":[{"event_id":"sha256:ba6be19904df80d16bddfd4a5aea90adcb77eefc0d1f4f588d0b430846d41575","target":"graph","created_at":"2026-05-20T00:02:03Z","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/2411.03451/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The seminal work of Bencz\\'ur and Karger demonstrated cut sparsifiers of near-linear size. Subsequent extensions have yielded sparsifiers for hypergraph cuts and more recently linear codes over Abelian groups. A decade ago, Kogan and Krauthgamer asked about the sparsifiability of arbitrary constraint satisfaction problems (CSPs). For this question, a trivial lower bound is the size of a non-redundant CSP instance, which admits, for each constraint, an assignment satisfying only that constraint (so that no constraint can be dropped by the sparsifier). For instance, for graph cuts, spanning tree","authors_text":"Joshua Brakensiek, Venkatesan Guruswami","cross_cats":["cs.DM","cs.IT","cs.LO","math.CO","math.IT"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-05T19:08:07Z","title":"Redundancy Is All You Need (for CSP Sparsification)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.03451","kind":"arxiv","version":2},"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:04698aefd6712f6b8f901d9d2b868107ac762cb37605e449f8e20873df8f8e9e","target":"record","created_at":"2026-05-20T00:02:03Z","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":"41add8e0f03a756cd04ff656d523960d983ca652613f2af54d41bd626d2ac217","cross_cats_sorted":["cs.DM","cs.IT","cs.LO","math.CO","math.IT"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-05T19:08:07Z","title_canon_sha256":"14d8a155634856616009c20a5bbba9e0a0879031f3ded93a8209b7cf4e0218ad"},"schema_version":"1.0","source":{"id":"2411.03451","kind":"arxiv","version":2}},"canonical_sha256":"942c3e6c76843c69529ab079cbebc94febda9ae9910ef8409339a7ea4dda5937","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"942c3e6c76843c69529ab079cbebc94febda9ae9910ef8409339a7ea4dda5937","first_computed_at":"2026-05-20T00:02:03.264630Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:02:03.264630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0l/AZ1g6oI2bZHaxaN3KKBXxsA+wRAiEFWTjJOMC/JnI1mdoLAXpNYLAsopWdhDiPZoC44F2AH2g+Yu7S1snAw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:02:03.265425Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.03451","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04698aefd6712f6b8f901d9d2b868107ac762cb37605e449f8e20873df8f8e9e","sha256:ba6be19904df80d16bddfd4a5aea90adcb77eefc0d1f4f588d0b430846d41575"],"state_sha256":"787b648b4ff4daab8b16836e6bbfe59b27a5f328f6972a29563aae8e25869298"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XoE9mIBn9B4LBvCC5o2R9CjuWwB7X8x4GOJioPef80h5c/jb0K2UXfRpw80PZhthm8pg8KewoyTlj0FTDCMdAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T17:54:55.525241Z","bundle_sha256":"629f0a1e69c81c8260b910a5ff2914fee6e1e88f1461c80fefc14f8988af3ef9"}}