{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CW25PPH6FLNW3MZHO6GZMINIIV","short_pith_number":"pith:CW25PPH6","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"},"canonical_sha256":"15b5d7bcfe2adb6db327778d9621a84545352a66c397fcacbedc472e5a14732b","source":{"kind":"arxiv","id":"1209.2379","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.2379","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"1209.2379v3","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2379","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"CW25PPH6FLNW","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CW25PPH6FLNW3MZH","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CW25PPH6","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CW25PPH6FLNW3MZHO6GZMINIIV","target":"record","payload":{"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"},"canonical_sha256":"15b5d7bcfe2adb6db327778d9621a84545352a66c397fcacbedc472e5a14732b","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"},"source_kind":"arxiv","source_id":"1209.2379","source_version":3,"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-18T02:58:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OcRc3JWcfgkd2PWCJuXpyIF66S3qBAySD1T7YOOaFcN3DrCG2nqAQ6XEIU2rROkjM1pSziSqiNWY0cpeWjRLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T20:24:09.935172Z"},"content_sha256":"6ef3ccc4fac95cbc0b0e699d9c7c7a706bffe6bb9b7cdc9a7f538a94aab543c0","schema_version":"1.0","event_id":"sha256:6ef3ccc4fac95cbc0b0e699d9c7c7a706bffe6bb9b7cdc9a7f538a94aab543c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CW25PPH6FLNW3MZHO6GZMINIIV","target":"graph","payload":{"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"},"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-18T02:58:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YEv385J6QCKiwfouShVyupxyCYhILja2ltKiRk8l/JhV94TK7+w+VcBjEYg1w0Jkoy60mhdCC3GVZl63GZ8sBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T20:24:09.935552Z"},"content_sha256":"86082b67c1de42f41341f9e3463191b14a7ae2ff373afe1acaec2a29d72df152","schema_version":"1.0","event_id":"sha256:86082b67c1de42f41341f9e3463191b14a7ae2ff373afe1acaec2a29d72df152"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CW25PPH6FLNW3MZHO6GZMINIIV/bundle.json","state_url":"https://pith.science/pith/CW25PPH6FLNW3MZHO6GZMINIIV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CW25PPH6FLNW3MZHO6GZMINIIV/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-05-24T20:24:09Z","links":{"resolver":"https://pith.science/pith/CW25PPH6FLNW3MZHO6GZMINIIV","bundle":"https://pith.science/pith/CW25PPH6FLNW3MZHO6GZMINIIV/bundle.json","state":"https://pith.science/pith/CW25PPH6FLNW3MZHO6GZMINIIV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CW25PPH6FLNW3MZHO6GZMINIIV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CW25PPH6FLNW3MZHO6GZMINIIV","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":"447fffdd5b861ff969e495273a6c6fa00e5e70e49f230db473ff8c5945959437","cross_cats_sorted":["cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2012-09-11T17:48:19Z","title_canon_sha256":"492fd1479a371836cf2ab719d4559ec04e9fdecd06b333e817a598366e5f1862"},"schema_version":"1.0","source":{"id":"1209.2379","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.2379","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"1209.2379v3","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2379","created_at":"2026-05-18T02:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"CW25PPH6FLNW","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CW25PPH6FLNW3MZH","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CW25PPH6","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:86082b67c1de42f41341f9e3463191b14a7ae2ff373afe1acaec2a29d72df152","target":"graph","created_at":"2026-05-18T02:58:57Z","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":"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.","authors_text":"John Perry, Massimo Caboara","cross_cats":["cs.SC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2012-09-11T17:48:19Z","title":"Reducing the size and number of linear programs in a dynamic Gr\\\"obner basis algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2379","kind":"arxiv","version":3},"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:6ef3ccc4fac95cbc0b0e699d9c7c7a706bffe6bb9b7cdc9a7f538a94aab543c0","target":"record","created_at":"2026-05-18T02:58:57Z","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":"447fffdd5b861ff969e495273a6c6fa00e5e70e49f230db473ff8c5945959437","cross_cats_sorted":["cs.SC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2012-09-11T17:48:19Z","title_canon_sha256":"492fd1479a371836cf2ab719d4559ec04e9fdecd06b333e817a598366e5f1862"},"schema_version":"1.0","source":{"id":"1209.2379","kind":"arxiv","version":3}},"canonical_sha256":"15b5d7bcfe2adb6db327778d9621a84545352a66c397fcacbedc472e5a14732b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15b5d7bcfe2adb6db327778d9621a84545352a66c397fcacbedc472e5a14732b","first_computed_at":"2026-05-18T02:58:57.750412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:57.750412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K96dyEYVjUBtSvac8bKce+eHkSs9JlBV8Qt2/mragfEpB/YBxIykjf9Cri79Chh5sxMwwh3+e6626G0GR0nGAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:57.751188Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.2379","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ef3ccc4fac95cbc0b0e699d9c7c7a706bffe6bb9b7cdc9a7f538a94aab543c0","sha256:86082b67c1de42f41341f9e3463191b14a7ae2ff373afe1acaec2a29d72df152"],"state_sha256":"4eed7da72abc9b46cb5036d3791919fb6afed1ada87632a850fbcc3ac3e71438"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"37udULaxbhpjbse/l4NGr4G8zkkDBlDtLZ6sGkdZoO57yIdJA3DBkP7FAdmaczRD14kGvsY5y/VZg3esVtt4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T20:24:09.938537Z","bundle_sha256":"b247d41bbd973dceb401449bcff207572e95316a526403a01e5d8e121b5f5477"}}