{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LZWTSXSUNG4PDIP5LKTID52TKP","short_pith_number":"pith:LZWTSXSU","schema_version":"1.0","canonical_sha256":"5e6d395e5469b8f1a1fd5aa681f75353e092785889ec82c153fba4137455e3ea","source":{"kind":"arxiv","id":"1501.02212","version":1},"attestation_state":"computed","paper":{"title":"Efficient Computation by Three Counter Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Holger Petersen","submitted_at":"2015-01-09T18:02:01Z","abstract_excerpt":"We show that multiplication can be done in polynomial time on a three counter machine that receives its input as the contents of two counters. The technique is generalized to functions of two variables computable by deterministic Turing machines in linear space."},"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":"1501.02212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-09T18:02:01Z","cross_cats_sorted":[],"title_canon_sha256":"2e261dba558c0b9273c7940fb9edcf3c2cc51dfdd37f26642cddc922a7d442dd","abstract_canon_sha256":"1dbaa1236dadf1609cdd1cbd6a5de66f543146bf3d8f714ab3fbf4b54a93cfd3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:44.635673Z","signature_b64":"pjARCMjJBNlXD5UohKjbZ+tlC89O9d3chZmCHm0TbK3r3SmVhmKWPVJ46Tm/m4cWueWSzlnjmCb+QxoWFViDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e6d395e5469b8f1a1fd5aa681f75353e092785889ec82c153fba4137455e3ea","last_reissued_at":"2026-05-18T02:29:44.635117Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:44.635117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Computation by Three Counter Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Holger Petersen","submitted_at":"2015-01-09T18:02:01Z","abstract_excerpt":"We show that multiplication can be done in polynomial time on a three counter machine that receives its input as the contents of two counters. The technique is generalized to functions of two variables computable by deterministic Turing machines in linear space."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02212","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":"1501.02212","created_at":"2026-05-18T02:29:44.635199+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.02212v1","created_at":"2026-05-18T02:29:44.635199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02212","created_at":"2026-05-18T02:29:44.635199+00:00"},{"alias_kind":"pith_short_12","alias_value":"LZWTSXSUNG4P","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LZWTSXSUNG4PDIP5","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LZWTSXSU","created_at":"2026-05-18T12:29:29.992203+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/LZWTSXSUNG4PDIP5LKTID52TKP","json":"https://pith.science/pith/LZWTSXSUNG4PDIP5LKTID52TKP.json","graph_json":"https://pith.science/api/pith-number/LZWTSXSUNG4PDIP5LKTID52TKP/graph.json","events_json":"https://pith.science/api/pith-number/LZWTSXSUNG4PDIP5LKTID52TKP/events.json","paper":"https://pith.science/paper/LZWTSXSU"},"agent_actions":{"view_html":"https://pith.science/pith/LZWTSXSUNG4PDIP5LKTID52TKP","download_json":"https://pith.science/pith/LZWTSXSUNG4PDIP5LKTID52TKP.json","view_paper":"https://pith.science/paper/LZWTSXSU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.02212&json=true","fetch_graph":"https://pith.science/api/pith-number/LZWTSXSUNG4PDIP5LKTID52TKP/graph.json","fetch_events":"https://pith.science/api/pith-number/LZWTSXSUNG4PDIP5LKTID52TKP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LZWTSXSUNG4PDIP5LKTID52TKP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LZWTSXSUNG4PDIP5LKTID52TKP/action/storage_attestation","attest_author":"https://pith.science/pith/LZWTSXSUNG4PDIP5LKTID52TKP/action/author_attestation","sign_citation":"https://pith.science/pith/LZWTSXSUNG4PDIP5LKTID52TKP/action/citation_signature","submit_replication":"https://pith.science/pith/LZWTSXSUNG4PDIP5LKTID52TKP/action/replication_record"}},"created_at":"2026-05-18T02:29:44.635199+00:00","updated_at":"2026-05-18T02:29:44.635199+00:00"}