{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KLINYYOIIIICMN5GYXVDB3XB3P","short_pith_number":"pith:KLINYYOI","schema_version":"1.0","canonical_sha256":"52d0dc61c842102637a6c5ea30eee1dbcf334a1ff9d853ea3567cfae9aeddb31","source":{"kind":"arxiv","id":"1504.04773","version":1},"attestation_state":"computed","paper":{"title":"Reed-Muller Realization of X (mod P)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Danila Gorodecky","submitted_at":"2015-04-18T22:52:05Z","abstract_excerpt":"This article provides a novel technique of X (mod P) realization. It is based on the Reed-Muller polynomial expansion. The advantage of the approach concludes in the capability to realize X (mod P) for an arbitrary P. The approach is competitive with the known realizations on the speed processing. Advantages and results of comparison with the known approaches for X [9:1] and P=7 is demonstrated."},"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":"1504.04773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-04-18T22:52:05Z","cross_cats_sorted":[],"title_canon_sha256":"01db26893887547c7cd0eb4830cc22e2a3f7cf1b1a485537397553e835104267","abstract_canon_sha256":"92332db88f7c27231fcecf6af5b7006657fc1e66fac57830b512774a3df688a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:24.772515Z","signature_b64":"xQt9+88kEd35tHPb32ELO+0D0yKaGuZaxDfUw07tFbgwH7C/NPMbr8TznyQM3+Bu7O9UpnLBVvBBAKUcUiGyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52d0dc61c842102637a6c5ea30eee1dbcf334a1ff9d853ea3567cfae9aeddb31","last_reissued_at":"2026-05-18T02:18:24.772015Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:24.772015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reed-Muller Realization of X (mod P)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Danila Gorodecky","submitted_at":"2015-04-18T22:52:05Z","abstract_excerpt":"This article provides a novel technique of X (mod P) realization. It is based on the Reed-Muller polynomial expansion. The advantage of the approach concludes in the capability to realize X (mod P) for an arbitrary P. The approach is competitive with the known realizations on the speed processing. Advantages and results of comparison with the known approaches for X [9:1] and P=7 is demonstrated."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04773","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":"1504.04773","created_at":"2026-05-18T02:18:24.772085+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.04773v1","created_at":"2026-05-18T02:18:24.772085+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04773","created_at":"2026-05-18T02:18:24.772085+00:00"},{"alias_kind":"pith_short_12","alias_value":"KLINYYOIIIIC","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KLINYYOIIIICMN5G","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KLINYYOI","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/KLINYYOIIIICMN5GYXVDB3XB3P","json":"https://pith.science/pith/KLINYYOIIIICMN5GYXVDB3XB3P.json","graph_json":"https://pith.science/api/pith-number/KLINYYOIIIICMN5GYXVDB3XB3P/graph.json","events_json":"https://pith.science/api/pith-number/KLINYYOIIIICMN5GYXVDB3XB3P/events.json","paper":"https://pith.science/paper/KLINYYOI"},"agent_actions":{"view_html":"https://pith.science/pith/KLINYYOIIIICMN5GYXVDB3XB3P","download_json":"https://pith.science/pith/KLINYYOIIIICMN5GYXVDB3XB3P.json","view_paper":"https://pith.science/paper/KLINYYOI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.04773&json=true","fetch_graph":"https://pith.science/api/pith-number/KLINYYOIIIICMN5GYXVDB3XB3P/graph.json","fetch_events":"https://pith.science/api/pith-number/KLINYYOIIIICMN5GYXVDB3XB3P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KLINYYOIIIICMN5GYXVDB3XB3P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KLINYYOIIIICMN5GYXVDB3XB3P/action/storage_attestation","attest_author":"https://pith.science/pith/KLINYYOIIIICMN5GYXVDB3XB3P/action/author_attestation","sign_citation":"https://pith.science/pith/KLINYYOIIIICMN5GYXVDB3XB3P/action/citation_signature","submit_replication":"https://pith.science/pith/KLINYYOIIIICMN5GYXVDB3XB3P/action/replication_record"}},"created_at":"2026-05-18T02:18:24.772085+00:00","updated_at":"2026-05-18T02:18:24.772085+00:00"}