{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LLU5L6QETS3QGZFOGPXGZWFORD","short_pith_number":"pith:LLU5L6QE","canonical_record":{"source":{"id":"1511.06436","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2015-11-19T22:54:21Z","cross_cats_sorted":[],"title_canon_sha256":"7cbcd23966219e79e2e9fbd88289b59112d20b5312bf3527fb6711843c84128d","abstract_canon_sha256":"8be876e7479347bbd42ae4c5be1b3237f7f1fb3f99f11548b16ffdc6907d558c"},"schema_version":"1.0"},"canonical_sha256":"5ae9d5fa049cb70364ae33ee6cd8ae88fff7b0260902cff027615c359f8c4691","source":{"kind":"arxiv","id":"1511.06436","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06436","created_at":"2026-05-18T00:10:41Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06436v3","created_at":"2026-05-18T00:10:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06436","created_at":"2026-05-18T00:10:41Z"},{"alias_kind":"pith_short_12","alias_value":"LLU5L6QETS3Q","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LLU5L6QETS3QGZFO","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LLU5L6QE","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LLU5L6QETS3QGZFOGPXGZWFORD","target":"record","payload":{"canonical_record":{"source":{"id":"1511.06436","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2015-11-19T22:54:21Z","cross_cats_sorted":[],"title_canon_sha256":"7cbcd23966219e79e2e9fbd88289b59112d20b5312bf3527fb6711843c84128d","abstract_canon_sha256":"8be876e7479347bbd42ae4c5be1b3237f7f1fb3f99f11548b16ffdc6907d558c"},"schema_version":"1.0"},"canonical_sha256":"5ae9d5fa049cb70364ae33ee6cd8ae88fff7b0260902cff027615c359f8c4691","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:41.764498Z","signature_b64":"SgHahIm02qF6xQiJh+vk4OMA7C30QMNlcPjxnKqKg9oKIVP/RPj2/Ys6mIjrpToqb8zEom/HLqxUZc2wG4G8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ae9d5fa049cb70364ae33ee6cd8ae88fff7b0260902cff027615c359f8c4691","last_reissued_at":"2026-05-18T00:10:41.763883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:41.763883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.06436","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-18T00:10:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KRONCOjq/IdRY/DlY1Xk7L3m8YAlDE1J1sNRXYZb8Whe5XzXs1V7xUWzsx8tq8YQ0VRWqKCeHw5IvEe7jAc+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:25:26.593050Z"},"content_sha256":"cccc009c6d07427253baaf1632ecdff96166d09f7dcf51b7abfd82ad9f478818","schema_version":"1.0","event_id":"sha256:cccc009c6d07427253baaf1632ecdff96166d09f7dcf51b7abfd82ad9f478818"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LLU5L6QETS3QGZFOGPXGZWFORD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the robust hardness of Gr\\\"obner basis computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"David Rolnick, Gwen Spencer","submitted_at":"2015-11-19T22:54:21Z","abstract_excerpt":"The computation of Gr\\\"obner bases is an established hard problem. By contrast with many other problems, however, there has been little investigation of whether this hardness is robust. In this paper, we frame and present results on the problem of approximate computation of Gr\\\"obner bases. We show that it is NP-hard to construct a Gr\\\"obner basis of the ideal generated by a set of polynomials, even when the algorithm is allowed to discard a $(1 - \\epsilon)$ fraction of the generators, and likewise when the algorithm is allowed to discard variables (and the generators containing them). Our res"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06436","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-18T00:10:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sITFMvO3EvL2CQHvtTh1S6jaqelwVBkqTLuK6c6COYCuDU5Zww7EYoKdxKyutEGvWbla7LaCNBuAPahEGfVQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:25:26.593407Z"},"content_sha256":"3f6500d55d6c0df4c1d0e46dc29d90d9736edd61158537bef25f06fcac5c7531","schema_version":"1.0","event_id":"sha256:3f6500d55d6c0df4c1d0e46dc29d90d9736edd61158537bef25f06fcac5c7531"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LLU5L6QETS3QGZFOGPXGZWFORD/bundle.json","state_url":"https://pith.science/pith/LLU5L6QETS3QGZFOGPXGZWFORD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LLU5L6QETS3QGZFOGPXGZWFORD/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-28T07:25:26Z","links":{"resolver":"https://pith.science/pith/LLU5L6QETS3QGZFOGPXGZWFORD","bundle":"https://pith.science/pith/LLU5L6QETS3QGZFOGPXGZWFORD/bundle.json","state":"https://pith.science/pith/LLU5L6QETS3QGZFOGPXGZWFORD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LLU5L6QETS3QGZFOGPXGZWFORD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LLU5L6QETS3QGZFOGPXGZWFORD","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":"8be876e7479347bbd42ae4c5be1b3237f7f1fb3f99f11548b16ffdc6907d558c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2015-11-19T22:54:21Z","title_canon_sha256":"7cbcd23966219e79e2e9fbd88289b59112d20b5312bf3527fb6711843c84128d"},"schema_version":"1.0","source":{"id":"1511.06436","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06436","created_at":"2026-05-18T00:10:41Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06436v3","created_at":"2026-05-18T00:10:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06436","created_at":"2026-05-18T00:10:41Z"},{"alias_kind":"pith_short_12","alias_value":"LLU5L6QETS3Q","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LLU5L6QETS3QGZFO","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LLU5L6QE","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:3f6500d55d6c0df4c1d0e46dc29d90d9736edd61158537bef25f06fcac5c7531","target":"graph","created_at":"2026-05-18T00:10:41Z","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 computation of Gr\\\"obner bases is an established hard problem. By contrast with many other problems, however, there has been little investigation of whether this hardness is robust. In this paper, we frame and present results on the problem of approximate computation of Gr\\\"obner bases. We show that it is NP-hard to construct a Gr\\\"obner basis of the ideal generated by a set of polynomials, even when the algorithm is allowed to discard a $(1 - \\epsilon)$ fraction of the generators, and likewise when the algorithm is allowed to discard variables (and the generators containing them). Our res","authors_text":"David Rolnick, Gwen Spencer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2015-11-19T22:54:21Z","title":"On the robust hardness of Gr\\\"obner basis computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06436","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:cccc009c6d07427253baaf1632ecdff96166d09f7dcf51b7abfd82ad9f478818","target":"record","created_at":"2026-05-18T00:10:41Z","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":"8be876e7479347bbd42ae4c5be1b3237f7f1fb3f99f11548b16ffdc6907d558c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2015-11-19T22:54:21Z","title_canon_sha256":"7cbcd23966219e79e2e9fbd88289b59112d20b5312bf3527fb6711843c84128d"},"schema_version":"1.0","source":{"id":"1511.06436","kind":"arxiv","version":3}},"canonical_sha256":"5ae9d5fa049cb70364ae33ee6cd8ae88fff7b0260902cff027615c359f8c4691","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ae9d5fa049cb70364ae33ee6cd8ae88fff7b0260902cff027615c359f8c4691","first_computed_at":"2026-05-18T00:10:41.763883Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:41.763883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SgHahIm02qF6xQiJh+vk4OMA7C30QMNlcPjxnKqKg9oKIVP/RPj2/Ys6mIjrpToqb8zEom/HLqxUZc2wG4G8CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:41.764498Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.06436","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cccc009c6d07427253baaf1632ecdff96166d09f7dcf51b7abfd82ad9f478818","sha256:3f6500d55d6c0df4c1d0e46dc29d90d9736edd61158537bef25f06fcac5c7531"],"state_sha256":"10af19e614479f08f4be65aa128bcbe123392e2619a59424beb55677b6aaa13a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xUV0p8yugLM/8d/lWot6IKPzHP41p3Sn3DELo48vhWVPXPQq1HSZII9hBaO8mLescfyEvbKJV1D7DvvcIfHBAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:25:26.595363Z","bundle_sha256":"1723381631cb5f8f833a5d5e4edb2cebf209c98bf76f5a2d265fde1eb9c87ba8"}}