{"as_of":"2026-08-07T08:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b08f39efa123cae940d1f1fc190298988f782624177f6459040982445b5553ae","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T17:45:25.949294Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.09688/citation-record","integrity":"/paper/2607.09688/integrity","json":"/paper/2607.09688/citation-record.json","paper":"/paper/2607.09688"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":null,"venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:822011542747397fc4fd9ced3edbb7c6ceae634cbb4312cfb38d55e84936a276","observation_id":"3ae2b108-fd9e-4a18-8a4e-e9660be6c197","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":null,"venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:193e52eed927e8e84e11faec4b1f55f7ce762da56914d1d13324bb4bb57596cd","observation_id":"6f07c3c8-72b5-4e40-a7d1-9c9e56e0f830","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"A survey of the merit factor problem for binary sequences","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:6e7739d748af69860c71d76b69dfd5dbf29a580bb235a35f03eb07dc25423b0f","observation_id":"62f4cce7-46ca-4ffc-bcb2-ecbe602c7c08","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Moments of autocorrelation demerit factors of binary sequences.Designs, Codes and Cryptography, pages 1–45, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:c00341d8a489fdf0febe52c86b7da5988266c5867d5d05c0f51ca6cebb58c755","observation_id":"499d8f7b-2af6-4ddf-995a-241319f40cbd","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Multi-criteria selection of a synchroni- sation word for low-power iot receivers based on the iqrf standard.Scientific Reports, 16(1):8777, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:8e1f0790d061ed3cd6634b568ba0a228f9a8453475cbde342358da3afb9cb7c6","observation_id":"3bcf8b78-7e3e-474d-b9e2-a90d4d88faaa","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Bernasconi","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:db1c694a393a6e929ee32eb1a8eafd530beef9a9ff1d7056472b54fc791f7074","observation_id":"af6b3aad-131f-4321-9a53-0c95845b90eb","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Shapiro, Gordon H","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:d3450f4d7347e29a594c552fdf16935be535a7b7953231b09b9a394e89ab792c","observation_id":"c0e3400f-0e46-40b3-badd-c298997c8fa0","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Large-scale gnss spreading code optimization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:1f67e4a60ae3c370d8a5308c57e6723cb624b6261be0e01a6171c4c3a14120db","observation_id":"00c04ba0-433a-4424-a99d-3691c775a66a","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Spreading code optimization for low-earth orbit satellites via mixed-integer convex programming.EURASIP Journal on Advances in Signal Processing, 2024(1):67, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:1f4ebce7a22396e9a9577e7e1c66880e9dea377de6f76315e4438adf2cddee73","observation_id":"20d1d557-6d5c-40d0-80b6-30a66cb2b094","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"A competitive nisq and qubit-efficient solver for the labs problem.arXiv preprint arXiv:2506.17391, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:0e33de320945672c7e4c8c79098abf00f1f85c3e56c5b6a109f6baf09b191e25","observation_id":"95a4a556-996f-439e-b11b-82a31dec4a1a","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem.Science Advances, 10(22):eadm6761, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:f26191059a747b34bdb2a3f0704cbfba05118a7d2f603fc278c34c1905cd0f2c","observation_id":"eb15ba63-fd12-4048-a8af-241c704a3cfe","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Sequences with small correlation.Designs, Codes and Cryptography, 78, 01 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:834f052810fe49cadd8270182cc3a0ee41394ddf8c647d6e7f751a98cfc4086b","observation_id":"4f04f1ef-955d-49c7-a96c-9a40c182e4c4","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Code selection for CDMA systems.Department of Information Studies, University of Tampere, Finland, 1997","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:550ed04af9aa20c3f427e98fd0912cf10ee862bdac94bf81d1c40be6c9311e65","observation_id":"862af65a-92d2-4050-8548-9d207d3baa87","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Mullen and Daniel Panario","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:87dabde46f1874b5f7ab95e10a6ad00825591ed1873f2a1f64e2e882d93c64af","observation_id":"5e3e74b4-af91-406f-8637-5aafc00199b3","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Oddaljenost neperiodi ˇcnih binarnih zaporedij glede na dve meri avtokorelacijskih lastnosti.Elektrotehniski Vestnik, 92(3):97–103, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:c5fa34c7ac2ea2f311c8824c62cdf45578702384b639d31e718fcdea35b02b62","observation_id":"74d98647-f13f-415d-9165-7f9612dda64f","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Metastable states in short-ranged p-spin glasses","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:5b44ec5772415350c8893e91ea483ef2103ba19b73687d9de93db858e03aa2b3","observation_id":"0be5af54-0e5f-4485-8a87-f43f6158ccb8","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Uniform manifold approximation and projection.Nature Reviews Methods Primers, 4(1):82, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:f3faee1b79954b82a2c629105bedfd71c31664fba967155a6925e76ce3c06597","observation_id":"a7fcbbef-4574-4947-9c16-216d30077c94","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Low autocorrelation binary sequences.Journal of Physics A: Mathematical and Theoretical, 49(16):165001, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:ee48007d0fc443f94642839bf254e13c1d732b9da1a390b5cdd8c0cf7251b6c8","observation_id":"a9fd5e59-7208-4600-8ae2-4e1d99351934","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2206.12070","last_updated":"2022-06-24T04:26:42Z","snapshot_observed_at":"2026-07-06T13:24:13.974597Z","submitted_at":"2022-06-24T04:26:42Z","title":"New Classes of Binary Sequences with High Merit Factor","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2206.12070","snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"New classes of binary sequences with high merit factor.arXiv preprint arXiv:2206.12070, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"cited_paper":"/paper/2206.12070","citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:02b6d444e6a9d5bbaf401052ec7400b6203210db5c3f957a9c973c0ce2ab8110","observation_id":"beb78a74-59c7-4871-b27d-d8a4b882884d","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Exhaustive search for low-autocorrelation binary sequences.Journal of Physics A: Mathematical and General, 29(18):L473, 1996","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:e8ee32d2dede8e686d8693c96198e09110ea8dca68c27833c99ad27de23f1dc7","observation_id":"9ea1c452-e9f1-4353-831e-6666eae9d9c4","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Exploiting relaxation in local search for labs.Annals of Operations Research, 156:129–141, 12 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:a22af4d99e481c9fc92c5ca3682e990d99aae8f2c7cef8ad5fe47feacc931d52","observation_id":"e04e998c-2897-45d2-b3bf-c1a47a12540c","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1305.6187","last_updated":"2013-07-23T14:42:15Z","snapshot_observed_at":"2026-07-06T03:14:22.508667Z","submitted_at":"2013-05-27T11:57:40Z","title":"Improved Branch-and-Bound for Low Autocorrelation Binary Sequences","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1305.6187","snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Improved branch-and-bound for low autocorrelation binary sequences.arXiv preprint arXiv:1305.6187, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"cited_paper":"/paper/1305.6187","citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:a73d02061b1bf4e81b876a31fd0a8a88ed9da1cb533e16431259a226b8af28e9","observation_id":"9f46492b-a283-4cc2-8b41-e18b3bdee13b","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Parallele optimierungsstrategien des labs-problems in einem gpu-grid, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:f9ee9a40e0c7e2051566b83cb09a581760be3b51cebd94dec952f8a4c71aaafe","observation_id":"b882ac37-1383-4ce0-aa7a-20621c13607f","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Hoholdt and H.E","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:b50564e29e92519310930a3e5a42b65de59e49708bc3d2b2add1908bf41fec3a","observation_id":"8d67c819-c539-40a5-80db-c9856b5e275a","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Borwein, K.-K.S","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:5016c7df0cc165783c4f169649d722b2204f35989d21c5e609d0d925d9b58411","observation_id":"b12f959a-5f1f-4d3c-ba23-39bde6770bcb","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Efficient Optimization of the Merit Factor of Long Binary Sequences.IEEE Transactions on Information Theory, 57(12):8084–8094, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:c34b1725f41c8182b902ebf1b226e5dd35414c6eb1a81535293abe16a2d33217","observation_id":"536ad9aa-8947-4d90-baa4-be0af477c5c7","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Katz, and Kai-Uwe Schmidt","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:1293820ab1052c7f829767dc9850c5fbbeb725a18e83d7aaddd92f8e8fb4e1be","observation_id":"6428ae9a-c380-4d3f-9459-873fe5bc4e27","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Local search algorithm for low autocorrelation binary sequences","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:30e4778ea5b616e77a8a6e8f79c906d26abd904bd355521804bd825d3530c922","observation_id":"e1afe054-a0e3-4163-82ec-e7486e347885","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"On the skew-symmetric binary sequences and the merit factor problem.Digital Signal Processing, 156:104793, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:0c6a77164d64f803ac03ff4ca4abc912920fdfd9a28d519e5f0d8d187e6c0c72","observation_id":"118ce322-4c87-4b35-b60b-7ea889112cec","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:9fce37b70693cfd27c18d61338587a09169c857e5e857f78ae68070bab37f030","observation_id":"5bf50e7a-315b-47f8-8eb8-ae09c88602c4","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Gallardo, Carlos Cotta, and Antonio J","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:a2d8b3bed660bd20e80e89d0e7269cf453d232169b398ee3d84e9b15fc2ee589","observation_id":"ca0e86ca-3b7c-4c44-abf9-80f91af570b6","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Low-autocorrelation binary sequences: On improved merit factors and runtime predictions to achieve them.Applied Soft Computing, 56:262–285, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:a439a2b9032ec0eefb285f4dff4d8fe416d4f852597b9957a075a0bebce326f5","observation_id":"e784422f-73ca-4461-b9fd-527f38f0d315","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Parallel self-avoiding walks for a low-autocorrelation binary sequences problem.Journal of Computational Science, 77:102260, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:eb5770e2288380877f367f82b1177cf880425df404b1b1279e386b753da7d82d","observation_id":"2626d870-871c-49a4-a132-e9a805e1905d","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"A Heuristic Algorithm for a Low Autocorrelation Binary Sequence Problem With Odd Length and High Merit Factor.IEEE Access, 6:4127–4134, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:96b48479b8d6b49715df1a50a1736fd85ceab63b80d46edd435214c6778a096c","observation_id":"20ba8ce3-9419-46c2-887c-bd7543d136af","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Computational Search of Long Skew-symmetric Binary Sequences with High Merit Factors.MENDEL, 28(2):17–24, 12 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:f5d5874706711e60ffcdd8a12abad4c6a16cad65e6603d08c1e6b5e11ccdd950","observation_id":"78be82df-934c-4791-b3a3-385da121af88","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Analysis based on statistical distributions: A practical approach for stochastic solvers using discrete and continuous problems.Information Sciences, 633:469–490, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:65e419b57427f0cd1ad6ce82f1472ac03463458239eb6df3c950e9eceab0fc8f","observation_id":"606a43c2-b26f-4cfa-9a04-08a7eeaedf42","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Toward hybrid platform for evolutionary computations of hard discrete problems.Procedia Computer Science, 108:877–886, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:3d6ad8cee88dc6d1b78c29cc99e83240b52e707f5137b59fe5362fdbc6415398","observation_id":"7a73b76f-48d9-481d-9bc0-69416f277fa2","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Striving for performance of discrete optimisation via memetic agent-based systems in a hybrid CPU/GPU environment","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:ed193de39ff474387da3be96eda5c65131c4564ac8041c230bffb3a73c2f52b9","observation_id":"78a857b6-c127-44a1-a272-7be68cad7a85","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"A deep neural network as a tabu support in solving labs problem","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:7aca2f41eb95b8156b33c006aeddef922547c28cb74c4e4a9c06b65d5573a15e","observation_id":"0145197e-3194-4939-9fb7-6b37cb9c08dd","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.00987","last_updated":"2025-08-14T18:26:30Z","snapshot_observed_at":"2026-07-06T21:02:33.351709Z","submitted_at":"2025-04-01T17:24:41Z","title":"New Improvements in Solving Large LABS Instances Using Massively Parallelizable Memetic Tabu Search","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.00987","snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"New improvements in solving large labs instances using massively parallelizable memetic tabu search.arXiv preprint arXiv:2504.00987, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"cited_paper":"/paper/2504.00987","citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:48736ea3b357579d6345684e26e39cd729617e72d8d6db315b4a110579e7bfc4","observation_id":"d10eb78d-2346-4c19-95f4-e9431e331b21","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Scaling advantage with quantum-enhanced memetic tabu search for labs.arXiv preprint arXiv:2511.04553, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:1db0ca7c510b4128e57ea258bcf54a41a8fb4e0eeb4d96c28710e6d3b4498e55","observation_id":"d8cd4c2f-6764-475d-817e-6ce3b50b9162","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Dual-step optimization for binary sequences with high merit factors.Digital Signal Processing, 165:105316, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:06248870c5023d3818f37476e3e058c56ceda012c94874afb0ce7c1c628111da","observation_id":"ff6b45f3-ad7b-41fc-9c7f-a84b25db095c","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"A tutorial on thompson sampling.Foundations and Trends (R) in Machine Learning, 11(1):1–96, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:5667a02b8f5707b49f6de5fd68c92897cb7feb1f5a7e2caca13403654e45d34d","observation_id":"95985771-3407-4a23-9680-fc065d153cc1","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Katehakis and Arthur F","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:ce4a265f7a9ce8add373972535718bed28feb2ebcd870ca5971cf5c8255608db","observation_id":"b20e589e-6743-4433-a2e1-826ee0b1b86b","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Thompson","venue":null,"work_id":null,"year":1933},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:dda05b2d401516d2725b6c53f57231343165a53033139f38e89a770f5d14ad66","observation_id":"413b1997-fa5d-4b2e-8094-4686a870a746","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"On the theory of apportionment.American Journal of Mathematics, 57(2):450–456, 1935","venue":null,"work_id":null,"year":1935},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:451d86c179315ef4439908f2bb9679fe84f49632e5ee9e088358ea858ec9afbc","observation_id":"7d1e32f9-a3fa-4dda-8c9e-d67f77ac69ba","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"’A modern Bayesian look at the multi-armed bandit’ by Steven L","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:756f5f5e1a5df7b17e25d6ed0f1ebc3ee03137a9c4f243dcca7cf427275fb2df","observation_id":"081d3f32-d3a4-4d49-8939-13e8072482e3","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"An empirical evaluation of thompson sampling.Advances in neural information processing systems, 24, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:3ae24cbcc0ffcbcd84ced41540a0f98046ca7456a3915dd50956689f12dcee66","observation_id":"890ecbcb-53a1-451f-a761-231e0eabc66b","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Analysis of thompson sampling for the multi-armed bandit problem","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:64ff1a33a06e604fc088ab084d13d694e7571c8e85a7c516e8376a6d65555289","observation_id":"7f5a423b-92ef-4bff-a404-dd87dcf96779","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Space/time trade-offs in hash coding with allowable errors.Communications of the ACM, 13(7):422–426, 1970","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:494cf6f28e60a1e7d80905e14c6149c8b00cf07bd0bbfd2882119ec06c69e5b2","observation_id":"487ea651-62d3-471a-8f52-a5ca688852e9","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:45:25.949294Z","title":"Pads: Python algorithms and data structures, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-14T17:45:25.949294Z"},"links":{"citing_paper":"/paper/2607.09688"},"observation_digest":"sha256:7a6d59b21a47b33aaac3b9606ada95ec6094765ef3c35326b09a49dec249bc47","observation_id":"53a88631-572d-4f75-987a-43f21f60db66","resolution":{"observed_at":"2026-07-14T17:45:25.949294Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.09688","last_updated":"2026-06-17T09:17:04Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-01T11:37:12.112786Z","submitted_at":"2026-06-17T09:17:04Z","title":"Prioritizing Search Space Regions in the Low Autocorrelation Binary Sequences Problem"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":50,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":51},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 0 inbound Pith citation observations for arXiv:2607.09688."}