{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KDSHZ3WVZPD7ZUMGL4KGU67K32","short_pith_number":"pith:KDSHZ3WV","canonical_record":{"source":{"id":"1303.1998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-03-08T14:10:21Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"b7aaadaff4643755a9be9deb5cc1852313232dbce76a8676f5e0949c4ece6f03","abstract_canon_sha256":"0b2088f256edd8cd8ba849acd36e85d4b4f378fa955426df6b395780190b71a3"},"schema_version":"1.0"},"canonical_sha256":"50e47ceed5cbc7fcd1865f146a7beadea9375b41f572c17c943523afd1f58bcd","source":{"kind":"arxiv","id":"1303.1998","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1998","created_at":"2026-05-18T03:31:31Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1998v1","created_at":"2026-05-18T03:31:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1998","created_at":"2026-05-18T03:31:31Z"},{"alias_kind":"pith_short_12","alias_value":"KDSHZ3WVZPD7","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KDSHZ3WVZPD7ZUMG","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KDSHZ3WV","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KDSHZ3WVZPD7ZUMGL4KGU67K32","target":"record","payload":{"canonical_record":{"source":{"id":"1303.1998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-03-08T14:10:21Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"b7aaadaff4643755a9be9deb5cc1852313232dbce76a8676f5e0949c4ece6f03","abstract_canon_sha256":"0b2088f256edd8cd8ba849acd36e85d4b4f378fa955426df6b395780190b71a3"},"schema_version":"1.0"},"canonical_sha256":"50e47ceed5cbc7fcd1865f146a7beadea9375b41f572c17c943523afd1f58bcd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:31.738161Z","signature_b64":"cPgXXJnYPQSBM+GGjluEdyT5iGyKYsUoOodoARErxQ1M9J4dv1rZYw8cddLUEpUfHScZU8wCer4yNa5l470mCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50e47ceed5cbc7fcd1865f146a7beadea9375b41f572c17c943523afd1f58bcd","last_reissued_at":"2026-05-18T03:31:31.737284Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:31.737284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.1998","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-18T03:31:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YIbwkG4kWOkWIZHmfcm30gG0zVoF4TemaKXhCEucFCthuWsPMLgXQ8pYgBFA4kcaYfYn13kYMViAz4KW28agDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:02:05.120145Z"},"content_sha256":"5b1e80441ab481fe81a80b67dc68cccece610ad6adf4ad263e58392480155e5b","schema_version":"1.0","event_id":"sha256:5b1e80441ab481fe81a80b67dc68cccece610ad6adf4ad263e58392480155e5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KDSHZ3WVZPD7ZUMGL4KGU67K32","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Selecting polynomials for the Function Field Sieve","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.CR","authors_text":"Razvan Barbulescu (INRIA Nancy - Grand Est / LORIA)","submitted_at":"2013-03-08T14:10:21Z","abstract_excerpt":"The Function Field Sieve algorithm is dedicated to computing discrete logarithms in a finite field GF(q^n), where q is small an prime power. The scope of this article is to select good polynomials for this algorithm by defining and measuring the size property and the so-called root and cancellation properties. In particular we present an algorithm for rapidly testing a large set of polynomials. Our study also explains the behaviour of inseparable polynomials, in particular we give an easy way to see that the algorithm encompass the Coppersmith algorithm as a particular case."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1998","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-18T03:31:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rWAZ1pN85B+7qD4sRVRRj6GcMdCOq0WgHi8Isl0baiX3xF6KCVbeWBIWWNY8A76z6PYr+K2TUkFzLoDezmU0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:02:05.120503Z"},"content_sha256":"619ec760789d132753722b99c410eb0da4dc6ac56ccce3676def6cc7649d5f79","schema_version":"1.0","event_id":"sha256:619ec760789d132753722b99c410eb0da4dc6ac56ccce3676def6cc7649d5f79"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KDSHZ3WVZPD7ZUMGL4KGU67K32/bundle.json","state_url":"https://pith.science/pith/KDSHZ3WVZPD7ZUMGL4KGU67K32/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KDSHZ3WVZPD7ZUMGL4KGU67K32/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-27T12:02:05Z","links":{"resolver":"https://pith.science/pith/KDSHZ3WVZPD7ZUMGL4KGU67K32","bundle":"https://pith.science/pith/KDSHZ3WVZPD7ZUMGL4KGU67K32/bundle.json","state":"https://pith.science/pith/KDSHZ3WVZPD7ZUMGL4KGU67K32/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KDSHZ3WVZPD7ZUMGL4KGU67K32/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KDSHZ3WVZPD7ZUMGL4KGU67K32","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":"0b2088f256edd8cd8ba849acd36e85d4b4f378fa955426df6b395780190b71a3","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-03-08T14:10:21Z","title_canon_sha256":"b7aaadaff4643755a9be9deb5cc1852313232dbce76a8676f5e0949c4ece6f03"},"schema_version":"1.0","source":{"id":"1303.1998","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1998","created_at":"2026-05-18T03:31:31Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1998v1","created_at":"2026-05-18T03:31:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1998","created_at":"2026-05-18T03:31:31Z"},{"alias_kind":"pith_short_12","alias_value":"KDSHZ3WVZPD7","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KDSHZ3WVZPD7ZUMG","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KDSHZ3WV","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:619ec760789d132753722b99c410eb0da4dc6ac56ccce3676def6cc7649d5f79","target":"graph","created_at":"2026-05-18T03:31:31Z","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 Function Field Sieve algorithm is dedicated to computing discrete logarithms in a finite field GF(q^n), where q is small an prime power. The scope of this article is to select good polynomials for this algorithm by defining and measuring the size property and the so-called root and cancellation properties. In particular we present an algorithm for rapidly testing a large set of polynomials. Our study also explains the behaviour of inseparable polynomials, in particular we give an easy way to see that the algorithm encompass the Coppersmith algorithm as a particular case.","authors_text":"Razvan Barbulescu (INRIA Nancy - Grand Est / LORIA)","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-03-08T14:10:21Z","title":"Selecting polynomials for the Function Field Sieve"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1998","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:5b1e80441ab481fe81a80b67dc68cccece610ad6adf4ad263e58392480155e5b","target":"record","created_at":"2026-05-18T03:31:31Z","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":"0b2088f256edd8cd8ba849acd36e85d4b4f378fa955426df6b395780190b71a3","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-03-08T14:10:21Z","title_canon_sha256":"b7aaadaff4643755a9be9deb5cc1852313232dbce76a8676f5e0949c4ece6f03"},"schema_version":"1.0","source":{"id":"1303.1998","kind":"arxiv","version":1}},"canonical_sha256":"50e47ceed5cbc7fcd1865f146a7beadea9375b41f572c17c943523afd1f58bcd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50e47ceed5cbc7fcd1865f146a7beadea9375b41f572c17c943523afd1f58bcd","first_computed_at":"2026-05-18T03:31:31.737284Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:31.737284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cPgXXJnYPQSBM+GGjluEdyT5iGyKYsUoOodoARErxQ1M9J4dv1rZYw8cddLUEpUfHScZU8wCer4yNa5l470mCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:31.738161Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.1998","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b1e80441ab481fe81a80b67dc68cccece610ad6adf4ad263e58392480155e5b","sha256:619ec760789d132753722b99c410eb0da4dc6ac56ccce3676def6cc7649d5f79"],"state_sha256":"5fcb3988c7353197ead292adc8457e6de0518b7b122504f0c9d359c41d10c206"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MrYOQgIFFrbqGflbegKGbq4wrFecaGGRXb9n98C7dZ8pUAY2FdebyMIdZ6zAJcjauzv57eNim+hNIiExPewiCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T12:02:05.122341Z","bundle_sha256":"9cd5e7136ae9c79077800df2c2a18487cf8bd00cc635a3e751eb22bfa407b5e3"}}