{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:U6WBUQNJORCUUILACCUBA2PK6Y","short_pith_number":"pith:U6WBUQNJ","schema_version":"1.0","canonical_sha256":"a7ac1a41a974454a216010a81069eaf619b094e8f0fef5d2ed8386fdadcd113f","source":{"kind":"arxiv","id":"1608.06001","version":2},"attestation_state":"computed","paper":{"title":"A note on Beckett-Gray codes and the relationship of Gray codes to data structures","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Brett Stevens, Chris North, Mark Cooke, Megan Dewar","submitted_at":"2016-08-21T21:12:40Z","abstract_excerpt":"In this paper we introduce a natural mathematical structure derived from Samuel Beckett's play \"Quad\". We call this structure a binary Beckett-Gray code. We enumerate all codes for $n \\leq 6$ and give examples for $n=7,8$. Beckett-Gray codes can be realized as successive states of a queue data structure. We show that the binary reflected Gray code can be realized as successive states of two stack data structures."},"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":"1608.06001","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2016-08-21T21:12:40Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ee869ed7f3dc559ffe028138e46818d98fb76fa61695b4bf35f2006828373ba4","abstract_canon_sha256":"ee224f2cf5006177a096e6b2d5aed4f1b40614ea035210c2decf20ca7416589b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:53.455879Z","signature_b64":"iF5Ua6WVOHPk5VCqy5DyQSRhI2WSLTbLILCUsNH4j7LILCNBm95UoeQv7ucQcfymlPv8qC4DPwkMR/tYVrndCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7ac1a41a974454a216010a81069eaf619b094e8f0fef5d2ed8386fdadcd113f","last_reissued_at":"2026-05-18T01:07:53.455490Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:53.455490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on Beckett-Gray codes and the relationship of Gray codes to data structures","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Brett Stevens, Chris North, Mark Cooke, Megan Dewar","submitted_at":"2016-08-21T21:12:40Z","abstract_excerpt":"In this paper we introduce a natural mathematical structure derived from Samuel Beckett's play \"Quad\". We call this structure a binary Beckett-Gray code. We enumerate all codes for $n \\leq 6$ and give examples for $n=7,8$. Beckett-Gray codes can be realized as successive states of a queue data structure. We show that the binary reflected Gray code can be realized as successive states of two stack data structures."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06001","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":"1608.06001","created_at":"2026-05-18T01:07:53.455552+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.06001v2","created_at":"2026-05-18T01:07:53.455552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06001","created_at":"2026-05-18T01:07:53.455552+00:00"},{"alias_kind":"pith_short_12","alias_value":"U6WBUQNJORCU","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"U6WBUQNJORCUUILA","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"U6WBUQNJ","created_at":"2026-05-18T12:30:46.583412+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/U6WBUQNJORCUUILACCUBA2PK6Y","json":"https://pith.science/pith/U6WBUQNJORCUUILACCUBA2PK6Y.json","graph_json":"https://pith.science/api/pith-number/U6WBUQNJORCUUILACCUBA2PK6Y/graph.json","events_json":"https://pith.science/api/pith-number/U6WBUQNJORCUUILACCUBA2PK6Y/events.json","paper":"https://pith.science/paper/U6WBUQNJ"},"agent_actions":{"view_html":"https://pith.science/pith/U6WBUQNJORCUUILACCUBA2PK6Y","download_json":"https://pith.science/pith/U6WBUQNJORCUUILACCUBA2PK6Y.json","view_paper":"https://pith.science/paper/U6WBUQNJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.06001&json=true","fetch_graph":"https://pith.science/api/pith-number/U6WBUQNJORCUUILACCUBA2PK6Y/graph.json","fetch_events":"https://pith.science/api/pith-number/U6WBUQNJORCUUILACCUBA2PK6Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U6WBUQNJORCUUILACCUBA2PK6Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U6WBUQNJORCUUILACCUBA2PK6Y/action/storage_attestation","attest_author":"https://pith.science/pith/U6WBUQNJORCUUILACCUBA2PK6Y/action/author_attestation","sign_citation":"https://pith.science/pith/U6WBUQNJORCUUILACCUBA2PK6Y/action/citation_signature","submit_replication":"https://pith.science/pith/U6WBUQNJORCUUILACCUBA2PK6Y/action/replication_record"}},"created_at":"2026-05-18T01:07:53.455552+00:00","updated_at":"2026-05-18T01:07:53.455552+00:00"}