{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OYYVONOB5XD47JOY4PQ7H2VRSJ","short_pith_number":"pith:OYYVONOB","canonical_record":{"source":{"id":"1612.07786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2016-12-22T20:46:42Z","cross_cats_sorted":[],"title_canon_sha256":"4be66e1e7aebec3eb4e895ad3bbbd74a9ecbe301ef4d3cfbf46c4a4e8dab5de4","abstract_canon_sha256":"46a6531b154aac37ae07a833edc2986368a4ff401b174db90ed18ff7314717d9"},"schema_version":"1.0"},"canonical_sha256":"76315735c1edc7cfa5d8e3e1f3eab192725f1a053166e218404477da11112a74","source":{"kind":"arxiv","id":"1612.07786","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07786","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07786v1","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07786","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"pith_short_12","alias_value":"OYYVONOB5XD4","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OYYVONOB5XD47JOY","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OYYVONOB","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OYYVONOB5XD47JOY4PQ7H2VRSJ","target":"record","payload":{"canonical_record":{"source":{"id":"1612.07786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2016-12-22T20:46:42Z","cross_cats_sorted":[],"title_canon_sha256":"4be66e1e7aebec3eb4e895ad3bbbd74a9ecbe301ef4d3cfbf46c4a4e8dab5de4","abstract_canon_sha256":"46a6531b154aac37ae07a833edc2986368a4ff401b174db90ed18ff7314717d9"},"schema_version":"1.0"},"canonical_sha256":"76315735c1edc7cfa5d8e3e1f3eab192725f1a053166e218404477da11112a74","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:09.362920Z","signature_b64":"aa4OBRrY6oTf67TEORN6gP3j+lrFU3N+lVQ1XL+DAk65JoP1Alw059oXbZCnTm4/VkK40PJKwPbv9PkiTcQzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76315735c1edc7cfa5d8e3e1f3eab192725f1a053166e218404477da11112a74","last_reissued_at":"2026-05-18T00:54:09.362513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:09.362513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.07786","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:54:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GQDS+AaAeYnU85zhZIByeXiMQyJLbtX8/v9GSPjfWf5RYb6wllgHRsgvkoVlKXM5L8g+Qs0Ya7qAaR/MlSCkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:43:05.480153Z"},"content_sha256":"66d5a122113c36fc5a0045262d091b7a9f648f256bd9ca21c32d1dd8ff76784c","schema_version":"1.0","event_id":"sha256:66d5a122113c36fc5a0045262d091b7a9f648f256bd9ca21c32d1dd8ff76784c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OYYVONOB5XD47JOY4PQ7H2VRSJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the bit complexity of polynomial system solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Guillermo Matera, Nardo Gimenez","submitted_at":"2016-12-22T20:46:42Z","abstract_excerpt":"We exhibit a probabilistic algorithm which solves a polynomial system over the rationals defined by a reduced regular sequence. Its bit complexity is roughly quadratic in the B\\'ezout number of the system and linear in its bit size. Our algorithm solves the input system modulo a prime number p and applies p-adic lifting. For this purpose, we establish a number of results on the bit length of a \"lucky\" prime p, namely one for which the reduction of the input system modulo p preserves certain fundamental geometric and algebraic properties of the original system. These results rely on the analysi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07786","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:54:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rl8d75wVp3ddYOUAzEJypm6xazCGzBu4yqFmeoYHkfb2MhhDF1VkfIlmqrgOn5Rz3yk9swZHG/KResT82HoTAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T05:43:05.480712Z"},"content_sha256":"5f401395ab5b49b21ea201b1a8bb8d6c66cdcbaf2863b274a52cf382a8fb662b","schema_version":"1.0","event_id":"sha256:5f401395ab5b49b21ea201b1a8bb8d6c66cdcbaf2863b274a52cf382a8fb662b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OYYVONOB5XD47JOY4PQ7H2VRSJ/bundle.json","state_url":"https://pith.science/pith/OYYVONOB5XD47JOY4PQ7H2VRSJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OYYVONOB5XD47JOY4PQ7H2VRSJ/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-24T05:43:05Z","links":{"resolver":"https://pith.science/pith/OYYVONOB5XD47JOY4PQ7H2VRSJ","bundle":"https://pith.science/pith/OYYVONOB5XD47JOY4PQ7H2VRSJ/bundle.json","state":"https://pith.science/pith/OYYVONOB5XD47JOY4PQ7H2VRSJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OYYVONOB5XD47JOY4PQ7H2VRSJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OYYVONOB5XD47JOY4PQ7H2VRSJ","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":"46a6531b154aac37ae07a833edc2986368a4ff401b174db90ed18ff7314717d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2016-12-22T20:46:42Z","title_canon_sha256":"4be66e1e7aebec3eb4e895ad3bbbd74a9ecbe301ef4d3cfbf46c4a4e8dab5de4"},"schema_version":"1.0","source":{"id":"1612.07786","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07786","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07786v1","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07786","created_at":"2026-05-18T00:54:09Z"},{"alias_kind":"pith_short_12","alias_value":"OYYVONOB5XD4","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OYYVONOB5XD47JOY","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OYYVONOB","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:5f401395ab5b49b21ea201b1a8bb8d6c66cdcbaf2863b274a52cf382a8fb662b","target":"graph","created_at":"2026-05-18T00:54:09Z","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":"We exhibit a probabilistic algorithm which solves a polynomial system over the rationals defined by a reduced regular sequence. Its bit complexity is roughly quadratic in the B\\'ezout number of the system and linear in its bit size. Our algorithm solves the input system modulo a prime number p and applies p-adic lifting. For this purpose, we establish a number of results on the bit length of a \"lucky\" prime p, namely one for which the reduction of the input system modulo p preserves certain fundamental geometric and algebraic properties of the original system. These results rely on the analysi","authors_text":"Guillermo Matera, Nardo Gimenez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2016-12-22T20:46:42Z","title":"On the bit complexity of polynomial system solving"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07786","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:66d5a122113c36fc5a0045262d091b7a9f648f256bd9ca21c32d1dd8ff76784c","target":"record","created_at":"2026-05-18T00:54:09Z","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":"46a6531b154aac37ae07a833edc2986368a4ff401b174db90ed18ff7314717d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2016-12-22T20:46:42Z","title_canon_sha256":"4be66e1e7aebec3eb4e895ad3bbbd74a9ecbe301ef4d3cfbf46c4a4e8dab5de4"},"schema_version":"1.0","source":{"id":"1612.07786","kind":"arxiv","version":1}},"canonical_sha256":"76315735c1edc7cfa5d8e3e1f3eab192725f1a053166e218404477da11112a74","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76315735c1edc7cfa5d8e3e1f3eab192725f1a053166e218404477da11112a74","first_computed_at":"2026-05-18T00:54:09.362513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:09.362513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aa4OBRrY6oTf67TEORN6gP3j+lrFU3N+lVQ1XL+DAk65JoP1Alw059oXbZCnTm4/VkK40PJKwPbv9PkiTcQzCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:09.362920Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.07786","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66d5a122113c36fc5a0045262d091b7a9f648f256bd9ca21c32d1dd8ff76784c","sha256:5f401395ab5b49b21ea201b1a8bb8d6c66cdcbaf2863b274a52cf382a8fb662b"],"state_sha256":"34a2755d870e7339d8d4e3ba6d05972cbf3709b88e339d4bc7c2fea958c14b82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Vyw2Bdk4lDbNrC9KhwB1C6BMqGjNFS7M3XBh5s0S9lrh1GQaP24fyW9PmkT6YRNbwN1UY/SgVo8gamcGjIyAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T05:43:05.482640Z","bundle_sha256":"b7c1ecb2fd611326bedc645f969d7ecfb94c8b3010c4d80b430f45b7161c610e"}}