{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IVKRJYDQ35TOU26MTZIAV7U2YS","short_pith_number":"pith:IVKRJYDQ","canonical_record":{"source":{"id":"1306.6811","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2013-06-28T12:33:06Z","cross_cats_sorted":["cs.SC","math.RA"],"title_canon_sha256":"cfdfc03ed2ba2a8db751eb5dd1a50a95b189804dc1f694c64b13622408938ca3","abstract_canon_sha256":"b4760c18f9b72bb6f1718e4075d06de714d5330bf4fb067390a5df6f8f0715f6"},"schema_version":"1.0"},"canonical_sha256":"455514e070df66ea6bcc9e500afe9ac4804bf9264bb0074740d49b070e0de259","source":{"kind":"arxiv","id":"1306.6811","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.6811","created_at":"2026-05-18T03:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1306.6811v1","created_at":"2026-05-18T03:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6811","created_at":"2026-05-18T03:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"IVKRJYDQ35TO","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"IVKRJYDQ35TOU26M","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"IVKRJYDQ","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IVKRJYDQ35TOU26MTZIAV7U2YS","target":"record","payload":{"canonical_record":{"source":{"id":"1306.6811","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2013-06-28T12:33:06Z","cross_cats_sorted":["cs.SC","math.RA"],"title_canon_sha256":"cfdfc03ed2ba2a8db751eb5dd1a50a95b189804dc1f694c64b13622408938ca3","abstract_canon_sha256":"b4760c18f9b72bb6f1718e4075d06de714d5330bf4fb067390a5df6f8f0715f6"},"schema_version":"1.0"},"canonical_sha256":"455514e070df66ea6bcc9e500afe9ac4804bf9264bb0074740d49b070e0de259","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:42.882044Z","signature_b64":"nTOcTibQBQEl3xkspBR9uHJ0bZH3pIZUMjJ0a4aUWjeoJ7QQUa7FfWlcEs5rNZRDRx3zuspIs9aaP2h5YJa/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"455514e070df66ea6bcc9e500afe9ac4804bf9264bb0074740d49b070e0de259","last_reissued_at":"2026-05-18T03:19:42.881504Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:42.881504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.6811","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:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V3J/VfyiCstmi/ugxccY2zCRvZ31CJxDGFJ7uydSH9d1GX2AeLhf60ySl74kzechcIMJabCYznF8oxrglI89Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:28:15.743849Z"},"content_sha256":"5f4fb88575c4a52133c109e6285515955bbe04e2438f43ad3ae12516861ef6e2","schema_version":"1.0","event_id":"sha256:5f4fb88575c4a52133c109e6285515955bbe04e2438f43ad3ae12516861ef6e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IVKRJYDQ35TOU26MTZIAV7U2YS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Involutive Bases Algorithm Incorporating F5 Criterion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC","math.RA"],"primary_cat":"math.AC","authors_text":"Amir Hashemi, Benyamin M.-Alizadeh, Vladimir P. Gerdt","submitted_at":"2013-06-28T12:33:06Z","abstract_excerpt":"Faugere's F5 algorithm is the fastest known algorithm to compute Groebner bases. It has a signature-based and an incremental structure that allow to apply the F5 criterion for deletion of unnecessary reductions. In this paper, we present an involutive completion algorithm which outputs a minimal involutive basis. Our completion algorithm has a nonincremental structure and in addition to the involutive form of Buchberger's criteria it applies the F5 criterion whenever this criterion is applicable in the course of completion to involution. In doing so, we use the G2V form of the F5 criterion dev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6811","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:19:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"avVu7LfqejezKnmLiuJw/BeY+6+ZygMAcFTMDxc4UsnIkaMGzICgmGrrwmDgRSRfI1iYeoBY1LhdsZxZPm+KBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:28:15.744560Z"},"content_sha256":"373b7bdb6924f2122aadf2653bea13d470cea76533cf9ca7ca83f57763ca0cc8","schema_version":"1.0","event_id":"sha256:373b7bdb6924f2122aadf2653bea13d470cea76533cf9ca7ca83f57763ca0cc8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IVKRJYDQ35TOU26MTZIAV7U2YS/bundle.json","state_url":"https://pith.science/pith/IVKRJYDQ35TOU26MTZIAV7U2YS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IVKRJYDQ35TOU26MTZIAV7U2YS/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-09T09:28:15Z","links":{"resolver":"https://pith.science/pith/IVKRJYDQ35TOU26MTZIAV7U2YS","bundle":"https://pith.science/pith/IVKRJYDQ35TOU26MTZIAV7U2YS/bundle.json","state":"https://pith.science/pith/IVKRJYDQ35TOU26MTZIAV7U2YS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IVKRJYDQ35TOU26MTZIAV7U2YS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IVKRJYDQ35TOU26MTZIAV7U2YS","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":"b4760c18f9b72bb6f1718e4075d06de714d5330bf4fb067390a5df6f8f0715f6","cross_cats_sorted":["cs.SC","math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2013-06-28T12:33:06Z","title_canon_sha256":"cfdfc03ed2ba2a8db751eb5dd1a50a95b189804dc1f694c64b13622408938ca3"},"schema_version":"1.0","source":{"id":"1306.6811","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.6811","created_at":"2026-05-18T03:19:42Z"},{"alias_kind":"arxiv_version","alias_value":"1306.6811v1","created_at":"2026-05-18T03:19:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6811","created_at":"2026-05-18T03:19:42Z"},{"alias_kind":"pith_short_12","alias_value":"IVKRJYDQ35TO","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"IVKRJYDQ35TOU26M","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"IVKRJYDQ","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:373b7bdb6924f2122aadf2653bea13d470cea76533cf9ca7ca83f57763ca0cc8","target":"graph","created_at":"2026-05-18T03:19:42Z","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":"Faugere's F5 algorithm is the fastest known algorithm to compute Groebner bases. It has a signature-based and an incremental structure that allow to apply the F5 criterion for deletion of unnecessary reductions. In this paper, we present an involutive completion algorithm which outputs a minimal involutive basis. Our completion algorithm has a nonincremental structure and in addition to the involutive form of Buchberger's criteria it applies the F5 criterion whenever this criterion is applicable in the course of completion to involution. In doing so, we use the G2V form of the F5 criterion dev","authors_text":"Amir Hashemi, Benyamin M.-Alizadeh, Vladimir P. Gerdt","cross_cats":["cs.SC","math.RA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2013-06-28T12:33:06Z","title":"Involutive Bases Algorithm Incorporating F5 Criterion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6811","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:5f4fb88575c4a52133c109e6285515955bbe04e2438f43ad3ae12516861ef6e2","target":"record","created_at":"2026-05-18T03:19:42Z","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":"b4760c18f9b72bb6f1718e4075d06de714d5330bf4fb067390a5df6f8f0715f6","cross_cats_sorted":["cs.SC","math.RA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2013-06-28T12:33:06Z","title_canon_sha256":"cfdfc03ed2ba2a8db751eb5dd1a50a95b189804dc1f694c64b13622408938ca3"},"schema_version":"1.0","source":{"id":"1306.6811","kind":"arxiv","version":1}},"canonical_sha256":"455514e070df66ea6bcc9e500afe9ac4804bf9264bb0074740d49b070e0de259","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"455514e070df66ea6bcc9e500afe9ac4804bf9264bb0074740d49b070e0de259","first_computed_at":"2026-05-18T03:19:42.881504Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:19:42.881504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nTOcTibQBQEl3xkspBR9uHJ0bZH3pIZUMjJ0a4aUWjeoJ7QQUa7FfWlcEs5rNZRDRx3zuspIs9aaP2h5YJa/DA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:19:42.882044Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.6811","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f4fb88575c4a52133c109e6285515955bbe04e2438f43ad3ae12516861ef6e2","sha256:373b7bdb6924f2122aadf2653bea13d470cea76533cf9ca7ca83f57763ca0cc8"],"state_sha256":"2068500ab265148669aa84afc0233581b8697e9efbcb89d179049dae3b97f6f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VaxnNFo/9ElgQNoh+aaJLWd8KdMlzfJ92JCZ3eHbGFlpnTFx9w4YZGRHRSsiRU7PIz6ET9GWr3yAl4GWrqevCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T09:28:15.748597Z","bundle_sha256":"aba3385b2bf8bdbd99d416848e87d99c00345424958e0311e7771c33f0b19a52"}}