{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:3O2UNU45UQU5Y52C3NOZKI54JE","short_pith_number":"pith:3O2UNU45","schema_version":"1.0","canonical_sha256":"dbb546d39da429dc7742db5d9523bc493a67913d7cf46217f0ac24154636ba5a","source":{"kind":"arxiv","id":"0909.1442","version":2},"attestation_state":"computed","paper":{"title":"Some mathematical refinements concerning error minimization in the genetic code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.GN"],"primary_cat":"q-bio.QM","authors_text":"Harry Buhrman, Leen Stougie, Peter T. S. van der Gulik, Steven M. Kelk, Wouter M. Koolen","submitted_at":"2009-09-08T09:54:21Z","abstract_excerpt":"The genetic code has been shown to be very error robust compared to randomly selected codes, but to be significantly less error robust than a certain code found by a heuristic algorithm. We formulate this optimisation problem as a Quadratic Assignment Problem and thus verify that the code found by the heuristic is the global optimum. We also argue that it is strongly misleading to compare the genetic code only with codes sampled from the fixed block model, because the real code space is orders of magnitude larger. We thus enlarge the space from which random codes can be sampled from approximat"},"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":"0909.1442","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2009-09-08T09:54:21Z","cross_cats_sorted":["q-bio.GN"],"title_canon_sha256":"402d5f403ea7267934193b402c9de9d555035d7bc94db60a13b25e5043bb9bdc","abstract_canon_sha256":"219e889e38fff361ab3d552aac50b3f960afad2793cde3fbfcc3fd24c5707096"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:47.316930Z","signature_b64":"b135zpaVrY1N+NwUBW86/ft4D5M4AehyPjkwWOITJ6zCriP1w8TZXvbDD+mq9DTPeNyC0c4+mzcuzjTPNB9FDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbb546d39da429dc7742db5d9523bc493a67913d7cf46217f0ac24154636ba5a","last_reissued_at":"2026-05-18T02:24:47.316287Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:47.316287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Some mathematical refinements concerning error minimization in the genetic code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.GN"],"primary_cat":"q-bio.QM","authors_text":"Harry Buhrman, Leen Stougie, Peter T. S. van der Gulik, Steven M. Kelk, Wouter M. Koolen","submitted_at":"2009-09-08T09:54:21Z","abstract_excerpt":"The genetic code has been shown to be very error robust compared to randomly selected codes, but to be significantly less error robust than a certain code found by a heuristic algorithm. We formulate this optimisation problem as a Quadratic Assignment Problem and thus verify that the code found by the heuristic is the global optimum. We also argue that it is strongly misleading to compare the genetic code only with codes sampled from the fixed block model, because the real code space is orders of magnitude larger. We thus enlarge the space from which random codes can be sampled from approximat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.1442","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"0909.1442","created_at":"2026-05-18T02:24:47.316430+00:00"},{"alias_kind":"arxiv_version","alias_value":"0909.1442v2","created_at":"2026-05-18T02:24:47.316430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.1442","created_at":"2026-05-18T02:24:47.316430+00:00"},{"alias_kind":"pith_short_12","alias_value":"3O2UNU45UQU5","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"3O2UNU45UQU5Y52C","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"3O2UNU45","created_at":"2026-05-18T12:25:58.018023+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/3O2UNU45UQU5Y52C3NOZKI54JE","json":"https://pith.science/pith/3O2UNU45UQU5Y52C3NOZKI54JE.json","graph_json":"https://pith.science/api/pith-number/3O2UNU45UQU5Y52C3NOZKI54JE/graph.json","events_json":"https://pith.science/api/pith-number/3O2UNU45UQU5Y52C3NOZKI54JE/events.json","paper":"https://pith.science/paper/3O2UNU45"},"agent_actions":{"view_html":"https://pith.science/pith/3O2UNU45UQU5Y52C3NOZKI54JE","download_json":"https://pith.science/pith/3O2UNU45UQU5Y52C3NOZKI54JE.json","view_paper":"https://pith.science/paper/3O2UNU45","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0909.1442&json=true","fetch_graph":"https://pith.science/api/pith-number/3O2UNU45UQU5Y52C3NOZKI54JE/graph.json","fetch_events":"https://pith.science/api/pith-number/3O2UNU45UQU5Y52C3NOZKI54JE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3O2UNU45UQU5Y52C3NOZKI54JE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3O2UNU45UQU5Y52C3NOZKI54JE/action/storage_attestation","attest_author":"https://pith.science/pith/3O2UNU45UQU5Y52C3NOZKI54JE/action/author_attestation","sign_citation":"https://pith.science/pith/3O2UNU45UQU5Y52C3NOZKI54JE/action/citation_signature","submit_replication":"https://pith.science/pith/3O2UNU45UQU5Y52C3NOZKI54JE/action/replication_record"}},"created_at":"2026-05-18T02:24:47.316430+00:00","updated_at":"2026-05-18T02:24:47.316430+00:00"}