{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:T57M3PWPP2I7WUZ4NGLOGDVFS7","short_pith_number":"pith:T57M3PWP","canonical_record":{"source":{"id":"2502.13065","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CR","submitted_at":"2025-02-18T17:08:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1988cf74d5e8fa2873207436068448413ca6614db52207662f3aa07f5d01af1d","abstract_canon_sha256":"a4b14c39a236b241e179107f702f96bb45a65454dcc0189c6030c50a09eefc90"},"schema_version":"1.0"},"canonical_sha256":"9f7ecdbecf7e91fb533c6996e30ea597c45d0c92170b421e147747a0263cd696","source":{"kind":"arxiv","id":"2502.13065","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.13065","created_at":"2026-07-05T10:52:19Z"},{"alias_kind":"arxiv_version","alias_value":"2502.13065v2","created_at":"2026-07-05T10:52:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.13065","created_at":"2026-07-05T10:52:19Z"},{"alias_kind":"pith_short_12","alias_value":"T57M3PWPP2I7","created_at":"2026-07-05T10:52:19Z"},{"alias_kind":"pith_short_16","alias_value":"T57M3PWPP2I7WUZ4","created_at":"2026-07-05T10:52:19Z"},{"alias_kind":"pith_short_8","alias_value":"T57M3PWP","created_at":"2026-07-05T10:52:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:T57M3PWPP2I7WUZ4NGLOGDVFS7","target":"record","payload":{"canonical_record":{"source":{"id":"2502.13065","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CR","submitted_at":"2025-02-18T17:08:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1988cf74d5e8fa2873207436068448413ca6614db52207662f3aa07f5d01af1d","abstract_canon_sha256":"a4b14c39a236b241e179107f702f96bb45a65454dcc0189c6030c50a09eefc90"},"schema_version":"1.0"},"canonical_sha256":"9f7ecdbecf7e91fb533c6996e30ea597c45d0c92170b421e147747a0263cd696","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:52:19.800391Z","signature_b64":"h09iI/zWqLANveUx2V8wnh3/2ek1k1cmjPXXDEPyjk+CW74dESfhLmmO7Gtgkv2OXi4eBeVWOIFm7KQEoc4XCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f7ecdbecf7e91fb533c6996e30ea597c45d0c92170b421e147747a0263cd696","last_reissued_at":"2026-07-05T10:52:19.799933Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:52:19.799933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.13065","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-07-05T10:52:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FybpAoUcpbP7hvolEd6+1CLWUmgyRYCy+WZKS13IaKJiAgu5R3vmswBPEQv89c/0gofziLllxEwiU4RuAWmbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T10:11:46.435251Z"},"content_sha256":"e901da49cbeac7128ec8ad39576330ff6444eaca8a22490ff17ab298de63a379","schema_version":"1.0","event_id":"sha256:e901da49cbeac7128ec8ad39576330ff6444eaca8a22490ff17ab298de63a379"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:T57M3PWPP2I7WUZ4NGLOGDVFS7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving Algorithmic Efficiency using Cryptography","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CR","authors_text":"Or Zamir, Vinod Vaikuntanathan","submitted_at":"2025-02-18T17:08:59Z","abstract_excerpt":"Cryptographic primitives have been used for various non-cryptographic objectives, such as eliminating or reducing randomness and interaction. We show how to use cryptography to improve the time complexity of solving computational problems. Specifically, we show that under standard cryptographic assumptions, we can design algorithms that are asymptotically faster than existing ones while maintaining correctness. As a concrete demonstration, we construct a distribution of trapdoored matrices with the following properties: (a) computationally bounded adversaries cannot distinguish a random matrix"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.13065","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.13065/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T10:52:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uMF91SYsWgxHanydJX1eCDfz2/kaRwqCiTEwF1IqderPaAY5bdHvaOMkhBZ9J/ItHZhnskrzfndwKPkr3hqhAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T10:11:46.435831Z"},"content_sha256":"c332d8417777168c92d3f044d31f287eb33e7be732ec210fc176eaf8359eda59","schema_version":"1.0","event_id":"sha256:c332d8417777168c92d3f044d31f287eb33e7be732ec210fc176eaf8359eda59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T57M3PWPP2I7WUZ4NGLOGDVFS7/bundle.json","state_url":"https://pith.science/pith/T57M3PWPP2I7WUZ4NGLOGDVFS7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T57M3PWPP2I7WUZ4NGLOGDVFS7/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-08-07T10:11:46Z","links":{"resolver":"https://pith.science/pith/T57M3PWPP2I7WUZ4NGLOGDVFS7","bundle":"https://pith.science/pith/T57M3PWPP2I7WUZ4NGLOGDVFS7/bundle.json","state":"https://pith.science/pith/T57M3PWPP2I7WUZ4NGLOGDVFS7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T57M3PWPP2I7WUZ4NGLOGDVFS7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:T57M3PWPP2I7WUZ4NGLOGDVFS7","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":"a4b14c39a236b241e179107f702f96bb45a65454dcc0189c6030c50a09eefc90","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CR","submitted_at":"2025-02-18T17:08:59Z","title_canon_sha256":"1988cf74d5e8fa2873207436068448413ca6614db52207662f3aa07f5d01af1d"},"schema_version":"1.0","source":{"id":"2502.13065","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.13065","created_at":"2026-07-05T10:52:19Z"},{"alias_kind":"arxiv_version","alias_value":"2502.13065v2","created_at":"2026-07-05T10:52:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.13065","created_at":"2026-07-05T10:52:19Z"},{"alias_kind":"pith_short_12","alias_value":"T57M3PWPP2I7","created_at":"2026-07-05T10:52:19Z"},{"alias_kind":"pith_short_16","alias_value":"T57M3PWPP2I7WUZ4","created_at":"2026-07-05T10:52:19Z"},{"alias_kind":"pith_short_8","alias_value":"T57M3PWP","created_at":"2026-07-05T10:52:19Z"}],"graph_snapshots":[{"event_id":"sha256:c332d8417777168c92d3f044d31f287eb33e7be732ec210fc176eaf8359eda59","target":"graph","created_at":"2026-07-05T10:52:19Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.13065/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Cryptographic primitives have been used for various non-cryptographic objectives, such as eliminating or reducing randomness and interaction. We show how to use cryptography to improve the time complexity of solving computational problems. Specifically, we show that under standard cryptographic assumptions, we can design algorithms that are asymptotically faster than existing ones while maintaining correctness. As a concrete demonstration, we construct a distribution of trapdoored matrices with the following properties: (a) computationally bounded adversaries cannot distinguish a random matrix","authors_text":"Or Zamir, Vinod Vaikuntanathan","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CR","submitted_at":"2025-02-18T17:08:59Z","title":"Improving Algorithmic Efficiency using Cryptography"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.13065","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:e901da49cbeac7128ec8ad39576330ff6444eaca8a22490ff17ab298de63a379","target":"record","created_at":"2026-07-05T10:52:19Z","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":"a4b14c39a236b241e179107f702f96bb45a65454dcc0189c6030c50a09eefc90","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CR","submitted_at":"2025-02-18T17:08:59Z","title_canon_sha256":"1988cf74d5e8fa2873207436068448413ca6614db52207662f3aa07f5d01af1d"},"schema_version":"1.0","source":{"id":"2502.13065","kind":"arxiv","version":2}},"canonical_sha256":"9f7ecdbecf7e91fb533c6996e30ea597c45d0c92170b421e147747a0263cd696","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f7ecdbecf7e91fb533c6996e30ea597c45d0c92170b421e147747a0263cd696","first_computed_at":"2026-07-05T10:52:19.799933Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:52:19.799933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h09iI/zWqLANveUx2V8wnh3/2ek1k1cmjPXXDEPyjk+CW74dESfhLmmO7Gtgkv2OXi4eBeVWOIFm7KQEoc4XCA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:52:19.800391Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.13065","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e901da49cbeac7128ec8ad39576330ff6444eaca8a22490ff17ab298de63a379","sha256:c332d8417777168c92d3f044d31f287eb33e7be732ec210fc176eaf8359eda59"],"state_sha256":"d8b21836bf51fb81ce9065ea125ed219da326c997241d471a4a92e0bb7ae04f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K3ENIeI5WmKKEVjErmVtrrBpDKYUdgx0M9tRY/BO/eQGe0yu8/bZKD+FxhqIk3ypd2E5myFuYMG45o4YFzK/Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T10:11:46.440654Z","bundle_sha256":"d4687008b16e9e581c63945627c9c75f5978fa349f5d2d5b66e3c4ff4cf2b230"}}