{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SDUMRFSSWINDYLU6TC27KPVA6P","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":"b4b4e56d1e659b34e0cb164dde53905f9b8c34c591985722466614b60748f631","cross_cats_sorted":["cs.CC","cs.CG","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-17T11:27:30Z","title_canon_sha256":"4c79057100e0d0df9f89652f470d31b5280be11d4783027cf78637c4ec81b739"},"schema_version":"1.0","source":{"id":"1407.4640","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.4640","created_at":"2026-05-18T02:27:44Z"},{"alias_kind":"arxiv_version","alias_value":"1407.4640v5","created_at":"2026-05-18T02:27:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4640","created_at":"2026-05-18T02:27:44Z"},{"alias_kind":"pith_short_12","alias_value":"SDUMRFSSWIND","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SDUMRFSSWINDYLU6","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SDUMRFSS","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:5b490d51184a22976084b063eb7f58ba2e193d6cf9994a4c4dc3105f5bc83a1b","target":"graph","created_at":"2026-05-18T02:27:44Z","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 determined algorithm is presented for solving the rSUM problem for any natural r with a sub-quadratic assessment of time complexity in some cases. In terms of an amount of memory used the obtained algorithm is the nlog^3(n) order.\n  The idea of the obtained algorithm is based not considering integer numbers, but rather k (is a natural) successive bits of these numbers in the binary numeration system. It is shown that if a sum of integer numbers is equal to zero, then the sum of numbers presented by any k successive bits of these numbers must be sufficiently \"close\" to zero. This makes it pos","authors_text":"Valerii Sopin","cross_cats":["cs.CC","cs.CG","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-17T11:27:30Z","title":"A new algorithm for solving the rSUM problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4640","kind":"arxiv","version":5},"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:ea0d051d07ae7a9a159c655df2f6c79f1a46572ed622e3a39f6482f16437182d","target":"record","created_at":"2026-05-18T02:27:44Z","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":"b4b4e56d1e659b34e0cb164dde53905f9b8c34c591985722466614b60748f631","cross_cats_sorted":["cs.CC","cs.CG","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-17T11:27:30Z","title_canon_sha256":"4c79057100e0d0df9f89652f470d31b5280be11d4783027cf78637c4ec81b739"},"schema_version":"1.0","source":{"id":"1407.4640","kind":"arxiv","version":5}},"canonical_sha256":"90e8c89652b21a3c2e9e98b5f53ea0f3e7ff0742323bafb253747a8f7808e1ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90e8c89652b21a3c2e9e98b5f53ea0f3e7ff0742323bafb253747a8f7808e1ff","first_computed_at":"2026-05-18T02:27:44.435941Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:44.435941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"smrojVlKbaruuW4n52SiXOEJpgVNhBfgBy+PbfrZErKp0bc6qtnXh6BZF3c0BMwrx1JNUX+7fQwnrHbGNhuECA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:44.436441Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.4640","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea0d051d07ae7a9a159c655df2f6c79f1a46572ed622e3a39f6482f16437182d","sha256:5b490d51184a22976084b063eb7f58ba2e193d6cf9994a4c4dc3105f5bc83a1b"],"state_sha256":"257b56092e39996a559fdb8ebf48dbf3fab9199ab8fc52729091c8d75c0f73c3"}