{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Q5HVHD4UKX5367RTBH3ER6XFQ7","short_pith_number":"pith:Q5HVHD4U","schema_version":"1.0","canonical_sha256":"874f538f9455fbbf7e3309f648fae587edea3607fa7580cdd114a1378d50e562","source":{"kind":"arxiv","id":"1504.06512","version":3},"attestation_state":"computed","paper":{"title":"On the computation of rational points of a hypersurface over a finite field","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.NT","authors_text":"Guillermo Matera, Mariana P\\'erez, Melina Privitelli","submitted_at":"2015-04-24T13:57:05Z","abstract_excerpt":"We design and analyze an algorithm for computing rational points of hypersurfaces defined over a finite field based on searches on \"vertical strips\", namely searches on parallel lines in a given direction. Our results show that, on average, less than two searches suffice to obtain a rational point. We also analyze the probability distribution of outputs, using the notion of Shannon entropy, and prove that the algorithm is somewhat close to any \"ideal\" equidistributed algorithm."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1504.06512","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-04-24T13:57:05Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"1df8a3c2e57e6fb9fb2f0aaac6f1079d386356f58b25a69f7a2243e5b3195a3d","abstract_canon_sha256":"b8d847c01ac2ed85ab4d2ad6e1944d2f026b76bb166ad1a75f6d8a85316472e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:44.420492Z","signature_b64":"6oHXas0qNIkL9CetuLK6xYA9F8D+fZXrQCMnT/v8R5ADox7KBgcqACFTb3nhQyp2z08KBA21fd7e0NQIX+dRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"874f538f9455fbbf7e3309f648fae587edea3607fa7580cdd114a1378d50e562","last_reissued_at":"2026-05-18T00:57:44.419906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:44.419906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the computation of rational points of a hypersurface over a finite field","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.NT","authors_text":"Guillermo Matera, Mariana P\\'erez, Melina Privitelli","submitted_at":"2015-04-24T13:57:05Z","abstract_excerpt":"We design and analyze an algorithm for computing rational points of hypersurfaces defined over a finite field based on searches on \"vertical strips\", namely searches on parallel lines in a given direction. Our results show that, on average, less than two searches suffice to obtain a rational point. We also analyze the probability distribution of outputs, using the notion of Shannon entropy, and prove that the algorithm is somewhat close to any \"ideal\" equidistributed algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06512","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.06512","created_at":"2026-05-18T00:57:44.419977+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.06512v3","created_at":"2026-05-18T00:57:44.419977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06512","created_at":"2026-05-18T00:57:44.419977+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q5HVHD4UKX53","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q5HVHD4UKX5367RT","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q5HVHD4U","created_at":"2026-05-18T12:29:37.295048+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q5HVHD4UKX5367RTBH3ER6XFQ7","json":"https://pith.science/pith/Q5HVHD4UKX5367RTBH3ER6XFQ7.json","graph_json":"https://pith.science/api/pith-number/Q5HVHD4UKX5367RTBH3ER6XFQ7/graph.json","events_json":"https://pith.science/api/pith-number/Q5HVHD4UKX5367RTBH3ER6XFQ7/events.json","paper":"https://pith.science/paper/Q5HVHD4U"},"agent_actions":{"view_html":"https://pith.science/pith/Q5HVHD4UKX5367RTBH3ER6XFQ7","download_json":"https://pith.science/pith/Q5HVHD4UKX5367RTBH3ER6XFQ7.json","view_paper":"https://pith.science/paper/Q5HVHD4U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.06512&json=true","fetch_graph":"https://pith.science/api/pith-number/Q5HVHD4UKX5367RTBH3ER6XFQ7/graph.json","fetch_events":"https://pith.science/api/pith-number/Q5HVHD4UKX5367RTBH3ER6XFQ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q5HVHD4UKX5367RTBH3ER6XFQ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q5HVHD4UKX5367RTBH3ER6XFQ7/action/storage_attestation","attest_author":"https://pith.science/pith/Q5HVHD4UKX5367RTBH3ER6XFQ7/action/author_attestation","sign_citation":"https://pith.science/pith/Q5HVHD4UKX5367RTBH3ER6XFQ7/action/citation_signature","submit_replication":"https://pith.science/pith/Q5HVHD4UKX5367RTBH3ER6XFQ7/action/replication_record"}},"created_at":"2026-05-18T00:57:44.419977+00:00","updated_at":"2026-05-18T00:57:44.419977+00:00"}