{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:P6VFAP46O4DX4K55MLGDIASEKP","short_pith_number":"pith:P6VFAP46","canonical_record":{"source":{"id":"2502.17202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-02-24T14:35:56Z","cross_cats_sorted":[],"title_canon_sha256":"8bc1aa75c0e329d82ab8697fdfa3e1871303f3f3cef8fef0a4c8bdbd45028c12","abstract_canon_sha256":"b246ae0b9b381d1362fa0e04779351635a1a3e31fe122362daebad1cf30af8c1"},"schema_version":"1.0"},"canonical_sha256":"7faa503f9e77077e2bbd62cc34024453c7b0e38667ae89b2494805d7fa011b41","source":{"kind":"arxiv","id":"2502.17202","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.17202","created_at":"2026-07-05T10:19:07Z"},{"alias_kind":"arxiv_version","alias_value":"2502.17202v1","created_at":"2026-07-05T10:19:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.17202","created_at":"2026-07-05T10:19:07Z"},{"alias_kind":"pith_short_12","alias_value":"P6VFAP46O4DX","created_at":"2026-07-05T10:19:07Z"},{"alias_kind":"pith_short_16","alias_value":"P6VFAP46O4DX4K55","created_at":"2026-07-05T10:19:07Z"},{"alias_kind":"pith_short_8","alias_value":"P6VFAP46","created_at":"2026-07-05T10:19:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:P6VFAP46O4DX4K55MLGDIASEKP","target":"record","payload":{"canonical_record":{"source":{"id":"2502.17202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-02-24T14:35:56Z","cross_cats_sorted":[],"title_canon_sha256":"8bc1aa75c0e329d82ab8697fdfa3e1871303f3f3cef8fef0a4c8bdbd45028c12","abstract_canon_sha256":"b246ae0b9b381d1362fa0e04779351635a1a3e31fe122362daebad1cf30af8c1"},"schema_version":"1.0"},"canonical_sha256":"7faa503f9e77077e2bbd62cc34024453c7b0e38667ae89b2494805d7fa011b41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:19:07.133777Z","signature_b64":"ykPP6WmFXpa4ivFRTQ3H84Une4fpCCUNx+7RZsWJk8UptqCOExlvo0twcDC2ONNXu80p0BEMLD/GkznnOup2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7faa503f9e77077e2bbd62cc34024453c7b0e38667ae89b2494805d7fa011b41","last_reissued_at":"2026-07-05T10:19:07.133231Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:19:07.133231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.17202","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-07-05T10:19:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jT59naOpXoPYO2FE9f55pLV+XRm9M0JuvVvaQr7JMff0eFreBYTf99wYG6x5ZSDm2m1in7FLfcdouJil0o2OCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T09:33:03.732723Z"},"content_sha256":"9c9523d0249dcb1754f06bbef4eff7bfe0f5718853873cd36076d663be23dd8c","schema_version":"1.0","event_id":"sha256:9c9523d0249dcb1754f06bbef4eff7bfe0f5718853873cd36076d663be23dd8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:P6VFAP46O4DX4K55MLGDIASEKP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum-Safe integration of TLS in SDN networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jaime S. Buruaga, Juan P. Brito, Ruben B. M\\'endez, Vicente Martin","submitted_at":"2025-02-24T14:35:56Z","abstract_excerpt":"Shor's algorithm efficiently solves factoring and discrete logarithm problems using quantum computers, compromising all public key schemes used today. These schemes rely on assumptions on their computational complexity, which quantum computers can easily bypass. The solutions have to come from new algorithms - called Post-Quantum Cryptography (PQC) - or from new methods, such as Quantum Key Distribution (QKD). The former replicate the computational security ideas of classical public key algorithms, while the latter recurs to use the quantum properties of nature, which also brings a mathematica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.17202","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.17202/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:19:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2oGSzWoFpPPCD7UoPt2niYvbb8Ni63F+yQEyZbp5MmHoq5PpSaszZpMeCkVgMOEKXRLrSMxBjFkfS1si0E//Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T09:33:03.733253Z"},"content_sha256":"99b64952c9b8bcc181a1669f1439ac7e0fb86bddd59d147560c8d76be7810dea","schema_version":"1.0","event_id":"sha256:99b64952c9b8bcc181a1669f1439ac7e0fb86bddd59d147560c8d76be7810dea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P6VFAP46O4DX4K55MLGDIASEKP/bundle.json","state_url":"https://pith.science/pith/P6VFAP46O4DX4K55MLGDIASEKP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P6VFAP46O4DX4K55MLGDIASEKP/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-11T09:33:03Z","links":{"resolver":"https://pith.science/pith/P6VFAP46O4DX4K55MLGDIASEKP","bundle":"https://pith.science/pith/P6VFAP46O4DX4K55MLGDIASEKP/bundle.json","state":"https://pith.science/pith/P6VFAP46O4DX4K55MLGDIASEKP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P6VFAP46O4DX4K55MLGDIASEKP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:P6VFAP46O4DX4K55MLGDIASEKP","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":"b246ae0b9b381d1362fa0e04779351635a1a3e31fe122362daebad1cf30af8c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-02-24T14:35:56Z","title_canon_sha256":"8bc1aa75c0e329d82ab8697fdfa3e1871303f3f3cef8fef0a4c8bdbd45028c12"},"schema_version":"1.0","source":{"id":"2502.17202","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.17202","created_at":"2026-07-05T10:19:07Z"},{"alias_kind":"arxiv_version","alias_value":"2502.17202v1","created_at":"2026-07-05T10:19:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.17202","created_at":"2026-07-05T10:19:07Z"},{"alias_kind":"pith_short_12","alias_value":"P6VFAP46O4DX","created_at":"2026-07-05T10:19:07Z"},{"alias_kind":"pith_short_16","alias_value":"P6VFAP46O4DX4K55","created_at":"2026-07-05T10:19:07Z"},{"alias_kind":"pith_short_8","alias_value":"P6VFAP46","created_at":"2026-07-05T10:19:07Z"}],"graph_snapshots":[{"event_id":"sha256:99b64952c9b8bcc181a1669f1439ac7e0fb86bddd59d147560c8d76be7810dea","target":"graph","created_at":"2026-07-05T10:19:07Z","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.17202/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Shor's algorithm efficiently solves factoring and discrete logarithm problems using quantum computers, compromising all public key schemes used today. These schemes rely on assumptions on their computational complexity, which quantum computers can easily bypass. The solutions have to come from new algorithms - called Post-Quantum Cryptography (PQC) - or from new methods, such as Quantum Key Distribution (QKD). The former replicate the computational security ideas of classical public key algorithms, while the latter recurs to use the quantum properties of nature, which also brings a mathematica","authors_text":"Jaime S. Buruaga, Juan P. Brito, Ruben B. M\\'endez, Vicente Martin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-02-24T14:35:56Z","title":"Quantum-Safe integration of TLS in SDN networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.17202","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:9c9523d0249dcb1754f06bbef4eff7bfe0f5718853873cd36076d663be23dd8c","target":"record","created_at":"2026-07-05T10:19:07Z","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":"b246ae0b9b381d1362fa0e04779351635a1a3e31fe122362daebad1cf30af8c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-02-24T14:35:56Z","title_canon_sha256":"8bc1aa75c0e329d82ab8697fdfa3e1871303f3f3cef8fef0a4c8bdbd45028c12"},"schema_version":"1.0","source":{"id":"2502.17202","kind":"arxiv","version":1}},"canonical_sha256":"7faa503f9e77077e2bbd62cc34024453c7b0e38667ae89b2494805d7fa011b41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7faa503f9e77077e2bbd62cc34024453c7b0e38667ae89b2494805d7fa011b41","first_computed_at":"2026-07-05T10:19:07.133231Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:19:07.133231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ykPP6WmFXpa4ivFRTQ3H84Une4fpCCUNx+7RZsWJk8UptqCOExlvo0twcDC2ONNXu80p0BEMLD/GkznnOup2DA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:19:07.133777Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.17202","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c9523d0249dcb1754f06bbef4eff7bfe0f5718853873cd36076d663be23dd8c","sha256:99b64952c9b8bcc181a1669f1439ac7e0fb86bddd59d147560c8d76be7810dea"],"state_sha256":"06b9e99ce45b94b1b5ef8285cc2699dfd982ab423478461da71a2afcf8d51d74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NP852xerDw2GUqr8NmKpbFK+Y3uAFsZ3WfH4b9RpgyqFhRfRJHFZWCYbhRLUmCh4vPwERXz3LJDhBj0WbKQ9Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T09:33:03.737940Z","bundle_sha256":"58c90d659d04d6634c3b148a424ddef6b67535ba91bb89b13ae8ae06605a3fbe"}}