{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NR63FZ6OSQPLH5SS7HCMK5EONJ","short_pith_number":"pith:NR63FZ6O","canonical_record":{"source":{"id":"1905.06492","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-05-16T01:49:32Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"20579df6dcb6ec8d19fd879074b6fac3544fa82bd4970655ed9518f0e9525c91","abstract_canon_sha256":"d755b58a80c184b8bd605fec0622f52473893952faacdc10e18d411f1b65f2d7"},"schema_version":"1.0"},"canonical_sha256":"6c7db2e7ce941eb3f652f9c4c5748e6a621c59ae4cc7d3d19aa105b85aa2f36c","source":{"kind":"arxiv","id":"1905.06492","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.06492","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"arxiv_version","alias_value":"1905.06492v2","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.06492","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"pith_short_12","alias_value":"NR63FZ6OSQPL","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NR63FZ6OSQPLH5SS","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NR63FZ6O","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NR63FZ6OSQPLH5SS7HCMK5EONJ","target":"record","payload":{"canonical_record":{"source":{"id":"1905.06492","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-05-16T01:49:32Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"20579df6dcb6ec8d19fd879074b6fac3544fa82bd4970655ed9518f0e9525c91","abstract_canon_sha256":"d755b58a80c184b8bd605fec0622f52473893952faacdc10e18d411f1b65f2d7"},"schema_version":"1.0"},"canonical_sha256":"6c7db2e7ce941eb3f652f9c4c5748e6a621c59ae4cc7d3d19aa105b85aa2f36c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:56.331690Z","signature_b64":"vvTbt1ljTAOF2aSRIjgiyUe8XoJ2ZaBWNxb4qvXzB2LB7khKSbgxeflnXNbWdhzxY7pSvjnCrNqn30keOfa1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c7db2e7ce941eb3f652f9c4c5748e6a621c59ae4cc7d3d19aa105b85aa2f36c","last_reissued_at":"2026-05-17T23:45:56.331031Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:56.331031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.06492","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-17T23:45:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kr4YlcqK7GZZmpPfcmCl0A3CaphfNgezHAJoXhrBrxep3SmdJwvxWtbBx6I7cXeCYKuIabXN+Ng8NrqX4YBmAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:57:12.353264Z"},"content_sha256":"cd7af5cd4b4b8e34c777e4fecb3c443a16210168513916ce16546a3fd1abbf15","schema_version":"1.0","event_id":"sha256:cd7af5cd4b4b8e34c777e4fecb3c443a16210168513916ce16546a3fd1abbf15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NR63FZ6OSQPLH5SS7HCMK5EONJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Speeding Up Elliptic Curve Multiplication with Mixed-base Representation for Applications to SIDH Ciphers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.CR","authors_text":"Marius C. Silaghi, Wesam Eid","submitted_at":"2019-05-16T01:49:32Z","abstract_excerpt":"Elliptic curve multiplications can be improved by replacing the standard ladder algorithm's base 2 representation of the scalar multiplicand, with mixed-base representations with power-of-2 bases, processing the n bits of the current digit in one optimized step. For this purpose, we also present a new methodology to compute, for Weierstrass form elliptic curves in the affine plane, operations of the type mP+nQ where m and n are small integers. This provides implementations with the lower cost than previous algorithms, using only one inversion. In particular, the proposed techniques enable more"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.06492","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-17T23:45:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Spba+G+SvcIWPT/d5zTsdzmlKD7vZfA0xGw6dYfS6xm7AIIqcFBRjnzm90dFsnQdzSLi/VSY3UwpRmLA3WVZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:57:12.353984Z"},"content_sha256":"346da69e1801761224ecfacfedf07ab958173bb3a645183bff9dbb444cd3f34b","schema_version":"1.0","event_id":"sha256:346da69e1801761224ecfacfedf07ab958173bb3a645183bff9dbb444cd3f34b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NR63FZ6OSQPLH5SS7HCMK5EONJ/bundle.json","state_url":"https://pith.science/pith/NR63FZ6OSQPLH5SS7HCMK5EONJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NR63FZ6OSQPLH5SS7HCMK5EONJ/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-11T03:57:12Z","links":{"resolver":"https://pith.science/pith/NR63FZ6OSQPLH5SS7HCMK5EONJ","bundle":"https://pith.science/pith/NR63FZ6OSQPLH5SS7HCMK5EONJ/bundle.json","state":"https://pith.science/pith/NR63FZ6OSQPLH5SS7HCMK5EONJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NR63FZ6OSQPLH5SS7HCMK5EONJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NR63FZ6OSQPLH5SS7HCMK5EONJ","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":"d755b58a80c184b8bd605fec0622f52473893952faacdc10e18d411f1b65f2d7","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-05-16T01:49:32Z","title_canon_sha256":"20579df6dcb6ec8d19fd879074b6fac3544fa82bd4970655ed9518f0e9525c91"},"schema_version":"1.0","source":{"id":"1905.06492","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.06492","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"arxiv_version","alias_value":"1905.06492v2","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.06492","created_at":"2026-05-17T23:45:56Z"},{"alias_kind":"pith_short_12","alias_value":"NR63FZ6OSQPL","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NR63FZ6OSQPLH5SS","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NR63FZ6O","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:346da69e1801761224ecfacfedf07ab958173bb3a645183bff9dbb444cd3f34b","target":"graph","created_at":"2026-05-17T23:45:56Z","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":"Elliptic curve multiplications can be improved by replacing the standard ladder algorithm's base 2 representation of the scalar multiplicand, with mixed-base representations with power-of-2 bases, processing the n bits of the current digit in one optimized step. For this purpose, we also present a new methodology to compute, for Weierstrass form elliptic curves in the affine plane, operations of the type mP+nQ where m and n are small integers. This provides implementations with the lower cost than previous algorithms, using only one inversion. In particular, the proposed techniques enable more","authors_text":"Marius C. Silaghi, Wesam Eid","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-05-16T01:49:32Z","title":"Speeding Up Elliptic Curve Multiplication with Mixed-base Representation for Applications to SIDH Ciphers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.06492","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:cd7af5cd4b4b8e34c777e4fecb3c443a16210168513916ce16546a3fd1abbf15","target":"record","created_at":"2026-05-17T23:45:56Z","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":"d755b58a80c184b8bd605fec0622f52473893952faacdc10e18d411f1b65f2d7","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2019-05-16T01:49:32Z","title_canon_sha256":"20579df6dcb6ec8d19fd879074b6fac3544fa82bd4970655ed9518f0e9525c91"},"schema_version":"1.0","source":{"id":"1905.06492","kind":"arxiv","version":2}},"canonical_sha256":"6c7db2e7ce941eb3f652f9c4c5748e6a621c59ae4cc7d3d19aa105b85aa2f36c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c7db2e7ce941eb3f652f9c4c5748e6a621c59ae4cc7d3d19aa105b85aa2f36c","first_computed_at":"2026-05-17T23:45:56.331031Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:56.331031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vvTbt1ljTAOF2aSRIjgiyUe8XoJ2ZaBWNxb4qvXzB2LB7khKSbgxeflnXNbWdhzxY7pSvjnCrNqn30keOfa1Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:56.331690Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.06492","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd7af5cd4b4b8e34c777e4fecb3c443a16210168513916ce16546a3fd1abbf15","sha256:346da69e1801761224ecfacfedf07ab958173bb3a645183bff9dbb444cd3f34b"],"state_sha256":"fc5ada4e9f0896c3bf1a49e2fa395015aa34246d76a4f1ff3c81371efe42f890"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E8aIzhx7AwknL5kr5+vm6qvnBpygpTwu/XPSPDaJIh9Mqn5Ih42kcHlvfiXYOi5F5A+tw5IrczV0yiYa92nzCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T03:57:12.357669Z","bundle_sha256":"6a780163b83ed70f25fabc4e8473414622999587f663d58f13da1913731a88da"}}