{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WG6ZXKHTJEDDQTX6OT2LDDDYIL","short_pith_number":"pith:WG6ZXKHT","canonical_record":{"source":{"id":"1311.3054","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-13T09:26:57Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"13dac0dfb412303b7a53d286499a7836e551919e58ebb57e3d211eb6799d0169","abstract_canon_sha256":"932ad33b691df059a760a6bc90844f04147e8251096bc6cfca00b4fab944f098"},"schema_version":"1.0"},"canonical_sha256":"b1bd9ba8f34906384efe74f4b18c7842d045015cdeec2c022e8b192b07ba07b0","source":{"kind":"arxiv","id":"1311.3054","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3054","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3054v2","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3054","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"WG6ZXKHTJEDD","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WG6ZXKHTJEDDQTX6","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WG6ZXKHT","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WG6ZXKHTJEDDQTX6OT2LDDDYIL","target":"record","payload":{"canonical_record":{"source":{"id":"1311.3054","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-13T09:26:57Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"13dac0dfb412303b7a53d286499a7836e551919e58ebb57e3d211eb6799d0169","abstract_canon_sha256":"932ad33b691df059a760a6bc90844f04147e8251096bc6cfca00b4fab944f098"},"schema_version":"1.0"},"canonical_sha256":"b1bd9ba8f34906384efe74f4b18c7842d045015cdeec2c022e8b192b07ba07b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:03.139578Z","signature_b64":"K7oX+J1gnd2zxRxmRwNC8Mw0UxBeA7YaAvNB6palBtwP6CTVV7NMrZfGVvgQ+FctkUuXqGMyOxtDyVq0xYfqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1bd9ba8f34906384efe74f4b18c7842d045015cdeec2c022e8b192b07ba07b0","last_reissued_at":"2026-05-18T01:26:03.139152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:03.139152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.3054","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-18T01:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vC/vGaTfwK2FOoipXluMYyC44gXP2u10uUA44HAD4MsnRy+9pK9aXwyGZFZ0b38D2slNIF9C3VybFdLV0Wz3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T17:06:30.357958Z"},"content_sha256":"8983a88a9acd118245e78fe1068f9f021997e80207de1a3d205b283b9120e2f1","schema_version":"1.0","event_id":"sha256:8983a88a9acd118245e78fe1068f9f021997e80207de1a3d205b283b9120e2f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WG6ZXKHTJEDDQTX6OT2LDDDYIL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Losing Weight by Gaining Edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Amir Abboud, Kevin Lewi, Ryan Williams","submitted_at":"2013-11-13T09:26:57Z","abstract_excerpt":"We present a new way to encode weighted sums into unweighted pairwise constraints, obtaining the following results.\n  - Define the k-SUM problem to be: given n integers in [-n^2k, n^2k] are there k which sum to zero? (It is well known that the same problem over arbitrary integers is equivalent to the above definition, by linear-time randomized reductions.) We prove that this definition of k-SUM remains W[1]-hard, and is in fact W[1]-complete: k-SUM can be reduced to f(k) * n^o(1) instances of k-Clique.\n  - The maximum node-weighted k-Clique and node-weighted k-dominating set problems can be re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3054","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":""},"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:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wZjlsPsE8sDAV13OD9Ji8gcsCtq7uiTgy+RO/FVZdwoyCCXyOl0yAUm0IyhFGUFGucqsirPmMYjiMEc57pkOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T17:06:30.358923Z"},"content_sha256":"7f3365c43cdec80ab518bdab21b562f8c4f2ead393ea200cca5e934ac57fed48","schema_version":"1.0","event_id":"sha256:7f3365c43cdec80ab518bdab21b562f8c4f2ead393ea200cca5e934ac57fed48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WG6ZXKHTJEDDQTX6OT2LDDDYIL/bundle.json","state_url":"https://pith.science/pith/WG6ZXKHTJEDDQTX6OT2LDDDYIL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WG6ZXKHTJEDDQTX6OT2LDDDYIL/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-11T17:06:30Z","links":{"resolver":"https://pith.science/pith/WG6ZXKHTJEDDQTX6OT2LDDDYIL","bundle":"https://pith.science/pith/WG6ZXKHTJEDDQTX6OT2LDDDYIL/bundle.json","state":"https://pith.science/pith/WG6ZXKHTJEDDQTX6OT2LDDDYIL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WG6ZXKHTJEDDQTX6OT2LDDDYIL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WG6ZXKHTJEDDQTX6OT2LDDDYIL","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":"932ad33b691df059a760a6bc90844f04147e8251096bc6cfca00b4fab944f098","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-13T09:26:57Z","title_canon_sha256":"13dac0dfb412303b7a53d286499a7836e551919e58ebb57e3d211eb6799d0169"},"schema_version":"1.0","source":{"id":"1311.3054","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3054","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3054v2","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3054","created_at":"2026-05-18T01:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"WG6ZXKHTJEDD","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WG6ZXKHTJEDDQTX6","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WG6ZXKHT","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:7f3365c43cdec80ab518bdab21b562f8c4f2ead393ea200cca5e934ac57fed48","target":"graph","created_at":"2026-05-18T01:26: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"},"paper":{"abstract_excerpt":"We present a new way to encode weighted sums into unweighted pairwise constraints, obtaining the following results.\n  - Define the k-SUM problem to be: given n integers in [-n^2k, n^2k] are there k which sum to zero? (It is well known that the same problem over arbitrary integers is equivalent to the above definition, by linear-time randomized reductions.) We prove that this definition of k-SUM remains W[1]-hard, and is in fact W[1]-complete: k-SUM can be reduced to f(k) * n^o(1) instances of k-Clique.\n  - The maximum node-weighted k-Clique and node-weighted k-dominating set problems can be re","authors_text":"Amir Abboud, Kevin Lewi, Ryan Williams","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-13T09:26:57Z","title":"Losing Weight by Gaining Edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3054","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:8983a88a9acd118245e78fe1068f9f021997e80207de1a3d205b283b9120e2f1","target":"record","created_at":"2026-05-18T01:26: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":"932ad33b691df059a760a6bc90844f04147e8251096bc6cfca00b4fab944f098","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-11-13T09:26:57Z","title_canon_sha256":"13dac0dfb412303b7a53d286499a7836e551919e58ebb57e3d211eb6799d0169"},"schema_version":"1.0","source":{"id":"1311.3054","kind":"arxiv","version":2}},"canonical_sha256":"b1bd9ba8f34906384efe74f4b18c7842d045015cdeec2c022e8b192b07ba07b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1bd9ba8f34906384efe74f4b18c7842d045015cdeec2c022e8b192b07ba07b0","first_computed_at":"2026-05-18T01:26:03.139152Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:03.139152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K7oX+J1gnd2zxRxmRwNC8Mw0UxBeA7YaAvNB6palBtwP6CTVV7NMrZfGVvgQ+FctkUuXqGMyOxtDyVq0xYfqDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:03.139578Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.3054","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8983a88a9acd118245e78fe1068f9f021997e80207de1a3d205b283b9120e2f1","sha256:7f3365c43cdec80ab518bdab21b562f8c4f2ead393ea200cca5e934ac57fed48"],"state_sha256":"892aa7c639544dc78f60413388a5f06c90e4ab66c0266ed04470890ca2a4a196"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TKOrNjTc+1idgL1YSWEaGOAW1yNBEdiszI7AAgBZY1T/ebTRusl+YB3ybC15ZH0VYgAL6rt59v+okX1K0SgEAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T17:06:30.370219Z","bundle_sha256":"11289eabd19f604e493f1e0c9f5ff7cd817afa6aa9051fb6ff9de51a81528e23"}}