{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:3QZGCVFFTWZYTCAMJ3N57RZCCY","short_pith_number":"pith:3QZGCVFF","schema_version":"1.0","canonical_sha256":"dc326154a59db389880c4edbdfc722161b13804fd39a748519ffd76489ee9607","source":{"kind":"arxiv","id":"1009.5802","version":1},"attestation_state":"computed","paper":{"title":"Synthesis of Binary k-Stage Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Elena Dubrova","submitted_at":"2010-09-29T08:38:53Z","abstract_excerpt":"An algorithm for constructing a shortest binary k-stage machine generating a given binary sequence is presented. This algorithm can be considered as an extension of Berlekamp-Massey algorithm to the non-linear case."},"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":"1009.5802","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-09-29T08:38:53Z","cross_cats_sorted":[],"title_canon_sha256":"2167fea58dd79c4de4214bb1e5c715d0f3859ed77aeb7bc09578ba4374d8b0ec","abstract_canon_sha256":"9ad502e842ed2f1b0b98e7656e480747f6a02dfdc18e08735fe19b3869c7bd4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:08.880629Z","signature_b64":"NqLOFbe36zqBLwTY8lipskscNeWLn2/uzYg0W/Ntadc8mfg17NBqkz0KzD8LcVHYYQo3JNUzKT6fAEVJD2apBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc326154a59db389880c4edbdfc722161b13804fd39a748519ffd76489ee9607","last_reissued_at":"2026-05-18T04:40:08.880119Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:08.880119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Synthesis of Binary k-Stage Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Elena Dubrova","submitted_at":"2010-09-29T08:38:53Z","abstract_excerpt":"An algorithm for constructing a shortest binary k-stage machine generating a given binary sequence is presented. This algorithm can be considered as an extension of Berlekamp-Massey algorithm to the non-linear case."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5802","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":"1009.5802","created_at":"2026-05-18T04:40:08.880178+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.5802v1","created_at":"2026-05-18T04:40:08.880178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5802","created_at":"2026-05-18T04:40:08.880178+00:00"},{"alias_kind":"pith_short_12","alias_value":"3QZGCVFFTWZY","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"3QZGCVFFTWZYTCAM","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"3QZGCVFF","created_at":"2026-05-18T12:26:03.138858+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/3QZGCVFFTWZYTCAMJ3N57RZCCY","json":"https://pith.science/pith/3QZGCVFFTWZYTCAMJ3N57RZCCY.json","graph_json":"https://pith.science/api/pith-number/3QZGCVFFTWZYTCAMJ3N57RZCCY/graph.json","events_json":"https://pith.science/api/pith-number/3QZGCVFFTWZYTCAMJ3N57RZCCY/events.json","paper":"https://pith.science/paper/3QZGCVFF"},"agent_actions":{"view_html":"https://pith.science/pith/3QZGCVFFTWZYTCAMJ3N57RZCCY","download_json":"https://pith.science/pith/3QZGCVFFTWZYTCAMJ3N57RZCCY.json","view_paper":"https://pith.science/paper/3QZGCVFF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.5802&json=true","fetch_graph":"https://pith.science/api/pith-number/3QZGCVFFTWZYTCAMJ3N57RZCCY/graph.json","fetch_events":"https://pith.science/api/pith-number/3QZGCVFFTWZYTCAMJ3N57RZCCY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3QZGCVFFTWZYTCAMJ3N57RZCCY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3QZGCVFFTWZYTCAMJ3N57RZCCY/action/storage_attestation","attest_author":"https://pith.science/pith/3QZGCVFFTWZYTCAMJ3N57RZCCY/action/author_attestation","sign_citation":"https://pith.science/pith/3QZGCVFFTWZYTCAMJ3N57RZCCY/action/citation_signature","submit_replication":"https://pith.science/pith/3QZGCVFFTWZYTCAMJ3N57RZCCY/action/replication_record"}},"created_at":"2026-05-18T04:40:08.880178+00:00","updated_at":"2026-05-18T04:40:08.880178+00:00"}