{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:I3WR5JFKBN3DGONS56WCMLLMN4","short_pith_number":"pith:I3WR5JFK","schema_version":"1.0","canonical_sha256":"46ed1ea4aa0b763339b2efac262d6c6f384de5685b15f51d73eca3dd35513c47","source":{"kind":"arxiv","id":"2607.09688","version":1},"attestation_state":"computed","paper":{"title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bla\\v{z} P\\v{s}eni\\v{c}nik, Borko Bo\\v{s}kovi\\'c, Janez Brest, Jan Popi\\'c","submitted_at":"2026-06-17T09:17:04Z","abstract_excerpt":"Low autocorrelation binary sequences problem (LABS) is a hard combinatorial optimization challenge with important applications in communications, signal processing, and satellite navigation. This paper proposes a hybrid search framework that combines Thompson sampling with parallel self-avoiding walks to adaptively allocate computational effort across restriction classes of the LABS search space. By modeling partitions as arms in a multi-armed bandit setting, the proposed method dynamically shifts search resources toward partitions that empirically produce higher merit factors while maintainin"},"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":"2607.09688","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-17T09:17:04Z","cross_cats_sorted":[],"title_canon_sha256":"f238c521204648a502e4e369bd5d4904ce22ef77310af4cf8d23cc39277ea048","abstract_canon_sha256":"78ffa001b19ecdd7d598938e076b9207321a4ee35cbb9ec17d2c952b2cd9d339"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T00:18:30.506027Z","signature_b64":"2fQqi2j4wyCfPGhWkqsylxXQCBmNhb3lOL+aGLXkid5GKaEyYCWtQBy276jZN81kgUlPi97txrmCgztIBFByDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46ed1ea4aa0b763339b2efac262d6c6f384de5685b15f51d73eca3dd35513c47","last_reissued_at":"2026-07-14T00:18:30.505154Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T00:18:30.505154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bla\\v{z} P\\v{s}eni\\v{c}nik, Borko Bo\\v{s}kovi\\'c, Janez Brest, Jan Popi\\'c","submitted_at":"2026-06-17T09:17:04Z","abstract_excerpt":"Low autocorrelation binary sequences problem (LABS) is a hard combinatorial optimization challenge with important applications in communications, signal processing, and satellite navigation. This paper proposes a hybrid search framework that combines Thompson sampling with parallel self-avoiding walks to adaptively allocate computational effort across restriction classes of the LABS search space. By modeling partitions as arms in a multi-armed bandit setting, the proposed method dynamically shifts search resources toward partitions that empirically produce higher merit factors while maintainin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.09688","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.09688/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":"2607.09688","created_at":"2026-07-14T00:18:30.505622+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.09688v1","created_at":"2026-07-14T00:18:30.505622+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.09688","created_at":"2026-07-14T00:18:30.505622+00:00"},{"alias_kind":"pith_short_12","alias_value":"I3WR5JFKBN3D","created_at":"2026-07-14T00:18:30.505622+00:00"},{"alias_kind":"pith_short_16","alias_value":"I3WR5JFKBN3DGONS","created_at":"2026-07-14T00:18:30.505622+00:00"},{"alias_kind":"pith_short_8","alias_value":"I3WR5JFK","created_at":"2026-07-14T00:18:30.505622+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/I3WR5JFKBN3DGONS56WCMLLMN4","json":"https://pith.science/pith/I3WR5JFKBN3DGONS56WCMLLMN4.json","graph_json":"https://pith.science/api/pith-number/I3WR5JFKBN3DGONS56WCMLLMN4/graph.json","events_json":"https://pith.science/api/pith-number/I3WR5JFKBN3DGONS56WCMLLMN4/events.json","paper":"https://pith.science/paper/I3WR5JFK"},"agent_actions":{"view_html":"https://pith.science/pith/I3WR5JFKBN3DGONS56WCMLLMN4","download_json":"https://pith.science/pith/I3WR5JFKBN3DGONS56WCMLLMN4.json","view_paper":"https://pith.science/paper/I3WR5JFK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.09688&json=true","fetch_graph":"https://pith.science/api/pith-number/I3WR5JFKBN3DGONS56WCMLLMN4/graph.json","fetch_events":"https://pith.science/api/pith-number/I3WR5JFKBN3DGONS56WCMLLMN4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I3WR5JFKBN3DGONS56WCMLLMN4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I3WR5JFKBN3DGONS56WCMLLMN4/action/storage_attestation","attest_author":"https://pith.science/pith/I3WR5JFKBN3DGONS56WCMLLMN4/action/author_attestation","sign_citation":"https://pith.science/pith/I3WR5JFKBN3DGONS56WCMLLMN4/action/citation_signature","submit_replication":"https://pith.science/pith/I3WR5JFKBN3DGONS56WCMLLMN4/action/replication_record"}},"created_at":"2026-07-14T00:18:30.505622+00:00","updated_at":"2026-07-14T00:18:30.505622+00:00"}