{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:K6WIBEWLMNXV3YC4JFHZRNGQEF","short_pith_number":"pith:K6WIBEWL","schema_version":"1.0","canonical_sha256":"57ac8092cb636f5de05c494f98b4d0217a7aecbf0574e7927b1d3d55bf398b8a","source":{"kind":"arxiv","id":"1902.08660","version":1},"attestation_state":"computed","paper":{"title":"A Computational Comparison of Optimization Methods for the Golomb Ruler Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Burak Kocuk, Willem-Jan van Hoeve","submitted_at":"2019-02-22T20:15:02Z","abstract_excerpt":"The Golomb ruler problem is defined as follows: Given a positive integer n, locate n marks on a ruler such that the distance between any two distinct pair of marks are different from each other and the total length of the ruler is minimized. The Golomb ruler problem has applications in information theory, astronomy and communications, and it can be seen as a challenge for combinatorial optimization algorithms. Although constructing high quality rulers is well-studied, proving optimality is a far more challenging task. In this paper, we provide a computational comparison of different optimizati"},"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":"1902.08660","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-02-22T20:15:02Z","cross_cats_sorted":[],"title_canon_sha256":"3f58024760321148f965f413ec7744ece73a29ac82d2dc789462da11a67e158d","abstract_canon_sha256":"4fb7a9b0a1ed00c909bd9bfabff21cc6b6f4a7146f0ab893fc731987504236bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:49.842576Z","signature_b64":"3LGMRpXmNIXPfmx7UjZWVB/ThGA/PinstLgu0bjtVtXxGSF45WixIUfYlnqfdaHIPbg1Ac24z2typbjMjH1OCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57ac8092cb636f5de05c494f98b4d0217a7aecbf0574e7927b1d3d55bf398b8a","last_reissued_at":"2026-05-17T23:43:49.841950Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:49.841950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Computational Comparison of Optimization Methods for the Golomb Ruler Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Burak Kocuk, Willem-Jan van Hoeve","submitted_at":"2019-02-22T20:15:02Z","abstract_excerpt":"The Golomb ruler problem is defined as follows: Given a positive integer n, locate n marks on a ruler such that the distance between any two distinct pair of marks are different from each other and the total length of the ruler is minimized. The Golomb ruler problem has applications in information theory, astronomy and communications, and it can be seen as a challenge for combinatorial optimization algorithms. Although constructing high quality rulers is well-studied, proving optimality is a far more challenging task. In this paper, we provide a computational comparison of different optimizati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08660","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":""},"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":"1902.08660","created_at":"2026-05-17T23:43:49.842036+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.08660v1","created_at":"2026-05-17T23:43:49.842036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08660","created_at":"2026-05-17T23:43:49.842036+00:00"},{"alias_kind":"pith_short_12","alias_value":"K6WIBEWLMNXV","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"K6WIBEWLMNXV3YC4","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"K6WIBEWL","created_at":"2026-05-18T12:33:21.387695+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/K6WIBEWLMNXV3YC4JFHZRNGQEF","json":"https://pith.science/pith/K6WIBEWLMNXV3YC4JFHZRNGQEF.json","graph_json":"https://pith.science/api/pith-number/K6WIBEWLMNXV3YC4JFHZRNGQEF/graph.json","events_json":"https://pith.science/api/pith-number/K6WIBEWLMNXV3YC4JFHZRNGQEF/events.json","paper":"https://pith.science/paper/K6WIBEWL"},"agent_actions":{"view_html":"https://pith.science/pith/K6WIBEWLMNXV3YC4JFHZRNGQEF","download_json":"https://pith.science/pith/K6WIBEWLMNXV3YC4JFHZRNGQEF.json","view_paper":"https://pith.science/paper/K6WIBEWL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.08660&json=true","fetch_graph":"https://pith.science/api/pith-number/K6WIBEWLMNXV3YC4JFHZRNGQEF/graph.json","fetch_events":"https://pith.science/api/pith-number/K6WIBEWLMNXV3YC4JFHZRNGQEF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K6WIBEWLMNXV3YC4JFHZRNGQEF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K6WIBEWLMNXV3YC4JFHZRNGQEF/action/storage_attestation","attest_author":"https://pith.science/pith/K6WIBEWLMNXV3YC4JFHZRNGQEF/action/author_attestation","sign_citation":"https://pith.science/pith/K6WIBEWLMNXV3YC4JFHZRNGQEF/action/citation_signature","submit_replication":"https://pith.science/pith/K6WIBEWLMNXV3YC4JFHZRNGQEF/action/replication_record"}},"created_at":"2026-05-17T23:43:49.842036+00:00","updated_at":"2026-05-17T23:43:49.842036+00:00"}