{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:INLX6ANAWNLRUJMRSZMHCQYTGN","short_pith_number":"pith:INLX6ANA","canonical_record":{"source":{"id":"1612.04588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2016-12-14T11:41:05Z","cross_cats_sorted":[],"title_canon_sha256":"c56fc7d8211f90346861f49dba2804927230c1c0c59afe5ac9cc865b7260c90d","abstract_canon_sha256":"9c0e553f6ea02752aef9207aea02aeec87efc471bae92453f74a2b5fdddba1a9"},"schema_version":"1.0"},"canonical_sha256":"43577f01a0b3571a259196587143133354aa9bca6143ec5c360734adc3f011e3","source":{"kind":"arxiv","id":"1612.04588","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.04588","created_at":"2026-05-18T00:54:59Z"},{"alias_kind":"arxiv_version","alias_value":"1612.04588v1","created_at":"2026-05-18T00:54:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04588","created_at":"2026-05-18T00:54:59Z"},{"alias_kind":"pith_short_12","alias_value":"INLX6ANAWNLR","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"INLX6ANAWNLRUJMR","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"INLX6ANA","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:INLX6ANAWNLRUJMRSZMHCQYTGN","target":"record","payload":{"canonical_record":{"source":{"id":"1612.04588","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2016-12-14T11:41:05Z","cross_cats_sorted":[],"title_canon_sha256":"c56fc7d8211f90346861f49dba2804927230c1c0c59afe5ac9cc865b7260c90d","abstract_canon_sha256":"9c0e553f6ea02752aef9207aea02aeec87efc471bae92453f74a2b5fdddba1a9"},"schema_version":"1.0"},"canonical_sha256":"43577f01a0b3571a259196587143133354aa9bca6143ec5c360734adc3f011e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:59.104550Z","signature_b64":"vVRPDAqWeAZwNJ+2ohNjMlDDKcZUb5mBiOXL+TiPu6uF3GuMEOXU3+KMApR4/y5Et+AIXdBcBkMDA63ydfFMBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43577f01a0b3571a259196587143133354aa9bca6143ec5c360734adc3f011e3","last_reissued_at":"2026-05-18T00:54:59.103661Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:59.103661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.04588","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:54:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uF00EN8cg9OWAgiCnN2uum5DR9C+dUhfUTa04nOuGyUIIucjmTkWIu6nd8/NxYviagF3CFzXV4vYGdqmzHN+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:56:01.886083Z"},"content_sha256":"332aebb847a5c11421ea4b95c01681ae141b4979c635c1caaaf9d851b0b037b7","schema_version":"1.0","event_id":"sha256:332aebb847a5c11421ea4b95c01681ae141b4979c635c1caaaf9d851b0b037b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:INLX6ANAWNLRUJMRSZMHCQYTGN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reverse Engineering of Irreducible Polynomials in GF(2^m) Arithmetic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Cunxi Yu, Daniel Holcomb, Maciej Ciesielski","submitted_at":"2016-12-14T11:41:05Z","abstract_excerpt":"Current techniques for formally verifying circuits implemented in Galois field (GF) arithmetic are limited to those with a known irreducible polynomial P(x). This paper presents a computer algebra based technique that extracts the irreducible polynomial P(x) used in the implementation of a multiplier in GF(2^m). The method is based on first extracting a unique polynomial in Galois field of each output bit independently. P(x) is then obtained by analyzing the algebraic expression in GF(2^m) of each output bit. We demonstrate that this method is able to reverse engineer the irreducible polynomia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04588","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:54:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"29BOxfBBbFVTjQM3Qo3GnA29CeQ3Y1Ht+2tB4VrG0m1ZKtG/aXdPZ7vdkuzaki3kAQlIijMd/DpbCkTWseJpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:56:01.886453Z"},"content_sha256":"19f0eb4c42cac3f40f84b1549b680275db48e2656a21b430296e2c9897ea235a","schema_version":"1.0","event_id":"sha256:19f0eb4c42cac3f40f84b1549b680275db48e2656a21b430296e2c9897ea235a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/INLX6ANAWNLRUJMRSZMHCQYTGN/bundle.json","state_url":"https://pith.science/pith/INLX6ANAWNLRUJMRSZMHCQYTGN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/INLX6ANAWNLRUJMRSZMHCQYTGN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T05:56:01Z","links":{"resolver":"https://pith.science/pith/INLX6ANAWNLRUJMRSZMHCQYTGN","bundle":"https://pith.science/pith/INLX6ANAWNLRUJMRSZMHCQYTGN/bundle.json","state":"https://pith.science/pith/INLX6ANAWNLRUJMRSZMHCQYTGN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/INLX6ANAWNLRUJMRSZMHCQYTGN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:INLX6ANAWNLRUJMRSZMHCQYTGN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9c0e553f6ea02752aef9207aea02aeec87efc471bae92453f74a2b5fdddba1a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2016-12-14T11:41:05Z","title_canon_sha256":"c56fc7d8211f90346861f49dba2804927230c1c0c59afe5ac9cc865b7260c90d"},"schema_version":"1.0","source":{"id":"1612.04588","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.04588","created_at":"2026-05-18T00:54:59Z"},{"alias_kind":"arxiv_version","alias_value":"1612.04588v1","created_at":"2026-05-18T00:54:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04588","created_at":"2026-05-18T00:54:59Z"},{"alias_kind":"pith_short_12","alias_value":"INLX6ANAWNLR","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"INLX6ANAWNLRUJMR","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"INLX6ANA","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:19f0eb4c42cac3f40f84b1549b680275db48e2656a21b430296e2c9897ea235a","target":"graph","created_at":"2026-05-18T00:54:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Current techniques for formally verifying circuits implemented in Galois field (GF) arithmetic are limited to those with a known irreducible polynomial P(x). This paper presents a computer algebra based technique that extracts the irreducible polynomial P(x) used in the implementation of a multiplier in GF(2^m). The method is based on first extracting a unique polynomial in Galois field of each output bit independently. P(x) is then obtained by analyzing the algebraic expression in GF(2^m) of each output bit. We demonstrate that this method is able to reverse engineer the irreducible polynomia","authors_text":"Cunxi Yu, Daniel Holcomb, Maciej Ciesielski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2016-12-14T11:41:05Z","title":"Reverse Engineering of Irreducible Polynomials in GF(2^m) Arithmetic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04588","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:332aebb847a5c11421ea4b95c01681ae141b4979c635c1caaaf9d851b0b037b7","target":"record","created_at":"2026-05-18T00:54:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9c0e553f6ea02752aef9207aea02aeec87efc471bae92453f74a2b5fdddba1a9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2016-12-14T11:41:05Z","title_canon_sha256":"c56fc7d8211f90346861f49dba2804927230c1c0c59afe5ac9cc865b7260c90d"},"schema_version":"1.0","source":{"id":"1612.04588","kind":"arxiv","version":1}},"canonical_sha256":"43577f01a0b3571a259196587143133354aa9bca6143ec5c360734adc3f011e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43577f01a0b3571a259196587143133354aa9bca6143ec5c360734adc3f011e3","first_computed_at":"2026-05-18T00:54:59.103661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:59.103661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vVRPDAqWeAZwNJ+2ohNjMlDDKcZUb5mBiOXL+TiPu6uF3GuMEOXU3+KMApR4/y5Et+AIXdBcBkMDA63ydfFMBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:59.104550Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.04588","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:332aebb847a5c11421ea4b95c01681ae141b4979c635c1caaaf9d851b0b037b7","sha256:19f0eb4c42cac3f40f84b1549b680275db48e2656a21b430296e2c9897ea235a"],"state_sha256":"35945dddf6624d292ba63f0f920c855d649d0978268316b251514ff5697cfa91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"25R61FaN1fFsOheYRlKQ0V7QPJ07LeRpbTGKN/JBr4UKvqivWVSpTlkVDFjhQe+MNTiG/OMiBUGcCK06egLgBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:56:01.888783Z","bundle_sha256":"46de139f5b94a41493becba0745c30eba33f7d7aca6c67a082d0213ecb4750c2"}}