{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SDUMRFSSWINDYLU6TC27KPVA6P","short_pith_number":"pith:SDUMRFSS","schema_version":"1.0","canonical_sha256":"90e8c89652b21a3c2e9e98b5f53ea0f3e7ff0742323bafb253747a8f7808e1ff","source":{"kind":"arxiv","id":"1407.4640","version":5},"attestation_state":"computed","paper":{"title":"A new algorithm for solving the rSUM problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG","math.NT"],"primary_cat":"cs.DS","authors_text":"Valerii Sopin","submitted_at":"2014-07-17T11:27:30Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1407.4640","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-17T11:27:30Z","cross_cats_sorted":["cs.CC","cs.CG","math.NT"],"title_canon_sha256":"4c79057100e0d0df9f89652f470d31b5280be11d4783027cf78637c4ec81b739","abstract_canon_sha256":"b4b4e56d1e659b34e0cb164dde53905f9b8c34c591985722466614b60748f631"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:44.436441Z","signature_b64":"smrojVlKbaruuW4n52SiXOEJpgVNhBfgBy+PbfrZErKp0bc6qtnXh6BZF3c0BMwrx1JNUX+7fQwnrHbGNhuECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90e8c89652b21a3c2e9e98b5f53ea0f3e7ff0742323bafb253747a8f7808e1ff","last_reissued_at":"2026-05-18T02:27:44.435941Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:44.435941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new algorithm for solving the rSUM problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG","math.NT"],"primary_cat":"cs.DS","authors_text":"Valerii Sopin","submitted_at":"2014-07-17T11:27:30Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4640","kind":"arxiv","version":5},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.4640","created_at":"2026-05-18T02:27:44.436008+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.4640v5","created_at":"2026-05-18T02:27:44.436008+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4640","created_at":"2026-05-18T02:27:44.436008+00:00"},{"alias_kind":"pith_short_12","alias_value":"SDUMRFSSWIND","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SDUMRFSSWINDYLU6","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SDUMRFSS","created_at":"2026-05-18T12:28:49.207871+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SDUMRFSSWINDYLU6TC27KPVA6P","json":"https://pith.science/pith/SDUMRFSSWINDYLU6TC27KPVA6P.json","graph_json":"https://pith.science/api/pith-number/SDUMRFSSWINDYLU6TC27KPVA6P/graph.json","events_json":"https://pith.science/api/pith-number/SDUMRFSSWINDYLU6TC27KPVA6P/events.json","paper":"https://pith.science/paper/SDUMRFSS"},"agent_actions":{"view_html":"https://pith.science/pith/SDUMRFSSWINDYLU6TC27KPVA6P","download_json":"https://pith.science/pith/SDUMRFSSWINDYLU6TC27KPVA6P.json","view_paper":"https://pith.science/paper/SDUMRFSS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.4640&json=true","fetch_graph":"https://pith.science/api/pith-number/SDUMRFSSWINDYLU6TC27KPVA6P/graph.json","fetch_events":"https://pith.science/api/pith-number/SDUMRFSSWINDYLU6TC27KPVA6P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SDUMRFSSWINDYLU6TC27KPVA6P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SDUMRFSSWINDYLU6TC27KPVA6P/action/storage_attestation","attest_author":"https://pith.science/pith/SDUMRFSSWINDYLU6TC27KPVA6P/action/author_attestation","sign_citation":"https://pith.science/pith/SDUMRFSSWINDYLU6TC27KPVA6P/action/citation_signature","submit_replication":"https://pith.science/pith/SDUMRFSSWINDYLU6TC27KPVA6P/action/replication_record"}},"created_at":"2026-05-18T02:27:44.436008+00:00","updated_at":"2026-05-18T02:27:44.436008+00:00"}