{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CDVV3L6E66M63PTGNUKD4AYV3Z","short_pith_number":"pith:CDVV3L6E","canonical_record":{"source":{"id":"1807.04825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T21:18:31Z","cross_cats_sorted":[],"title_canon_sha256":"8b94b5d2b97e434621c6ec07b5359214489055c2e970ca6356bf1af15cef8ae7","abstract_canon_sha256":"73aaee2f9aa198650398e59988933e432d8a3aae2a7941fb08a1db5e5e4ad077"},"schema_version":"1.0"},"canonical_sha256":"10eb5dafc4f799edbe666d143e0315de69a08d51c1991fbfc92dabefa686d895","source":{"kind":"arxiv","id":"1807.04825","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04825","created_at":"2026-05-18T00:10:49Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04825v1","created_at":"2026-05-18T00:10:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04825","created_at":"2026-05-18T00:10:49Z"},{"alias_kind":"pith_short_12","alias_value":"CDVV3L6E66M6","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CDVV3L6E66M63PTG","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CDVV3L6E","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CDVV3L6E66M63PTGNUKD4AYV3Z","target":"record","payload":{"canonical_record":{"source":{"id":"1807.04825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T21:18:31Z","cross_cats_sorted":[],"title_canon_sha256":"8b94b5d2b97e434621c6ec07b5359214489055c2e970ca6356bf1af15cef8ae7","abstract_canon_sha256":"73aaee2f9aa198650398e59988933e432d8a3aae2a7941fb08a1db5e5e4ad077"},"schema_version":"1.0"},"canonical_sha256":"10eb5dafc4f799edbe666d143e0315de69a08d51c1991fbfc92dabefa686d895","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:49.719092Z","signature_b64":"LdbvBO1oAY0B3x8BOxoarJcUHTMbyQ2HI3JPiCxRYXTNl9irLdbwt41GphMDsVklZBoK/SrG1bLBNriz5jAbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10eb5dafc4f799edbe666d143e0315de69a08d51c1991fbfc92dabefa686d895","last_reissued_at":"2026-05-18T00:10:49.718614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:49.718614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.04825","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:10:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3prZ+Vo4ADVSpRQLf/YJOEIRGGGCZ3J9ajlNonATjEXq6rUcplSymb42O0RbA0zxoQlLiMJkMdPHJK3ec1InBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:19:43.755804Z"},"content_sha256":"56637a8756b5e4496550ef1757d207c6c32649a2862b959b1f10479b47f96dc1","schema_version":"1.0","event_id":"sha256:56637a8756b5e4496550ef1757d207c6c32649a2862b959b1f10479b47f96dc1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CDVV3L6E66M63PTGNUKD4AYV3Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Modular Subset Sum using Linear Sketching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arturs Backurs, Christos Tzamos, Kyriakos Axiotis","submitted_at":"2018-07-12T21:18:31Z","abstract_excerpt":"Given n positive integers, the Modular Subset Sum problem asks if a subset adds up to a given target t modulo a given integer m. This is a natural generalization of the Subset Sum problem (where m=+\\infty) with ties to additive combinatorics and cryptography.\n  Recently, in [Bringmann, SODA'17] and [Koiliaris and Xu, SODA'17], efficient algorithms have been developed for the non-modular case, running in near-linear pseudo-polynomial time. For the modular case, however, the best known algorithm by Koiliaris and Xu [Koiliaris and Xu, SODA'17] runs in time O~(m^{5/4}).\n  In this paper, we present"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04825","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:10:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0bB9jvJM7jjcaGgHf19qiG5ceYPhvUviDRlw7w7Dl1T0jvh8TH+8ag91IBQJeuYCNHP+o4Jv9Qw7dAY4K8+6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:19:43.756470Z"},"content_sha256":"3709fee47f5b8cae8521bbff78174b9ae6176a06dc77a3c492cc9a538a2a1418","schema_version":"1.0","event_id":"sha256:3709fee47f5b8cae8521bbff78174b9ae6176a06dc77a3c492cc9a538a2a1418"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CDVV3L6E66M63PTGNUKD4AYV3Z/bundle.json","state_url":"https://pith.science/pith/CDVV3L6E66M63PTGNUKD4AYV3Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CDVV3L6E66M63PTGNUKD4AYV3Z/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-30T07:19:43Z","links":{"resolver":"https://pith.science/pith/CDVV3L6E66M63PTGNUKD4AYV3Z","bundle":"https://pith.science/pith/CDVV3L6E66M63PTGNUKD4AYV3Z/bundle.json","state":"https://pith.science/pith/CDVV3L6E66M63PTGNUKD4AYV3Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CDVV3L6E66M63PTGNUKD4AYV3Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CDVV3L6E66M63PTGNUKD4AYV3Z","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":"73aaee2f9aa198650398e59988933e432d8a3aae2a7941fb08a1db5e5e4ad077","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T21:18:31Z","title_canon_sha256":"8b94b5d2b97e434621c6ec07b5359214489055c2e970ca6356bf1af15cef8ae7"},"schema_version":"1.0","source":{"id":"1807.04825","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04825","created_at":"2026-05-18T00:10:49Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04825v1","created_at":"2026-05-18T00:10:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04825","created_at":"2026-05-18T00:10:49Z"},{"alias_kind":"pith_short_12","alias_value":"CDVV3L6E66M6","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CDVV3L6E66M63PTG","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CDVV3L6E","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:3709fee47f5b8cae8521bbff78174b9ae6176a06dc77a3c492cc9a538a2a1418","target":"graph","created_at":"2026-05-18T00:10:49Z","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":"Given n positive integers, the Modular Subset Sum problem asks if a subset adds up to a given target t modulo a given integer m. This is a natural generalization of the Subset Sum problem (where m=+\\infty) with ties to additive combinatorics and cryptography.\n  Recently, in [Bringmann, SODA'17] and [Koiliaris and Xu, SODA'17], efficient algorithms have been developed for the non-modular case, running in near-linear pseudo-polynomial time. For the modular case, however, the best known algorithm by Koiliaris and Xu [Koiliaris and Xu, SODA'17] runs in time O~(m^{5/4}).\n  In this paper, we present","authors_text":"Arturs Backurs, Christos Tzamos, Kyriakos Axiotis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T21:18:31Z","title":"Fast Modular Subset Sum using Linear Sketching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04825","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:56637a8756b5e4496550ef1757d207c6c32649a2862b959b1f10479b47f96dc1","target":"record","created_at":"2026-05-18T00:10:49Z","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":"73aaee2f9aa198650398e59988933e432d8a3aae2a7941fb08a1db5e5e4ad077","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T21:18:31Z","title_canon_sha256":"8b94b5d2b97e434621c6ec07b5359214489055c2e970ca6356bf1af15cef8ae7"},"schema_version":"1.0","source":{"id":"1807.04825","kind":"arxiv","version":1}},"canonical_sha256":"10eb5dafc4f799edbe666d143e0315de69a08d51c1991fbfc92dabefa686d895","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10eb5dafc4f799edbe666d143e0315de69a08d51c1991fbfc92dabefa686d895","first_computed_at":"2026-05-18T00:10:49.718614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:49.718614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LdbvBO1oAY0B3x8BOxoarJcUHTMbyQ2HI3JPiCxRYXTNl9irLdbwt41GphMDsVklZBoK/SrG1bLBNriz5jAbDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:49.719092Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.04825","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56637a8756b5e4496550ef1757d207c6c32649a2862b959b1f10479b47f96dc1","sha256:3709fee47f5b8cae8521bbff78174b9ae6176a06dc77a3c492cc9a538a2a1418"],"state_sha256":"8504dc1332fdd283ae9a0be6c3071df233162ee96d8a2c670c961392ba3e488c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eo3G+2I/Uliwh4+ztB0EkS1BHiSJBQQeAArdWZROOzb+Ls3qqlSJtcrPgPVwnZgovnN+Ye/CdPDCfgiX/SroAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:19:43.759932Z","bundle_sha256":"ba66dcda6b12d774015c833e31474af6746df4042ae2352ccff5191a39b2d012"}}