{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GTERY2PBFHGP7SGBWFHSQ352FL","short_pith_number":"pith:GTERY2PB","schema_version":"1.0","canonical_sha256":"34c91c69e129ccffc8c1b14f286fba2ac5c403e2e3e17234103d9877e7266c5e","source":{"kind":"arxiv","id":"1610.03184","version":1},"attestation_state":"computed","paper":{"title":"Generating Candidate Busy Beaver Machines (Or How to Build the Zany Zoo)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"James Harland","submitted_at":"2016-10-11T04:41:02Z","abstract_excerpt":"The busy beaver problem is a well-known example of a non-computable function. In order to determine a particular value of this function, it is necessary to generate and classify a large number of Turing machines. Previous work on this problem has described the processes used for the generation and classification of these machines, but unfortunately has generally not provided details of the machines considered. While there is no reason to doubt the veracity of the results known so far, it is difficult to accept such results as scientifically proven without being able to inspect the appropriate "},"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":"1610.03184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-10-11T04:41:02Z","cross_cats_sorted":[],"title_canon_sha256":"7a552edfb2402c92b415a7d3eab270a8f0e481c04462c9b95a3ec7c968872c68","abstract_canon_sha256":"27e4ecbc02dd35841b53d7ff3daf4c43ba7cf639a197fcfdbdb24d09868dfb51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:46.307716Z","signature_b64":"c2F4WK0GNbk2EyK16CBi29ry2E1/kEYe7PuUfJcekL8A1sitPdPVXmyLL39xVcZVzjvPDr0VWbCH9QnsT5mpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34c91c69e129ccffc8c1b14f286fba2ac5c403e2e3e17234103d9877e7266c5e","last_reissued_at":"2026-05-18T01:02:46.307359Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:46.307359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generating Candidate Busy Beaver Machines (Or How to Build the Zany Zoo)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"James Harland","submitted_at":"2016-10-11T04:41:02Z","abstract_excerpt":"The busy beaver problem is a well-known example of a non-computable function. In order to determine a particular value of this function, it is necessary to generate and classify a large number of Turing machines. Previous work on this problem has described the processes used for the generation and classification of these machines, but unfortunately has generally not provided details of the machines considered. While there is no reason to doubt the veracity of the results known so far, it is difficult to accept such results as scientifically proven without being able to inspect the appropriate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03184","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":"1610.03184","created_at":"2026-05-18T01:02:46.307414+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.03184v1","created_at":"2026-05-18T01:02:46.307414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03184","created_at":"2026-05-18T01:02:46.307414+00:00"},{"alias_kind":"pith_short_12","alias_value":"GTERY2PBFHGP","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GTERY2PBFHGP7SGB","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GTERY2PB","created_at":"2026-05-18T12:30:19.053100+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/GTERY2PBFHGP7SGBWFHSQ352FL","json":"https://pith.science/pith/GTERY2PBFHGP7SGBWFHSQ352FL.json","graph_json":"https://pith.science/api/pith-number/GTERY2PBFHGP7SGBWFHSQ352FL/graph.json","events_json":"https://pith.science/api/pith-number/GTERY2PBFHGP7SGBWFHSQ352FL/events.json","paper":"https://pith.science/paper/GTERY2PB"},"agent_actions":{"view_html":"https://pith.science/pith/GTERY2PBFHGP7SGBWFHSQ352FL","download_json":"https://pith.science/pith/GTERY2PBFHGP7SGBWFHSQ352FL.json","view_paper":"https://pith.science/paper/GTERY2PB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.03184&json=true","fetch_graph":"https://pith.science/api/pith-number/GTERY2PBFHGP7SGBWFHSQ352FL/graph.json","fetch_events":"https://pith.science/api/pith-number/GTERY2PBFHGP7SGBWFHSQ352FL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GTERY2PBFHGP7SGBWFHSQ352FL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GTERY2PBFHGP7SGBWFHSQ352FL/action/storage_attestation","attest_author":"https://pith.science/pith/GTERY2PBFHGP7SGBWFHSQ352FL/action/author_attestation","sign_citation":"https://pith.science/pith/GTERY2PBFHGP7SGBWFHSQ352FL/action/citation_signature","submit_replication":"https://pith.science/pith/GTERY2PBFHGP7SGBWFHSQ352FL/action/replication_record"}},"created_at":"2026-05-18T01:02:46.307414+00:00","updated_at":"2026-05-18T01:02:46.307414+00:00"}