{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OPGYWH7SHFT43UDNL4KO2UILYY","short_pith_number":"pith:OPGYWH7S","canonical_record":{"source":{"id":"1608.04219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2016-08-15T09:44:29Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3cdfd3c849f018f5f4ff38a33aedd0fb866904280459fcda5feccee101955bf6","abstract_canon_sha256":"f6caec0f3b4b9f999f59bd3c7099b0f55bd5493e1f854cd01cea00018028513f"},"schema_version":"1.0"},"canonical_sha256":"73cd8b1ff23967cdd06d5f14ed510bc602836c905ee91e37beeac350450f6987","source":{"kind":"arxiv","id":"1608.04219","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04219","created_at":"2026-05-18T00:50:52Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04219v1","created_at":"2026-05-18T00:50:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04219","created_at":"2026-05-18T00:50:52Z"},{"alias_kind":"pith_short_12","alias_value":"OPGYWH7SHFT4","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OPGYWH7SHFT43UDN","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OPGYWH7S","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OPGYWH7SHFT43UDNL4KO2UILYY","target":"record","payload":{"canonical_record":{"source":{"id":"1608.04219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2016-08-15T09:44:29Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3cdfd3c849f018f5f4ff38a33aedd0fb866904280459fcda5feccee101955bf6","abstract_canon_sha256":"f6caec0f3b4b9f999f59bd3c7099b0f55bd5493e1f854cd01cea00018028513f"},"schema_version":"1.0"},"canonical_sha256":"73cd8b1ff23967cdd06d5f14ed510bc602836c905ee91e37beeac350450f6987","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:52.104100Z","signature_b64":"x+0wO8NH8sWJp2IYE2aK85xfss64HAgU4D/gKfY5bBh7zj3lCGCIzCQ3SE4v3baur8MtUSVxWESCkIAiFQqYDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73cd8b1ff23967cdd06d5f14ed510bc602836c905ee91e37beeac350450f6987","last_reissued_at":"2026-05-18T00:50:52.103552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:52.103552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.04219","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-18T00:50:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8tezgGZF/y0jK5cEDzr0oYHa5AkkmJ6qI2JpK9kvBWV1+Nh64CTtnJUEICvF+/qFHE63TcZxRaJLcXbx/vMXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:29:56.750290Z"},"content_sha256":"a31b8b715c9e963ded3289e866b7d37a7df864eeebce1b14944e8a985bee8135","schema_version":"1.0","event_id":"sha256:a31b8b715c9e963ded3289e866b7d37a7df864eeebce1b14944e8a985bee8135"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OPGYWH7SHFT43UDNL4KO2UILYY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using Machine Learning to Decide When to Precondition Cylindrical Algebraic Decomposition With Groebner Bases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SC","authors_text":"James H. Davenport, Lawrence C. Paulson, Matthew England, Zongyan Huang","submitted_at":"2016-08-15T09:44:29Z","abstract_excerpt":"Cylindrical Algebraic Decomposition (CAD) is a key tool in computational algebraic geometry, particularly for quantifier elimination over real-closed fields. However, it can be expensive, with worst case complexity doubly exponential in the size of the input. Hence it is important to formulate the problem in the best manner for the CAD algorithm. One possibility is to precondition the input polynomials using Groebner Basis (GB) theory. Previous experiments have shown that while this can often be very beneficial to the CAD algorithm, for some problems it can significantly worsen the CAD perform"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04219","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-18T00:50:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R2XhSnjWsz/YNjOdS+pGRW6IclusvlT3X7AcMyYPrT2kh9v/2f+tFOYj1iWaCBRAzB1AYDX0vSps8o1FhlZiCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:29:56.750664Z"},"content_sha256":"c3bc9e499f07a14f45ebfd84164dc6fab5bcede5e144f9737a51be55b163248c","schema_version":"1.0","event_id":"sha256:c3bc9e499f07a14f45ebfd84164dc6fab5bcede5e144f9737a51be55b163248c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OPGYWH7SHFT43UDNL4KO2UILYY/bundle.json","state_url":"https://pith.science/pith/OPGYWH7SHFT43UDNL4KO2UILYY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OPGYWH7SHFT43UDNL4KO2UILYY/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-01T20:29:56Z","links":{"resolver":"https://pith.science/pith/OPGYWH7SHFT43UDNL4KO2UILYY","bundle":"https://pith.science/pith/OPGYWH7SHFT43UDNL4KO2UILYY/bundle.json","state":"https://pith.science/pith/OPGYWH7SHFT43UDNL4KO2UILYY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OPGYWH7SHFT43UDNL4KO2UILYY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OPGYWH7SHFT43UDNL4KO2UILYY","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":"f6caec0f3b4b9f999f59bd3c7099b0f55bd5493e1f854cd01cea00018028513f","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2016-08-15T09:44:29Z","title_canon_sha256":"3cdfd3c849f018f5f4ff38a33aedd0fb866904280459fcda5feccee101955bf6"},"schema_version":"1.0","source":{"id":"1608.04219","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04219","created_at":"2026-05-18T00:50:52Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04219v1","created_at":"2026-05-18T00:50:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04219","created_at":"2026-05-18T00:50:52Z"},{"alias_kind":"pith_short_12","alias_value":"OPGYWH7SHFT4","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OPGYWH7SHFT43UDN","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OPGYWH7S","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:c3bc9e499f07a14f45ebfd84164dc6fab5bcede5e144f9737a51be55b163248c","target":"graph","created_at":"2026-05-18T00:50:52Z","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":"Cylindrical Algebraic Decomposition (CAD) is a key tool in computational algebraic geometry, particularly for quantifier elimination over real-closed fields. However, it can be expensive, with worst case complexity doubly exponential in the size of the input. Hence it is important to formulate the problem in the best manner for the CAD algorithm. One possibility is to precondition the input polynomials using Groebner Basis (GB) theory. Previous experiments have shown that while this can often be very beneficial to the CAD algorithm, for some problems it can significantly worsen the CAD perform","authors_text":"James H. Davenport, Lawrence C. Paulson, Matthew England, Zongyan Huang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2016-08-15T09:44:29Z","title":"Using Machine Learning to Decide When to Precondition Cylindrical Algebraic Decomposition With Groebner Bases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04219","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:a31b8b715c9e963ded3289e866b7d37a7df864eeebce1b14944e8a985bee8135","target":"record","created_at":"2026-05-18T00:50:52Z","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":"f6caec0f3b4b9f999f59bd3c7099b0f55bd5493e1f854cd01cea00018028513f","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2016-08-15T09:44:29Z","title_canon_sha256":"3cdfd3c849f018f5f4ff38a33aedd0fb866904280459fcda5feccee101955bf6"},"schema_version":"1.0","source":{"id":"1608.04219","kind":"arxiv","version":1}},"canonical_sha256":"73cd8b1ff23967cdd06d5f14ed510bc602836c905ee91e37beeac350450f6987","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73cd8b1ff23967cdd06d5f14ed510bc602836c905ee91e37beeac350450f6987","first_computed_at":"2026-05-18T00:50:52.103552Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:52.103552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x+0wO8NH8sWJp2IYE2aK85xfss64HAgU4D/gKfY5bBh7zj3lCGCIzCQ3SE4v3baur8MtUSVxWESCkIAiFQqYDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:52.104100Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.04219","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a31b8b715c9e963ded3289e866b7d37a7df864eeebce1b14944e8a985bee8135","sha256:c3bc9e499f07a14f45ebfd84164dc6fab5bcede5e144f9737a51be55b163248c"],"state_sha256":"998b8ed4ef96c3cb74946f74806cebb4a8e380907b9d8c1d59527a6059f645a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WQsvbXtvr25bGJL1hHzB9E+MPx0utOHtUqofEebXQfxTTPvh5enOu/nzos5PApHkvSO6vVi9Zs+0FLLmSjqSBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:29:56.752695Z","bundle_sha256":"421fd87ab2346363963858d5a56dbf590629f3cb3aab67b7e9bdc94c9a2d319a"}}