{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QYJFCJXRD22UU5OUQVOG33FGIM","short_pith_number":"pith:QYJFCJXR","schema_version":"1.0","canonical_sha256":"86125126f11eb54a75d4855c6deca6430ca3c38b4d4a6e5c188d5b58fc688a70","source":{"kind":"arxiv","id":"1907.04295","version":2},"attestation_state":"computed","paper":{"title":"Better Sample -- Random Subset Sum in $2^{0.255n}$ and its Impact on Decoding Random Linear Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Alexander May, Andre Esser","submitted_at":"2019-07-09T17:22:57Z","abstract_excerpt":"We propose a new heuristic algorithm for solving random subset sum instances $a_1, \\ldots, a_n, t \\in \\mathbb{Z}_{2^n}$, which play a crucial role in cryptographic constructions. Our algorithm is search tree-based and solves the instances in a divide-and-conquer method using the representation method. From a high level perspective, our algorithm is similar to the algorithm of Howgrave-Graham-Joux (HGJ) and Becker-Coron-Joux (BCJ), but instead of enumerating the initial lists we sample candidate solutions. So whereas HGJ and BCJ are based on combinatorics, our analysis is stochastic. Our sampli"},"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":"1907.04295","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T17:22:57Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"63172a742c093b1c5efcbca5f3a4a378b4587b02ba5e1765466e4fc6b188a255","abstract_canon_sha256":"e91616ef1adc3533a4bfbe3282484fef9f2423edf6b5bcbbc98dd8516ca705f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:13:15.457372Z","signature_b64":"ht7jL3ZJH0Ej9TjlZrjX3Xuez39u1a0RL/57W5rVQ1nKgQ8zkSu2n7a7Wq6D3JOal8tHua8ohp1i6x6umajCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86125126f11eb54a75d4855c6deca6430ca3c38b4d4a6e5c188d5b58fc688a70","last_reissued_at":"2026-07-05T00:13:15.456954Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:13:15.456954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Better Sample -- Random Subset Sum in $2^{0.255n}$ and its Impact on Decoding Random Linear Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DS","authors_text":"Alexander May, Andre Esser","submitted_at":"2019-07-09T17:22:57Z","abstract_excerpt":"We propose a new heuristic algorithm for solving random subset sum instances $a_1, \\ldots, a_n, t \\in \\mathbb{Z}_{2^n}$, which play a crucial role in cryptographic constructions. Our algorithm is search tree-based and solves the instances in a divide-and-conquer method using the representation method. From a high level perspective, our algorithm is similar to the algorithm of Howgrave-Graham-Joux (HGJ) and Becker-Coron-Joux (BCJ), but instead of enumerating the initial lists we sample candidate solutions. So whereas HGJ and BCJ are based on combinatorics, our analysis is stochastic. Our sampli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04295","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/1907.04295/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.04295","created_at":"2026-07-05T00:13:15.457016+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.04295v2","created_at":"2026-07-05T00:13:15.457016+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04295","created_at":"2026-07-05T00:13:15.457016+00:00"},{"alias_kind":"pith_short_12","alias_value":"QYJFCJXRD22U","created_at":"2026-07-05T00:13:15.457016+00:00"},{"alias_kind":"pith_short_16","alias_value":"QYJFCJXRD22UU5OU","created_at":"2026-07-05T00:13:15.457016+00:00"},{"alias_kind":"pith_short_8","alias_value":"QYJFCJXR","created_at":"2026-07-05T00:13:15.457016+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/QYJFCJXRD22UU5OUQVOG33FGIM","json":"https://pith.science/pith/QYJFCJXRD22UU5OUQVOG33FGIM.json","graph_json":"https://pith.science/api/pith-number/QYJFCJXRD22UU5OUQVOG33FGIM/graph.json","events_json":"https://pith.science/api/pith-number/QYJFCJXRD22UU5OUQVOG33FGIM/events.json","paper":"https://pith.science/paper/QYJFCJXR"},"agent_actions":{"view_html":"https://pith.science/pith/QYJFCJXRD22UU5OUQVOG33FGIM","download_json":"https://pith.science/pith/QYJFCJXRD22UU5OUQVOG33FGIM.json","view_paper":"https://pith.science/paper/QYJFCJXR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.04295&json=true","fetch_graph":"https://pith.science/api/pith-number/QYJFCJXRD22UU5OUQVOG33FGIM/graph.json","fetch_events":"https://pith.science/api/pith-number/QYJFCJXRD22UU5OUQVOG33FGIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QYJFCJXRD22UU5OUQVOG33FGIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QYJFCJXRD22UU5OUQVOG33FGIM/action/storage_attestation","attest_author":"https://pith.science/pith/QYJFCJXRD22UU5OUQVOG33FGIM/action/author_attestation","sign_citation":"https://pith.science/pith/QYJFCJXRD22UU5OUQVOG33FGIM/action/citation_signature","submit_replication":"https://pith.science/pith/QYJFCJXRD22UU5OUQVOG33FGIM/action/replication_record"}},"created_at":"2026-07-05T00:13:15.457016+00:00","updated_at":"2026-07-05T00:13:15.457016+00:00"}