{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GPHE5ZR3OYHXQWGTQD2SB6UFPS","short_pith_number":"pith:GPHE5ZR3","canonical_record":{"source":{"id":"2605.04465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-06T03:46:44Z","cross_cats_sorted":[],"title_canon_sha256":"944165a4ccc159a5112ffdf07a3ddf5ff15287be2e5c4a968bd141791ed950c9","abstract_canon_sha256":"6e49397fa53803a5275ba18fcbdafd102d904769885b39fe1750244a5563e969"},"schema_version":"1.0"},"canonical_sha256":"33ce4ee63b760f7858d380f520fa857c8b44db2dcfd722a59f3b890e336282e2","source":{"kind":"arxiv","id":"2605.04465","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.04465","created_at":"2026-05-21T01:04:26Z"},{"alias_kind":"arxiv_version","alias_value":"2605.04465v2","created_at":"2026-05-21T01:04:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.04465","created_at":"2026-05-21T01:04:26Z"},{"alias_kind":"pith_short_12","alias_value":"GPHE5ZR3OYHX","created_at":"2026-05-21T01:04:26Z"},{"alias_kind":"pith_short_16","alias_value":"GPHE5ZR3OYHXQWGT","created_at":"2026-05-21T01:04:26Z"},{"alias_kind":"pith_short_8","alias_value":"GPHE5ZR3","created_at":"2026-05-21T01:04:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GPHE5ZR3OYHXQWGTQD2SB6UFPS","target":"record","payload":{"canonical_record":{"source":{"id":"2605.04465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-06T03:46:44Z","cross_cats_sorted":[],"title_canon_sha256":"944165a4ccc159a5112ffdf07a3ddf5ff15287be2e5c4a968bd141791ed950c9","abstract_canon_sha256":"6e49397fa53803a5275ba18fcbdafd102d904769885b39fe1750244a5563e969"},"schema_version":"1.0"},"canonical_sha256":"33ce4ee63b760f7858d380f520fa857c8b44db2dcfd722a59f3b890e336282e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:26.759578Z","signature_b64":"Uz75zMthyYaR9yBRWwLmhn8gbtUw3q+R+xmwt0Lc3fU2Z/5D7ZE4RzF5ARE1n3ze51ZrEoJOIcwuUkp/FuJ/DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33ce4ee63b760f7858d380f520fa857c8b44db2dcfd722a59f3b890e336282e2","last_reissued_at":"2026-05-21T01:04:26.758979Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:26.758979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.04465","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-21T01:04:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qOalxoofFZwo9B+nOnzeB4BXSTL9X67pAlNpJLVasc1m/d2pa3ypllICMPsN9NttxqvWJ1GvXKu/IotpdWAgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:00:25.664575Z"},"content_sha256":"2dedcdb758667990dfbda270c7a3b3fae94f687a04bc353f5ae755dadaa4cefd","schema_version":"1.0","event_id":"sha256:2dedcdb758667990dfbda270c7a3b3fae94f687a04bc353f5ae755dadaa4cefd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GPHE5ZR3OYHXQWGTQD2SB6UFPS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inverse Quadratic Decay in Random Subset Sum","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Beam search on an O(B/w) mesh solves random subset sum with expected error O(B/(n w squared)).","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christof Teuscher, Edwin Chen","submitted_at":"2026-05-06T03:46:44Z","abstract_excerpt":"The Subset Sum Problem is a fundamental NP-complete problem in cryptography and combinatorial optimization, with many real-world applications. The Random Subset Sum Problem (RSSP) is a more applicable version of subset sum, where numbers are drawn from some i.i.d input distribution. We present an algorithm that, with probability $1-\\delta$, constructs the same $O(B/w)$ mesh as Da Cunha et al. (2023), while trimming to $w$ elements throughout and running in $O(w\\log w)$ time. Then, we present a novel beam search heuristic running in linearithmic time w.r.t list size $n$ and beam width $w$ using"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we present a novel beam search heuristic running in linearithmic time w.r.t list size n and beam width w using the mesh that gives an expected error of O(B/nw^2) under a standard mean-field assumption with equal standard deviation, demonstrating the practical effectiveness of meshing to achieve error decay","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"the standard mean-field assumption with equal standard deviation that is invoked to obtain the O(B/nw^2) expected error bound","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A meshing and beam search algorithm for random subset sum achieves inverse quadratic error decay O(B/(n w^2)) under a mean-field assumption while running in linearithmic time.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Beam search on an O(B/w) mesh solves random subset sum with expected error O(B/(n w squared)).","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"050be353386aa496fbdafaa6327f593efdbf6dbca628f16e0eb108a32538b05f"},"source":{"id":"2605.04465","kind":"arxiv","version":2},"verdict":{"id":"3659f609-23e1-46ff-b659-155d9141aac6","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T17:12:44.865386Z","strongest_claim":"we present a novel beam search heuristic running in linearithmic time w.r.t list size n and beam width w using the mesh that gives an expected error of O(B/nw^2) under a standard mean-field assumption with equal standard deviation, demonstrating the practical effectiveness of meshing to achieve error decay","one_line_summary":"A meshing and beam search algorithm for random subset sum achieves inverse quadratic error decay O(B/(n w^2)) under a mean-field assumption while running in linearithmic time.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"the standard mean-field assumption with equal standard deviation that is invoked to obtain the O(B/nw^2) expected error bound","pith_extraction_headline":"Beam search on an O(B/w) mesh solves random subset sum with expected error O(B/(n w squared))."},"integrity":{"clean":false,"summary":{"advisory":3,"critical":0,"by_detector":{"doi_compliance":{"total":3,"advisory":3,"critical":0,"informational":0}},"informational":0},"endpoint":"/pith/2605.04465/integrity.json","findings":[{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1137/16m1082018Anja) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detector":"doi_compliance","severity":"advisory","ref_index":1,"audited_at":"2026-05-19T14:23:13.458481Z","detected_doi":"10.1137/16m1082018Anja","finding_type":"recoverable_identifier","verdict_class":"incontrovertible","detected_arxiv_id":null},{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/j.neucom.2003.11.025) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detector":"doi_compliance","severity":"advisory","ref_index":22,"audited_at":"2026-05-19T14:23:13.458481Z","detected_doi":"10.1016/j.neucom.2003.11.025","finding_type":"recoverable_identifier","verdict_class":"incontrovertible","detected_arxiv_id":null},{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/0305-0548(86) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detector":"doi_compliance","severity":"advisory","ref_index":11,"audited_at":"2026-05-19T14:23:13.458481Z","detected_doi":"10.1016/0305-0548(86","finding_type":"recoverable_identifier","verdict_class":"incontrovertible","detected_arxiv_id":null}],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T11:42:37.693018Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T23:01:19.873247Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T14:23:13.458481Z","status":"completed","version":"1.0.0","findings_count":3}],"snapshot_sha256":"a020f0c3bb028cfddfa1ab6b769e3a43f88f6cca654ae56617233a66baf7135c"},"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":"3659f609-23e1-46ff-b659-155d9141aac6"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-21T01:04:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PINPeBqKx+b/7OE014XmtwP5qpmTI0rIhrka3UGw8cKZURzCOZPnLsxMTKZOVcb9AK93854fF4bBsf+GGwCmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:00:25.665139Z"},"content_sha256":"5ec45a86afe63f57f7c75ccc3caa4f30e9c23af5db39203d5f35df698c8ca14a","schema_version":"1.0","event_id":"sha256:5ec45a86afe63f57f7c75ccc3caa4f30e9c23af5db39203d5f35df698c8ca14a"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:GPHE5ZR3OYHXQWGTQD2SB6UFPS","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/j.neucom.2003.11.025) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"A Genetic Algorithm for the Subset Sum Problem.Neurocomputing61, 1–3 (2004), 453–459. doi:10.1016/j.neucom.2003. 11.025 Richard Schroeppel and Adi Shamir","arxiv_id":"2605.04465","detector":"doi_compliance","evidence":{"ref_index":22,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"A Genetic Algorithm for the Subset Sum Problem.Neurocomputing61, 1–3 (2004), 453–459. doi:10.1016/j.neucom.2003. 11.025 Richard Schroeppel and Adi Shamir","reconstructed_doi":"10.1016/j.neucom.2003.11.025"},"severity":"advisory","ref_index":22,"audited_at":"2026-05-19T14:23:13.458481Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.neucom.2003.11.025","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"8056a3460d5a7f2fdd7ec74209670560317a394393a866f6f4b48cd70677ef33","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":1659,"payload_sha256":"9ae9e05a9aaad3512fd2348cebbcb58a77c741b343163bbe4a774a8fc6c9cb04","signature_b64":"ZSdAdBbRFzSdGo9NVgJWhM33gF/bJY1Wj5Vwj2Q9eQIkiq2COGumni1YWeiWUMJu4sVR5qUd68LOdDuV7O88BA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T14:27:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GdIDr2DTNNTdFUyE7eYGXaX7CDce1dUglZy7zE2+lFkXqZmEQP6D2ShZYLhcgwBeydcJu0MtwohJR3C0oiJ6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:00:25.666128Z"},"content_sha256":"edcd98c339c56adde4f878ddc20980a62572f2c3772b973fdc57028d4f8f13e6","schema_version":"1.0","event_id":"sha256:edcd98c339c56adde4f878ddc20980a62572f2c3772b973fdc57028d4f8f13e6"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:GPHE5ZR3OYHXQWGTQD2SB6UFPS","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/0305-0548(86) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Future paths for integer programming and links to artificial intelli- gence.Computers & Operations Research13, 5 (1986), 533–549. doi:10.1016/0305- 0548(86)90048-1 Fred Glover","arxiv_id":"2605.04465","detector":"doi_compliance","evidence":{"ref_index":11,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Future paths for integer programming and links to artificial intelli- gence.Computers & Operations Research13, 5 (1986), 533–549. doi:10.1016/0305- 0548(86)90048-1 Fred Glover","reconstructed_doi":"10.1016/0305-0548(86"},"severity":"advisory","ref_index":11,"audited_at":"2026-05-19T14:23:13.458481Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/0305-0548(86","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"0686846bbe23fb47cc74a4f9a8157aa6f2c13ac57c3ea8ac4e8d1fd78a9e1d2f","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":1658,"payload_sha256":"bc876843c27921377cefd45b3b7b04c7087badbfc2b761590bbebcede4321b65","signature_b64":"ZClOkQaxxTukUd02mFb/Z7851EvlN60icwkla9qN8oAwZKB6zfM7c1tk+mL+qscedd1hynYeqrExybsO1IIWBw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T14:27:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d5Tan7/Qn32Tbb++UoHKGXVtHsph6/h9feGu9PVflrTjM+3nLETO1uGMM0P8LnFQ7Hk+ITZJZtRg708hqMAQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:00:25.666433Z"},"content_sha256":"e16cb128bfe8afde98ae7f79a71a4a85d3acd04dc5363f4f5c8f976f60711254","schema_version":"1.0","event_id":"sha256:e16cb128bfe8afde98ae7f79a71a4a85d3acd04dc5363f4f5c8f976f60711254"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:GPHE5ZR3OYHXQWGTQD2SB6UFPS","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1137/16m1082018Anja) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"AND Subset Sum is Hard: Tight Conditional Lower Bounds for Scheduling, Matching, and Related Problems.SIAM J. Comput.48, 2 (2019), 539–579. doi:10.1137/16M1082018 Anja Becker, Jean-Sébastien Coron, and Antoine Joux","arxiv_id":"2605.04465","detector":"doi_compliance","evidence":{"ref_index":1,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"AND Subset Sum is Hard: Tight Conditional Lower Bounds for Scheduling, Matching, and Related Problems.SIAM J. Comput.48, 2 (2019), 539–579. doi:10.1137/16M1082018 Anja Becker, Jean-Sébastien Coron, and Antoine Joux","reconstructed_doi":"10.1137/16m1082018Anja"},"severity":"advisory","ref_index":1,"audited_at":"2026-05-19T14:23:13.458481Z","event_type":"pith.integrity.v1","detected_doi":"10.1137/16m1082018Anja","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"21002ac52206c7b05d18d85e6e29b0c673732b9964de0db669346123aaad0c04","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":1657,"payload_sha256":"e40573c414e4d650267cb10200e72f741852afa0f2c0afdbb170e58ba6fd9ef7","signature_b64":"s8ZYwkG9B2rQxaecRv+NiONiyB/YJhnnyKfFLFkjGxbkGQuev9kRqwDKp+zuRciOK76sYPF31gQ8duUuLAA/CQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T14:27:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"djGZR9tAtZqKtRT/UTli8FZais41XskQ8mzQizF7TlvDc5Bj1zpT3z0C1qrli0i8BtmeVWxiMdXfS69Fig7eDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:00:25.666720Z"},"content_sha256":"06d91d8914d1c91a4bd35948619091f19ba4a899c73c563c20f7276663eca94c","schema_version":"1.0","event_id":"sha256:06d91d8914d1c91a4bd35948619091f19ba4a899c73c563c20f7276663eca94c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GPHE5ZR3OYHXQWGTQD2SB6UFPS/bundle.json","state_url":"https://pith.science/pith/GPHE5ZR3OYHXQWGTQD2SB6UFPS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GPHE5ZR3OYHXQWGTQD2SB6UFPS/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-06-02T20:00:25Z","links":{"resolver":"https://pith.science/pith/GPHE5ZR3OYHXQWGTQD2SB6UFPS","bundle":"https://pith.science/pith/GPHE5ZR3OYHXQWGTQD2SB6UFPS/bundle.json","state":"https://pith.science/pith/GPHE5ZR3OYHXQWGTQD2SB6UFPS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GPHE5ZR3OYHXQWGTQD2SB6UFPS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GPHE5ZR3OYHXQWGTQD2SB6UFPS","merge_version":"pith-open-graph-merge-v1","event_count":5,"valid_event_count":5,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6e49397fa53803a5275ba18fcbdafd102d904769885b39fe1750244a5563e969","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-06T03:46:44Z","title_canon_sha256":"944165a4ccc159a5112ffdf07a3ddf5ff15287be2e5c4a968bd141791ed950c9"},"schema_version":"1.0","source":{"id":"2605.04465","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.04465","created_at":"2026-05-21T01:04:26Z"},{"alias_kind":"arxiv_version","alias_value":"2605.04465v2","created_at":"2026-05-21T01:04:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.04465","created_at":"2026-05-21T01:04:26Z"},{"alias_kind":"pith_short_12","alias_value":"GPHE5ZR3OYHX","created_at":"2026-05-21T01:04:26Z"},{"alias_kind":"pith_short_16","alias_value":"GPHE5ZR3OYHXQWGT","created_at":"2026-05-21T01:04:26Z"},{"alias_kind":"pith_short_8","alias_value":"GPHE5ZR3","created_at":"2026-05-21T01:04:26Z"}],"graph_snapshots":[{"event_id":"sha256:5ec45a86afe63f57f7c75ccc3caa4f30e9c23af5db39203d5f35df698c8ca14a","target":"graph","created_at":"2026-05-21T01:04:26Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"we present a novel beam search heuristic running in linearithmic time w.r.t list size n and beam width w using the mesh that gives an expected error of O(B/nw^2) under a standard mean-field assumption with equal standard deviation, demonstrating the practical effectiveness of meshing to achieve error decay"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"the standard mean-field assumption with equal standard deviation that is invoked to obtain the O(B/nw^2) expected error bound"},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A meshing and beam search algorithm for random subset sum achieves inverse quadratic error decay O(B/(n w^2)) under a mean-field assumption while running in linearithmic time."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Beam search on an O(B/w) mesh solves random subset sum with expected error O(B/(n w squared))."}],"snapshot_sha256":"050be353386aa496fbdafaa6327f593efdbf6dbca628f16e0eb108a32538b05f"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":false,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T11:42:37.693018Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T23:01:19.873247Z","status":"completed","version":"1.0.0"},{"findings_count":3,"name":"doi_compliance","ran_at":"2026-05-19T14:23:13.458481Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.04465/integrity.json","findings":[{"audited_at":"2026-05-19T14:23:13.458481Z","detected_arxiv_id":null,"detected_doi":"10.1137/16m1082018Anja","detector":"doi_compliance","finding_type":"recoverable_identifier","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1137/16m1082018Anja) was visible in the surrounding text but could not be confirmed against doi.org as printed.","ref_index":1,"severity":"advisory","verdict_class":"incontrovertible"},{"audited_at":"2026-05-19T14:23:13.458481Z","detected_arxiv_id":null,"detected_doi":"10.1016/j.neucom.2003.11.025","detector":"doi_compliance","finding_type":"recoverable_identifier","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/j.neucom.2003.11.025) was visible in the surrounding text but could not be confirmed against doi.org as printed.","ref_index":22,"severity":"advisory","verdict_class":"incontrovertible"},{"audited_at":"2026-05-19T14:23:13.458481Z","detected_arxiv_id":null,"detected_doi":"10.1016/0305-0548(86","detector":"doi_compliance","finding_type":"recoverable_identifier","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/0305-0548(86) was visible in the surrounding text but could not be confirmed against doi.org as printed.","ref_index":11,"severity":"advisory","verdict_class":"incontrovertible"}],"snapshot_sha256":"a020f0c3bb028cfddfa1ab6b769e3a43f88f6cca654ae56617233a66baf7135c","summary":{"advisory":3,"by_detector":{"doi_compliance":{"advisory":3,"critical":0,"informational":0,"total":3}},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Subset Sum Problem is a fundamental NP-complete problem in cryptography and combinatorial optimization, with many real-world applications. The Random Subset Sum Problem (RSSP) is a more applicable version of subset sum, where numbers are drawn from some i.i.d input distribution. We present an algorithm that, with probability $1-\\delta$, constructs the same $O(B/w)$ mesh as Da Cunha et al. (2023), while trimming to $w$ elements throughout and running in $O(w\\log w)$ time. Then, we present a novel beam search heuristic running in linearithmic time w.r.t list size $n$ and beam width $w$ using","authors_text":"Christof Teuscher, Edwin Chen","cross_cats":[],"headline":"Beam search on an O(B/w) mesh solves random subset sum with expected error O(B/(n w squared)).","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-06T03:46:44Z","title":"Inverse Quadratic Decay in Random Subset Sum"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.04465","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T17:12:44.865386Z","id":"3659f609-23e1-46ff-b659-155d9141aac6","model_set":{"reader":"grok-4.3"},"one_line_summary":"A meshing and beam search algorithm for random subset sum achieves inverse quadratic error decay O(B/(n w^2)) under a mean-field assumption while running in linearithmic time.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Beam search on an O(B/w) mesh solves random subset sum with expected error O(B/(n w squared)).","strongest_claim":"we present a novel beam search heuristic running in linearithmic time w.r.t list size n and beam width w using the mesh that gives an expected error of O(B/nw^2) under a standard mean-field assumption with equal standard deviation, demonstrating the practical effectiveness of meshing to achieve error decay","weakest_assumption":"the standard mean-field assumption with equal standard deviation that is invoked to obtain the O(B/nw^2) expected error bound"}},"verdict_id":"3659f609-23e1-46ff-b659-155d9141aac6"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2dedcdb758667990dfbda270c7a3b3fae94f687a04bc353f5ae755dadaa4cefd","target":"record","created_at":"2026-05-21T01:04:26Z","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":"6e49397fa53803a5275ba18fcbdafd102d904769885b39fe1750244a5563e969","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-06T03:46:44Z","title_canon_sha256":"944165a4ccc159a5112ffdf07a3ddf5ff15287be2e5c4a968bd141791ed950c9"},"schema_version":"1.0","source":{"id":"2605.04465","kind":"arxiv","version":2}},"canonical_sha256":"33ce4ee63b760f7858d380f520fa857c8b44db2dcfd722a59f3b890e336282e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33ce4ee63b760f7858d380f520fa857c8b44db2dcfd722a59f3b890e336282e2","first_computed_at":"2026-05-21T01:04:26.758979Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:04:26.758979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Uz75zMthyYaR9yBRWwLmhn8gbtUw3q+R+xmwt0Lc3fU2Z/5D7ZE4RzF5ARE1n3ze51ZrEoJOIcwuUkp/FuJ/DQ==","signature_status":"signed_v1","signed_at":"2026-05-21T01:04:26.759578Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.04465","source_kind":"arxiv","source_version":2}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:06d91d8914d1c91a4bd35948619091f19ba4a899c73c563c20f7276663eca94c","sha256:e16cb128bfe8afde98ae7f79a71a4a85d3acd04dc5363f4f5c8f976f60711254","sha256:edcd98c339c56adde4f878ddc20980a62572f2c3772b973fdc57028d4f8f13e6"]}],"invalid_events":[],"applied_event_ids":["sha256:2dedcdb758667990dfbda270c7a3b3fae94f687a04bc353f5ae755dadaa4cefd","sha256:5ec45a86afe63f57f7c75ccc3caa4f30e9c23af5db39203d5f35df698c8ca14a"],"state_sha256":"b6d788f475de981c5c5ad7c8b5864527efc8a750268cdf42b25dd1a68c113a82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mNYBEd/klxAqmRj5T9S+FJ0XbklPfiRK/7GofBODGlK1/1gel2Tm+sRfr+BC5lGyyRdEu6yJA0+XZalwogvSBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:00:25.669695Z","bundle_sha256":"c36ee11c8f645d15a78c82c667c65058805d9ebf0dbe87ce01b5b7203cc65248"}}