{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CW25PPH6FLNW3MZHO6GZMINIIV","short_pith_number":"pith:CW25PPH6","schema_version":"1.0","canonical_sha256":"15b5d7bcfe2adb6db327778d9621a84545352a66c397fcacbedc472e5a14732b","source":{"kind":"arxiv","id":"1209.2379","version":3},"attestation_state":"computed","paper":{"title":"Reducing the size and number of linear programs in a dynamic Gr\\\"obner basis algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"math.AC","authors_text":"John Perry, Massimo Caboara","submitted_at":"2012-09-11T17:48:19Z","abstract_excerpt":"The dynamic algorithm to compute a Gr\\\"obner basis is nearly twenty years old, yet it seems to have arrived stillborn; aside from two initial publications, there have been no published followups. One reason for this may be that, at first glance, the added overhead seems to outweigh the benefit; the algorithm must solve many linear programs with many linear constraints. This paper describes two methods of reducing the cost substantially, answering the problem effectively."},"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":"1209.2379","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2012-09-11T17:48:19Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"492fd1479a371836cf2ab719d4559ec04e9fdecd06b333e817a598366e5f1862","abstract_canon_sha256":"447fffdd5b861ff969e495273a6c6fa00e5e70e49f230db473ff8c5945959437"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:57.751188Z","signature_b64":"K96dyEYVjUBtSvac8bKce+eHkSs9JlBV8Qt2/mragfEpB/YBxIykjf9Cri79Chh5sxMwwh3+e6626G0GR0nGAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15b5d7bcfe2adb6db327778d9621a84545352a66c397fcacbedc472e5a14732b","last_reissued_at":"2026-05-18T02:58:57.750412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:57.750412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reducing the size and number of linear programs in a dynamic Gr\\\"obner basis algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"math.AC","authors_text":"John Perry, Massimo Caboara","submitted_at":"2012-09-11T17:48:19Z","abstract_excerpt":"The dynamic algorithm to compute a Gr\\\"obner basis is nearly twenty years old, yet it seems to have arrived stillborn; aside from two initial publications, there have been no published followups. One reason for this may be that, at first glance, the added overhead seems to outweigh the benefit; the algorithm must solve many linear programs with many linear constraints. This paper describes two methods of reducing the cost substantially, answering the problem effectively."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2379","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":"1209.2379","created_at":"2026-05-18T02:58:57.750536+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.2379v3","created_at":"2026-05-18T02:58:57.750536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2379","created_at":"2026-05-18T02:58:57.750536+00:00"},{"alias_kind":"pith_short_12","alias_value":"CW25PPH6FLNW","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CW25PPH6FLNW3MZH","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CW25PPH6","created_at":"2026-05-18T12:27:01.376967+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/CW25PPH6FLNW3MZHO6GZMINIIV","json":"https://pith.science/pith/CW25PPH6FLNW3MZHO6GZMINIIV.json","graph_json":"https://pith.science/api/pith-number/CW25PPH6FLNW3MZHO6GZMINIIV/graph.json","events_json":"https://pith.science/api/pith-number/CW25PPH6FLNW3MZHO6GZMINIIV/events.json","paper":"https://pith.science/paper/CW25PPH6"},"agent_actions":{"view_html":"https://pith.science/pith/CW25PPH6FLNW3MZHO6GZMINIIV","download_json":"https://pith.science/pith/CW25PPH6FLNW3MZHO6GZMINIIV.json","view_paper":"https://pith.science/paper/CW25PPH6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.2379&json=true","fetch_graph":"https://pith.science/api/pith-number/CW25PPH6FLNW3MZHO6GZMINIIV/graph.json","fetch_events":"https://pith.science/api/pith-number/CW25PPH6FLNW3MZHO6GZMINIIV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CW25PPH6FLNW3MZHO6GZMINIIV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CW25PPH6FLNW3MZHO6GZMINIIV/action/storage_attestation","attest_author":"https://pith.science/pith/CW25PPH6FLNW3MZHO6GZMINIIV/action/author_attestation","sign_citation":"https://pith.science/pith/CW25PPH6FLNW3MZHO6GZMINIIV/action/citation_signature","submit_replication":"https://pith.science/pith/CW25PPH6FLNW3MZHO6GZMINIIV/action/replication_record"}},"created_at":"2026-05-18T02:58:57.750536+00:00","updated_at":"2026-05-18T02:58:57.750536+00:00"}