{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:OS25432DOW66B3CHAHSBKZNPRI","short_pith_number":"pith:OS25432D","canonical_record":{"source":{"id":"1008.4474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-26T10:53:59Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"6fe24bdac57f5a1fdca635edff33e9d909b84b1486fb71370a1283cb6e856e78","abstract_canon_sha256":"8ba03c272865a9016908ebc4f4bfe52811dec7b22fbeaeeebd5671b9f2e92e60"},"schema_version":"1.0"},"canonical_sha256":"74b5de6f4375bde0ec4701e41565af8a2b6d9cc14168ce3c4fe4f5f6b4afd373","source":{"kind":"arxiv","id":"1008.4474","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.4474","created_at":"2026-05-18T04:41:45Z"},{"alias_kind":"arxiv_version","alias_value":"1008.4474v1","created_at":"2026-05-18T04:41:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4474","created_at":"2026-05-18T04:41:45Z"},{"alias_kind":"pith_short_12","alias_value":"OS25432DOW66","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OS25432DOW66B3CH","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OS25432D","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:OS25432DOW66B3CHAHSBKZNPRI","target":"record","payload":{"canonical_record":{"source":{"id":"1008.4474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-26T10:53:59Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"6fe24bdac57f5a1fdca635edff33e9d909b84b1486fb71370a1283cb6e856e78","abstract_canon_sha256":"8ba03c272865a9016908ebc4f4bfe52811dec7b22fbeaeeebd5671b9f2e92e60"},"schema_version":"1.0"},"canonical_sha256":"74b5de6f4375bde0ec4701e41565af8a2b6d9cc14168ce3c4fe4f5f6b4afd373","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:45.255693Z","signature_b64":"AqetLAzARh7jtByuQtELJUpWL5F225938CppP+/x/5S09Ij0RWc3wf7Zfqy2NRxtotv32Os6XQIQEeWrpDxKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74b5de6f4375bde0ec4701e41565af8a2b6d9cc14168ce3c4fe4f5f6b4afd373","last_reissued_at":"2026-05-18T04:41:45.255172Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:45.255172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.4474","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-18T04:41:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jubrHAhoGqhc4beYvOI03USK9bURxmW7jRGgOvxz7yzA7FeEk0nnKohU/UFM5NfvwLe9JSze4hwqhylo8W3kDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:10:38.704357Z"},"content_sha256":"fb0ddab444840d067893636f620d7892dc37663580b5b8b58fdedf131c35f4a2","schema_version":"1.0","event_id":"sha256:fb0ddab444840d067893636f620d7892dc37663580b5b8b58fdedf131c35f4a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:OS25432DOW66B3CHAHSBKZNPRI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Algebraic View to Gradient Descent Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"E. Martinez-Moro, I. Marquez-Corbella, M.A. Borges Trenard, M. Borges Quintana","submitted_at":"2010-08-26T10:53:59Z","abstract_excerpt":"There are two gradient descent decoding procedures for binary codes proposed independently by Liebler and by Ashikhmin and Barg. Liebler in his paper mentions that both algorithms have the same philosophy but in fact they are rather different. The purpose of this communication is to show that both algorithms can be seen as two ways of understanding the reduction process algebraic monoid structure related to the code. The main tool used for showing this is the Gr\\\"obner representation of the monoid associated to the linear code."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4474","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-18T04:41:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oa4ni1zSwOBuDTqzkceOUMCdhFhHDVzXN1bYBiEvAw7yQujgHsgIGBZf1+gIo2ogKC9SXeIujuuXojxkY5HnDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:10:38.704717Z"},"content_sha256":"af6dd99785634f301153dcdda28db6ed8235d0c1670613c1a2c5141f0847af74","schema_version":"1.0","event_id":"sha256:af6dd99785634f301153dcdda28db6ed8235d0c1670613c1a2c5141f0847af74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OS25432DOW66B3CHAHSBKZNPRI/bundle.json","state_url":"https://pith.science/pith/OS25432DOW66B3CHAHSBKZNPRI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OS25432DOW66B3CHAHSBKZNPRI/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-25T08:10:38Z","links":{"resolver":"https://pith.science/pith/OS25432DOW66B3CHAHSBKZNPRI","bundle":"https://pith.science/pith/OS25432DOW66B3CHAHSBKZNPRI/bundle.json","state":"https://pith.science/pith/OS25432DOW66B3CHAHSBKZNPRI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OS25432DOW66B3CHAHSBKZNPRI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:OS25432DOW66B3CHAHSBKZNPRI","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":"8ba03c272865a9016908ebc4f4bfe52811dec7b22fbeaeeebd5671b9f2e92e60","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-26T10:53:59Z","title_canon_sha256":"6fe24bdac57f5a1fdca635edff33e9d909b84b1486fb71370a1283cb6e856e78"},"schema_version":"1.0","source":{"id":"1008.4474","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.4474","created_at":"2026-05-18T04:41:45Z"},{"alias_kind":"arxiv_version","alias_value":"1008.4474v1","created_at":"2026-05-18T04:41:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4474","created_at":"2026-05-18T04:41:45Z"},{"alias_kind":"pith_short_12","alias_value":"OS25432DOW66","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OS25432DOW66B3CH","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OS25432D","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:af6dd99785634f301153dcdda28db6ed8235d0c1670613c1a2c5141f0847af74","target":"graph","created_at":"2026-05-18T04:41:45Z","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":"There are two gradient descent decoding procedures for binary codes proposed independently by Liebler and by Ashikhmin and Barg. Liebler in his paper mentions that both algorithms have the same philosophy but in fact they are rather different. The purpose of this communication is to show that both algorithms can be seen as two ways of understanding the reduction process algebraic monoid structure related to the code. The main tool used for showing this is the Gr\\\"obner representation of the monoid associated to the linear code.","authors_text":"E. Martinez-Moro, I. Marquez-Corbella, M.A. Borges Trenard, M. Borges Quintana","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-26T10:53:59Z","title":"An Algebraic View to Gradient Descent Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4474","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:fb0ddab444840d067893636f620d7892dc37663580b5b8b58fdedf131c35f4a2","target":"record","created_at":"2026-05-18T04:41:45Z","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":"8ba03c272865a9016908ebc4f4bfe52811dec7b22fbeaeeebd5671b9f2e92e60","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-08-26T10:53:59Z","title_canon_sha256":"6fe24bdac57f5a1fdca635edff33e9d909b84b1486fb71370a1283cb6e856e78"},"schema_version":"1.0","source":{"id":"1008.4474","kind":"arxiv","version":1}},"canonical_sha256":"74b5de6f4375bde0ec4701e41565af8a2b6d9cc14168ce3c4fe4f5f6b4afd373","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74b5de6f4375bde0ec4701e41565af8a2b6d9cc14168ce3c4fe4f5f6b4afd373","first_computed_at":"2026-05-18T04:41:45.255172Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:45.255172Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AqetLAzARh7jtByuQtELJUpWL5F225938CppP+/x/5S09Ij0RWc3wf7Zfqy2NRxtotv32Os6XQIQEeWrpDxKAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:45.255693Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.4474","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb0ddab444840d067893636f620d7892dc37663580b5b8b58fdedf131c35f4a2","sha256:af6dd99785634f301153dcdda28db6ed8235d0c1670613c1a2c5141f0847af74"],"state_sha256":"46034406d2a581bf61b79eb2a913cd9799b492eb153b2e8e686494967859965d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"slVhSQiNPbS9W5oWfGuFL/bzUCWToFSmcU3C1hAgKHBLc6u5kh0nF+F/lNWxD95zraYQ4fUL5J6AexSu0iIjBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T08:10:38.706698Z","bundle_sha256":"7022e3e7c8a91c0cfcbc374186c1a0d62480e584829cdd29248d85a56d8407d8"}}