{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NPGELVN2UCZIVWOTLI37OKG4AZ","short_pith_number":"pith:NPGELVN2","canonical_record":{"source":{"id":"1210.0083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-29T06:18:34Z","cross_cats_sorted":["cs.DM","math.AC","math.AG","math.IT"],"title_canon_sha256":"cf7398e9c1a99d31a7b5817b45c435b3d6b68399f49c035c680718f5aaf5fab5","abstract_canon_sha256":"a1279ebbc875b7ef9cced9b815bec57153c3ba7c9ae493d8e2b6b50f5d2e722f"},"schema_version":"1.0"},"canonical_sha256":"6bcc45d5baa0b28ad9d35a37f728dc06436fbe6182a36b0bb0029f34924bdb21","source":{"kind":"arxiv","id":"1210.0083","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0083","created_at":"2026-05-18T03:44:23Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0083v1","created_at":"2026-05-18T03:44:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0083","created_at":"2026-05-18T03:44:23Z"},{"alias_kind":"pith_short_12","alias_value":"NPGELVN2UCZI","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NPGELVN2UCZIVWOT","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NPGELVN2","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NPGELVN2UCZIVWOTLI37OKG4AZ","target":"record","payload":{"canonical_record":{"source":{"id":"1210.0083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-29T06:18:34Z","cross_cats_sorted":["cs.DM","math.AC","math.AG","math.IT"],"title_canon_sha256":"cf7398e9c1a99d31a7b5817b45c435b3d6b68399f49c035c680718f5aaf5fab5","abstract_canon_sha256":"a1279ebbc875b7ef9cced9b815bec57153c3ba7c9ae493d8e2b6b50f5d2e722f"},"schema_version":"1.0"},"canonical_sha256":"6bcc45d5baa0b28ad9d35a37f728dc06436fbe6182a36b0bb0029f34924bdb21","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:23.361465Z","signature_b64":"0veaQRMkBV9icVqh/ce4BNlUrDqMzG1a5LYqJo9e4W+D40ecMzXM6oskIsO9uFQqVSq9GnBhkGmP0mKXlF6bAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bcc45d5baa0b28ad9d35a37f728dc06436fbe6182a36b0bb0029f34924bdb21","last_reissued_at":"2026-05-18T03:44:23.360978Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:23.360978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.0083","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-18T03:44:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P/1r546BrSCfnDsCxfn0kzNCK10m6tj7ASGrE9DInInac0NAdXCmosC0mLGWTCAW3uXl/0ZSyVzEf488goohAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:42:03.148768Z"},"content_sha256":"dfb27752770fa695c24893705b417dac7d66be717e7fed7d8dfc9cacca864013","schema_version":"1.0","event_id":"sha256:dfb27752770fa695c24893705b417dac7d66be717e7fed7d8dfc9cacca864013"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NPGELVN2UCZIVWOTLI37OKG4AZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decoding a Class of Affine Variety Codes with Fast DFT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.AC","math.AG","math.IT"],"primary_cat":"cs.IT","authors_text":"Hajime Matsui","submitted_at":"2012-09-29T06:18:34Z","abstract_excerpt":"An efficient procedure for error-value calculations based on fast discrete Fourier transforms (DFT) in conjunction with Berlekamp-Massey-Sakata algorithm for a class of affine variety codes is proposed. Our procedure is achieved by multidimensional DFT and linear recurrence relations from Grobner basis and is applied to erasure-and-error decoding and systematic encoding. The computational complexity of error-value calculations in our algorithm improves that in solving systems of linear equations from error correcting pairs in many cases. A motivating example of our algorithm in case of a Reed-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0083","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-18T03:44:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oLYJwUUYQvka9qS0/lYDPaE8/mlB+8P2U985ZF3VT5/vB7vDTK+msjS6l8tlT1OVZSlmt+LlxPDKlxeKlVl1Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:42:03.149115Z"},"content_sha256":"bee0cf2f73be12cc87fece3399c54eb0adf4b8ac00abc64abdd675d1447615a1","schema_version":"1.0","event_id":"sha256:bee0cf2f73be12cc87fece3399c54eb0adf4b8ac00abc64abdd675d1447615a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NPGELVN2UCZIVWOTLI37OKG4AZ/bundle.json","state_url":"https://pith.science/pith/NPGELVN2UCZIVWOTLI37OKG4AZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NPGELVN2UCZIVWOTLI37OKG4AZ/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-06-26T09:42:03Z","links":{"resolver":"https://pith.science/pith/NPGELVN2UCZIVWOTLI37OKG4AZ","bundle":"https://pith.science/pith/NPGELVN2UCZIVWOTLI37OKG4AZ/bundle.json","state":"https://pith.science/pith/NPGELVN2UCZIVWOTLI37OKG4AZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NPGELVN2UCZIVWOTLI37OKG4AZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NPGELVN2UCZIVWOTLI37OKG4AZ","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":"a1279ebbc875b7ef9cced9b815bec57153c3ba7c9ae493d8e2b6b50f5d2e722f","cross_cats_sorted":["cs.DM","math.AC","math.AG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-29T06:18:34Z","title_canon_sha256":"cf7398e9c1a99d31a7b5817b45c435b3d6b68399f49c035c680718f5aaf5fab5"},"schema_version":"1.0","source":{"id":"1210.0083","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0083","created_at":"2026-05-18T03:44:23Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0083v1","created_at":"2026-05-18T03:44:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0083","created_at":"2026-05-18T03:44:23Z"},{"alias_kind":"pith_short_12","alias_value":"NPGELVN2UCZI","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NPGELVN2UCZIVWOT","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NPGELVN2","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:bee0cf2f73be12cc87fece3399c54eb0adf4b8ac00abc64abdd675d1447615a1","target":"graph","created_at":"2026-05-18T03:44:23Z","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":"An efficient procedure for error-value calculations based on fast discrete Fourier transforms (DFT) in conjunction with Berlekamp-Massey-Sakata algorithm for a class of affine variety codes is proposed. Our procedure is achieved by multidimensional DFT and linear recurrence relations from Grobner basis and is applied to erasure-and-error decoding and systematic encoding. The computational complexity of error-value calculations in our algorithm improves that in solving systems of linear equations from error correcting pairs in many cases. A motivating example of our algorithm in case of a Reed-","authors_text":"Hajime Matsui","cross_cats":["cs.DM","math.AC","math.AG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-29T06:18:34Z","title":"Decoding a Class of Affine Variety Codes with Fast DFT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0083","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:dfb27752770fa695c24893705b417dac7d66be717e7fed7d8dfc9cacca864013","target":"record","created_at":"2026-05-18T03:44:23Z","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":"a1279ebbc875b7ef9cced9b815bec57153c3ba7c9ae493d8e2b6b50f5d2e722f","cross_cats_sorted":["cs.DM","math.AC","math.AG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-09-29T06:18:34Z","title_canon_sha256":"cf7398e9c1a99d31a7b5817b45c435b3d6b68399f49c035c680718f5aaf5fab5"},"schema_version":"1.0","source":{"id":"1210.0083","kind":"arxiv","version":1}},"canonical_sha256":"6bcc45d5baa0b28ad9d35a37f728dc06436fbe6182a36b0bb0029f34924bdb21","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6bcc45d5baa0b28ad9d35a37f728dc06436fbe6182a36b0bb0029f34924bdb21","first_computed_at":"2026-05-18T03:44:23.360978Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:23.360978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0veaQRMkBV9icVqh/ce4BNlUrDqMzG1a5LYqJo9e4W+D40ecMzXM6oskIsO9uFQqVSq9GnBhkGmP0mKXlF6bAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:23.361465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.0083","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfb27752770fa695c24893705b417dac7d66be717e7fed7d8dfc9cacca864013","sha256:bee0cf2f73be12cc87fece3399c54eb0adf4b8ac00abc64abdd675d1447615a1"],"state_sha256":"3851da1750ba56e1ae76c58895538c76746a1c3448516eb2ea2ff34fb8acfcd4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gD646PxZbV4AeuGKfZpMydmc9ZOfMkZjKoG3UWdmkzT5ZVq23rPN/KjjtolrNc0jNfHeE2UIUceEy4g/xSWOBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T09:42:03.151081Z","bundle_sha256":"cbfbafacb0923f15cb83c6b2f6e699dab001b11be0d8bd7e0e5438ef879a7582"}}