{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7VAESZN2KNAVCDOTD2YKAMGHHB","short_pith_number":"pith:7VAESZN2","schema_version":"1.0","canonical_sha256":"fd404965ba5341510dd31eb0a030c7387e8549cd3841ab4a2ae83a1ede5c1579","source":{"kind":"arxiv","id":"1201.6472","version":3},"attestation_state":"computed","paper":{"title":"Improving incremental signature-based Groebner basis algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Christian Eder","submitted_at":"2012-01-31T08:37:32Z","abstract_excerpt":"In this paper we describe a combination of ideas to improve incremental signature-based Groebner basis algorithms having a big impact on their performance. Besides explaining how to combine already known optimizations to achieve more efficient algorithms, we compare the quite different effects on the two best-known algorithms in this area, F5 and G2V, both from a theoretical and a practical point of view."},"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":"1201.6472","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2012-01-31T08:37:32Z","cross_cats_sorted":[],"title_canon_sha256":"80ec19e7bdc292c4b3bdf3a7fabecb9357a4c88e378c548622f8f9bc8a526425","abstract_canon_sha256":"1afb6d97d506a9e1dd95bdddec5bfb94752b8b7b24fa4adeb088e6ebf6c3dc90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:24.813745Z","signature_b64":"2+pNdfuRMp+nzbdNqZa0Fc2cEq6vNYY6sa9zr4UdPru4Na0akIdX2Fms3wCuIuvbneVG8BgwDtYbOu8+dqN6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd404965ba5341510dd31eb0a030c7387e8549cd3841ab4a2ae83a1ede5c1579","last_reissued_at":"2026-05-18T03:59:24.813082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:24.813082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving incremental signature-based Groebner basis algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Christian Eder","submitted_at":"2012-01-31T08:37:32Z","abstract_excerpt":"In this paper we describe a combination of ideas to improve incremental signature-based Groebner basis algorithms having a big impact on their performance. Besides explaining how to combine already known optimizations to achieve more efficient algorithms, we compare the quite different effects on the two best-known algorithms in this area, F5 and G2V, both from a theoretical and a practical point of view."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6472","kind":"arxiv","version":3},"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":"1201.6472","created_at":"2026-05-18T03:59:24.813172+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.6472v3","created_at":"2026-05-18T03:59:24.813172+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6472","created_at":"2026-05-18T03:59:24.813172+00:00"},{"alias_kind":"pith_short_12","alias_value":"7VAESZN2KNAV","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"7VAESZN2KNAVCDOT","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"7VAESZN2","created_at":"2026-05-18T12:26:58.693483+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/7VAESZN2KNAVCDOTD2YKAMGHHB","json":"https://pith.science/pith/7VAESZN2KNAVCDOTD2YKAMGHHB.json","graph_json":"https://pith.science/api/pith-number/7VAESZN2KNAVCDOTD2YKAMGHHB/graph.json","events_json":"https://pith.science/api/pith-number/7VAESZN2KNAVCDOTD2YKAMGHHB/events.json","paper":"https://pith.science/paper/7VAESZN2"},"agent_actions":{"view_html":"https://pith.science/pith/7VAESZN2KNAVCDOTD2YKAMGHHB","download_json":"https://pith.science/pith/7VAESZN2KNAVCDOTD2YKAMGHHB.json","view_paper":"https://pith.science/paper/7VAESZN2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.6472&json=true","fetch_graph":"https://pith.science/api/pith-number/7VAESZN2KNAVCDOTD2YKAMGHHB/graph.json","fetch_events":"https://pith.science/api/pith-number/7VAESZN2KNAVCDOTD2YKAMGHHB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7VAESZN2KNAVCDOTD2YKAMGHHB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7VAESZN2KNAVCDOTD2YKAMGHHB/action/storage_attestation","attest_author":"https://pith.science/pith/7VAESZN2KNAVCDOTD2YKAMGHHB/action/author_attestation","sign_citation":"https://pith.science/pith/7VAESZN2KNAVCDOTD2YKAMGHHB/action/citation_signature","submit_replication":"https://pith.science/pith/7VAESZN2KNAVCDOTD2YKAMGHHB/action/replication_record"}},"created_at":"2026-05-18T03:59:24.813172+00:00","updated_at":"2026-05-18T03:59:24.813172+00:00"}