{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PBHO5R7EMP2F3ZOBCTZ72J4GIE","short_pith_number":"pith:PBHO5R7E","canonical_record":{"source":{"id":"1303.7082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2013-03-28T10:24:30Z","cross_cats_sorted":[],"title_canon_sha256":"ffccb6c958565340ed46eb6f433ea5d0b35a1710e0875ffd26b6ab8d9dacdf3e","abstract_canon_sha256":"c85a70e13ba7c3e8bec07c83dded0d62da983bcbb3773485aff10fbb7e1e1c7c"},"schema_version":"1.0"},"canonical_sha256":"784eeec7e463f45de5c114f3fd2786411655d83ce394d450ded7fabff13a93c4","source":{"kind":"arxiv","id":"1303.7082","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.7082","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"arxiv_version","alias_value":"1303.7082v1","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.7082","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"pith_short_12","alias_value":"PBHO5R7EMP2F","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PBHO5R7EMP2F3ZOB","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PBHO5R7E","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PBHO5R7EMP2F3ZOBCTZ72J4GIE","target":"record","payload":{"canonical_record":{"source":{"id":"1303.7082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2013-03-28T10:24:30Z","cross_cats_sorted":[],"title_canon_sha256":"ffccb6c958565340ed46eb6f433ea5d0b35a1710e0875ffd26b6ab8d9dacdf3e","abstract_canon_sha256":"c85a70e13ba7c3e8bec07c83dded0d62da983bcbb3773485aff10fbb7e1e1c7c"},"schema_version":"1.0"},"canonical_sha256":"784eeec7e463f45de5c114f3fd2786411655d83ce394d450ded7fabff13a93c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:38.280227Z","signature_b64":"snM9Tylg/c5LazddjMUXXuCBewwciznONmGZwo3EDFZxIh6xzACFtz3ouVrQ7WC2T1QnisiALwhi0aqd345iDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"784eeec7e463f45de5c114f3fd2786411655d83ce394d450ded7fabff13a93c4","last_reissued_at":"2026-05-18T03:29:38.279676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:38.279676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.7082","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:29:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A/LZ4XwyDLdXcIAwBr4/xJtC67wG7TGCSpsufBpr0hkH/LPOqIQMNrcZ7N1Zwsr2HoWarR8/egKHQI0IHkvXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:59:37.650966Z"},"content_sha256":"1f247456ae97f170f365231bda780d88483474fb7c657f3541c1ac53ef68dd45","schema_version":"1.0","event_id":"sha256:1f247456ae97f170f365231bda780d88483474fb7c657f3541c1ac53ef68dd45"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PBHO5R7EMP2F3ZOBCTZ72J4GIE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Alexis Bonnecaze, Mila Tukumuli, St\\'ephane Ballet","submitted_at":"2013-03-28T10:24:30Z","abstract_excerpt":"We indicate a strategy in order to construct bilinear multiplication algorithms of type Chudnovsky in large extensions of any finite field. In particular, by using the symmetric version of the generalization of Randriambololona specialized on the elliptic curves, we show that it is possible to construct such algorithms with low bilinear complexity. More precisely, if we only consider the Chudnovsky-type algorithms of type symmetric elliptic, we show that the symmetric bilinear complexity of these algorithms is in $O(n(2q)^{\\log_q^*(n)})$ where $n$ corresponds to the extension degree, and $\\log"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.7082","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:29:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k20ayTX9QDhqXDY7OcPOjZQl5CqKSJXzbjBlnFwhnhWbh4pxLm8spAsjh9NWOUczm3sDBUnA8momCc5kFHNXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:59:37.651551Z"},"content_sha256":"782400926a4501d845bbfa78e1cc23377767a042a907707b206aaa267c1bd986","schema_version":"1.0","event_id":"sha256:782400926a4501d845bbfa78e1cc23377767a042a907707b206aaa267c1bd986"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PBHO5R7EMP2F3ZOBCTZ72J4GIE/bundle.json","state_url":"https://pith.science/pith/PBHO5R7EMP2F3ZOBCTZ72J4GIE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PBHO5R7EMP2F3ZOBCTZ72J4GIE/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-22T13:59:37Z","links":{"resolver":"https://pith.science/pith/PBHO5R7EMP2F3ZOBCTZ72J4GIE","bundle":"https://pith.science/pith/PBHO5R7EMP2F3ZOBCTZ72J4GIE/bundle.json","state":"https://pith.science/pith/PBHO5R7EMP2F3ZOBCTZ72J4GIE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PBHO5R7EMP2F3ZOBCTZ72J4GIE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PBHO5R7EMP2F3ZOBCTZ72J4GIE","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":"c85a70e13ba7c3e8bec07c83dded0d62da983bcbb3773485aff10fbb7e1e1c7c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2013-03-28T10:24:30Z","title_canon_sha256":"ffccb6c958565340ed46eb6f433ea5d0b35a1710e0875ffd26b6ab8d9dacdf3e"},"schema_version":"1.0","source":{"id":"1303.7082","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.7082","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"arxiv_version","alias_value":"1303.7082v1","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.7082","created_at":"2026-05-18T03:29:38Z"},{"alias_kind":"pith_short_12","alias_value":"PBHO5R7EMP2F","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PBHO5R7EMP2F3ZOB","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PBHO5R7E","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:782400926a4501d845bbfa78e1cc23377767a042a907707b206aaa267c1bd986","target":"graph","created_at":"2026-05-18T03:29:38Z","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 indicate a strategy in order to construct bilinear multiplication algorithms of type Chudnovsky in large extensions of any finite field. In particular, by using the symmetric version of the generalization of Randriambololona specialized on the elliptic curves, we show that it is possible to construct such algorithms with low bilinear complexity. More precisely, if we only consider the Chudnovsky-type algorithms of type symmetric elliptic, we show that the symmetric bilinear complexity of these algorithms is in $O(n(2q)^{\\log_q^*(n)})$ where $n$ corresponds to the extension degree, and $\\log","authors_text":"Alexis Bonnecaze, Mila Tukumuli, St\\'ephane Ballet","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2013-03-28T10:24:30Z","title":"On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.7082","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:1f247456ae97f170f365231bda780d88483474fb7c657f3541c1ac53ef68dd45","target":"record","created_at":"2026-05-18T03:29:38Z","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":"c85a70e13ba7c3e8bec07c83dded0d62da983bcbb3773485aff10fbb7e1e1c7c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2013-03-28T10:24:30Z","title_canon_sha256":"ffccb6c958565340ed46eb6f433ea5d0b35a1710e0875ffd26b6ab8d9dacdf3e"},"schema_version":"1.0","source":{"id":"1303.7082","kind":"arxiv","version":1}},"canonical_sha256":"784eeec7e463f45de5c114f3fd2786411655d83ce394d450ded7fabff13a93c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"784eeec7e463f45de5c114f3fd2786411655d83ce394d450ded7fabff13a93c4","first_computed_at":"2026-05-18T03:29:38.279676Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:38.279676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"snM9Tylg/c5LazddjMUXXuCBewwciznONmGZwo3EDFZxIh6xzACFtz3ouVrQ7WC2T1QnisiALwhi0aqd345iDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:38.280227Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.7082","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f247456ae97f170f365231bda780d88483474fb7c657f3541c1ac53ef68dd45","sha256:782400926a4501d845bbfa78e1cc23377767a042a907707b206aaa267c1bd986"],"state_sha256":"cb835dc5e4460cd54062160ee5aef5941806fa86263894ebf4f179e980a49950"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oe832NJ9pwPnIQTC9LeowuvtmjNQM7M3TxuywrAOK9WvOzvEyyz+zYO0xvwDP7voVjvnKr4FUvUX47HOsX3xDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T13:59:37.654196Z","bundle_sha256":"93ad32f407c7092919f9a4789bd145eed592d08d7a3514d16c3c21fd79dc7bcb"}}