{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:6O37KEUFFZ3YDXEQRW53G3ZZY7","short_pith_number":"pith:6O37KEUF","canonical_record":{"source":{"id":"1010.5310","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-10-26T03:55:35Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e96a7ade79719053561f9b4ff6a435a45d5121878d16c2ec8c3f121929b70984","abstract_canon_sha256":"20038d540ae90b846469561d7d675bcf7771ab06609ed03c60f18034c0cb967b"},"schema_version":"1.0"},"canonical_sha256":"f3b7f512852e7781dc908dbbb36f39c7c6c6028f4a8ddb19a11f5cd9a3d6f45c","source":{"kind":"arxiv","id":"1010.5310","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5310","created_at":"2026-05-18T04:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5310v2","created_at":"2026-05-18T04:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5310","created_at":"2026-05-18T04:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"6O37KEUFFZ3Y","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"6O37KEUFFZ3YDXEQ","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"6O37KEUF","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:6O37KEUFFZ3YDXEQRW53G3ZZY7","target":"record","payload":{"canonical_record":{"source":{"id":"1010.5310","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-10-26T03:55:35Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e96a7ade79719053561f9b4ff6a435a45d5121878d16c2ec8c3f121929b70984","abstract_canon_sha256":"20038d540ae90b846469561d7d675bcf7771ab06609ed03c60f18034c0cb967b"},"schema_version":"1.0"},"canonical_sha256":"f3b7f512852e7781dc908dbbb36f39c7c6c6028f4a8ddb19a11f5cd9a3d6f45c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:51.042802Z","signature_b64":"PtrvkCxJbdwK4FAT/MT8Wsmi2IKV0WaHnFp5yhHPmePxGQ7VPHz/F9MhJVUgHRtSaE2ifC33gow3ggPZGriWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3b7f512852e7781dc908dbbb36f39c7c6c6028f4a8ddb19a11f5cd9a3d6f45c","last_reissued_at":"2026-05-18T04:36:51.042395Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:51.042395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.5310","source_version":2,"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-18T04:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"du61L6gxuwzy1wwXiAeGa5NwbNxnq+q/+bfOeGRfm94nlsU2tJRXGYINc2RxCYG47BNiuzFAzjamMb8K0zorAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:49:15.688751Z"},"content_sha256":"ccbe8fc8ab5161319ebbdfc34cbe50a92c5e0bebc6f28ada8708b996e51ff3a9","schema_version":"1.0","event_id":"sha256:ccbe8fc8ab5161319ebbdfc34cbe50a92c5e0bebc6f28ada8708b996e51ff3a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:6O37KEUFFZ3YDXEQRW53G3ZZY7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster p-adic Feasibility for Certain Multivariate Sparse Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.NT","authors_text":"Ashraf Ibrahim, J. Maurice Rojas, Korben Rusek, Mart\\'in Avenda\\~no","submitted_at":"2010-10-26T03:55:35Z","abstract_excerpt":"We present algorithms revealing new families of polynomials allowing sub-exponential detection of p-adic rational roots, relative to the sparse encoding. For instance, we show that the case of honest n-variate (n+1)-nomials is doable in NP and, for p exceeding the Newton polytope volume and not dividing any coefficient, in constant time. Furthermore, using the theory of linear forms in p-adic logarithms, we prove that the case of trinomials in one variable can be done in NP. The best previous complexity bounds for these problems were EXPTIME or worse. Finally, we prove that detecting p-adic ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5310","kind":"arxiv","version":2},"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-18T04:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DthUVB9RAA3xikWrbbNuvE3cYcV2UyO6PxjamKHF5qFrY8kkQsBQuzxJvfKhIwxwdgKrlVN2xiR54hUXeanmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:49:15.689580Z"},"content_sha256":"ffaf5a8c8e686f9025277b34574f1caabfc15dd0eb02672bfcb6305371f61d14","schema_version":"1.0","event_id":"sha256:ffaf5a8c8e686f9025277b34574f1caabfc15dd0eb02672bfcb6305371f61d14"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6O37KEUFFZ3YDXEQRW53G3ZZY7/bundle.json","state_url":"https://pith.science/pith/6O37KEUFFZ3YDXEQRW53G3ZZY7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6O37KEUFFZ3YDXEQRW53G3ZZY7/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-31T12:49:15Z","links":{"resolver":"https://pith.science/pith/6O37KEUFFZ3YDXEQRW53G3ZZY7","bundle":"https://pith.science/pith/6O37KEUFFZ3YDXEQRW53G3ZZY7/bundle.json","state":"https://pith.science/pith/6O37KEUFFZ3YDXEQRW53G3ZZY7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6O37KEUFFZ3YDXEQRW53G3ZZY7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:6O37KEUFFZ3YDXEQRW53G3ZZY7","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":"20038d540ae90b846469561d7d675bcf7771ab06609ed03c60f18034c0cb967b","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-10-26T03:55:35Z","title_canon_sha256":"e96a7ade79719053561f9b4ff6a435a45d5121878d16c2ec8c3f121929b70984"},"schema_version":"1.0","source":{"id":"1010.5310","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5310","created_at":"2026-05-18T04:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5310v2","created_at":"2026-05-18T04:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5310","created_at":"2026-05-18T04:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"6O37KEUFFZ3Y","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"6O37KEUFFZ3YDXEQ","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"6O37KEUF","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:ffaf5a8c8e686f9025277b34574f1caabfc15dd0eb02672bfcb6305371f61d14","target":"graph","created_at":"2026-05-18T04:36:51Z","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 present algorithms revealing new families of polynomials allowing sub-exponential detection of p-adic rational roots, relative to the sparse encoding. For instance, we show that the case of honest n-variate (n+1)-nomials is doable in NP and, for p exceeding the Newton polytope volume and not dividing any coefficient, in constant time. Furthermore, using the theory of linear forms in p-adic logarithms, we prove that the case of trinomials in one variable can be done in NP. The best previous complexity bounds for these problems were EXPTIME or worse. Finally, we prove that detecting p-adic ra","authors_text":"Ashraf Ibrahim, J. Maurice Rojas, Korben Rusek, Mart\\'in Avenda\\~no","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-10-26T03:55:35Z","title":"Faster p-adic Feasibility for Certain Multivariate Sparse Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5310","kind":"arxiv","version":2},"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:ccbe8fc8ab5161319ebbdfc34cbe50a92c5e0bebc6f28ada8708b996e51ff3a9","target":"record","created_at":"2026-05-18T04:36:51Z","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":"20038d540ae90b846469561d7d675bcf7771ab06609ed03c60f18034c0cb967b","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-10-26T03:55:35Z","title_canon_sha256":"e96a7ade79719053561f9b4ff6a435a45d5121878d16c2ec8c3f121929b70984"},"schema_version":"1.0","source":{"id":"1010.5310","kind":"arxiv","version":2}},"canonical_sha256":"f3b7f512852e7781dc908dbbb36f39c7c6c6028f4a8ddb19a11f5cd9a3d6f45c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3b7f512852e7781dc908dbbb36f39c7c6c6028f4a8ddb19a11f5cd9a3d6f45c","first_computed_at":"2026-05-18T04:36:51.042395Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:36:51.042395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PtrvkCxJbdwK4FAT/MT8Wsmi2IKV0WaHnFp5yhHPmePxGQ7VPHz/F9MhJVUgHRtSaE2ifC33gow3ggPZGriWBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:36:51.042802Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.5310","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ccbe8fc8ab5161319ebbdfc34cbe50a92c5e0bebc6f28ada8708b996e51ff3a9","sha256:ffaf5a8c8e686f9025277b34574f1caabfc15dd0eb02672bfcb6305371f61d14"],"state_sha256":"b5c59753bfc3ea6b8e28a1caf18f48b3bd5f4b8d8e0a8a0d685ca9dd50f60260"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I8rL5zEhpJLwXelxwkrpcz1gYFIdiAUWRqGSCiopFf5iSe3ILw2onfKczJIwnB8wFV3tZLX3hzRESJKeP3F8CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:49:15.694331Z","bundle_sha256":"8c993ebecd7c2c5397370e69ef4d0e04cd8a72c94791fb230ad3af1c5c5d3e68"}}