{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:VMAZ6JZOUWBKT6M7EETZ25DQI7","short_pith_number":"pith:VMAZ6JZO","schema_version":"1.0","canonical_sha256":"ab019f272ea582a9f99f21279d747047d519019546c6c4ba3bee2bf721979f48","source":{"kind":"arxiv","id":"2305.16435","version":1},"attestation_state":"computed","paper":{"title":"Composing Bridges","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CT"],"primary_cat":"cs.CR","authors_text":"George C. \\c{T}urca\\c{s}, Mugurel Barcau, Vicen\\c{t}iu Pa\\c{s}ol","submitted_at":"2023-05-25T19:20:19Z","abstract_excerpt":"The present work builds on previous investigations of the authors (and their collaborators) regarding bridges, a certain type of morphisms between encryption schemes, making a step forward in developing a (category theory) language for studying relations between encryption schemes. Here we analyse the conditions under which bridges can be performed sequentially, formalizing the notion of composability. One of our results gives a sufficient condition for a pair of bridges to be composable. We illustrate that composing two bridges, each independently satisfying a previously established IND-CPA s"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2305.16435","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2023-05-25T19:20:19Z","cross_cats_sorted":["math.CT"],"title_canon_sha256":"e812ef8ef234a7c01f260e7ceae97d23120ca256bb42a1b3d82518bbd1cb99b5","abstract_canon_sha256":"6a02516cee8aa3a87a3831c697f06af7dcc48f6681b470654d1966426c2e0bbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:14:12.997067Z","signature_b64":"MSfipr4YBxSEbgxHifs/YriyKRFTF1U7cGZ1yFYDgkyvu9T2HQuCoTUhx+agHK73nRJWZQsbufSWIxIM7w/VAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab019f272ea582a9f99f21279d747047d519019546c6c4ba3bee2bf721979f48","last_reissued_at":"2026-07-05T06:14:12.996718Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:14:12.996718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Composing Bridges","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CT"],"primary_cat":"cs.CR","authors_text":"George C. \\c{T}urca\\c{s}, Mugurel Barcau, Vicen\\c{t}iu Pa\\c{s}ol","submitted_at":"2023-05-25T19:20:19Z","abstract_excerpt":"The present work builds on previous investigations of the authors (and their collaborators) regarding bridges, a certain type of morphisms between encryption schemes, making a step forward in developing a (category theory) language for studying relations between encryption schemes. Here we analyse the conditions under which bridges can be performed sequentially, formalizing the notion of composability. One of our results gives a sufficient condition for a pair of bridges to be composable. We illustrate that composing two bridges, each independently satisfying a previously established IND-CPA s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.16435","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/2305.16435/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2305.16435","created_at":"2026-07-05T06:14:12.996768+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.16435v1","created_at":"2026-07-05T06:14:12.996768+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.16435","created_at":"2026-07-05T06:14:12.996768+00:00"},{"alias_kind":"pith_short_12","alias_value":"VMAZ6JZOUWBK","created_at":"2026-07-05T06:14:12.996768+00:00"},{"alias_kind":"pith_short_16","alias_value":"VMAZ6JZOUWBKT6M7","created_at":"2026-07-05T06:14:12.996768+00:00"},{"alias_kind":"pith_short_8","alias_value":"VMAZ6JZO","created_at":"2026-07-05T06:14:12.996768+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.10506","citing_title":"A Progressive Training Strategy for Vision-Language Models to Counteract Spatio-Temporal Hallucinations in Embodied Reasoning","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VMAZ6JZOUWBKT6M7EETZ25DQI7","json":"https://pith.science/pith/VMAZ6JZOUWBKT6M7EETZ25DQI7.json","graph_json":"https://pith.science/api/pith-number/VMAZ6JZOUWBKT6M7EETZ25DQI7/graph.json","events_json":"https://pith.science/api/pith-number/VMAZ6JZOUWBKT6M7EETZ25DQI7/events.json","paper":"https://pith.science/paper/VMAZ6JZO"},"agent_actions":{"view_html":"https://pith.science/pith/VMAZ6JZOUWBKT6M7EETZ25DQI7","download_json":"https://pith.science/pith/VMAZ6JZOUWBKT6M7EETZ25DQI7.json","view_paper":"https://pith.science/paper/VMAZ6JZO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.16435&json=true","fetch_graph":"https://pith.science/api/pith-number/VMAZ6JZOUWBKT6M7EETZ25DQI7/graph.json","fetch_events":"https://pith.science/api/pith-number/VMAZ6JZOUWBKT6M7EETZ25DQI7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VMAZ6JZOUWBKT6M7EETZ25DQI7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VMAZ6JZOUWBKT6M7EETZ25DQI7/action/storage_attestation","attest_author":"https://pith.science/pith/VMAZ6JZOUWBKT6M7EETZ25DQI7/action/author_attestation","sign_citation":"https://pith.science/pith/VMAZ6JZOUWBKT6M7EETZ25DQI7/action/citation_signature","submit_replication":"https://pith.science/pith/VMAZ6JZOUWBKT6M7EETZ25DQI7/action/replication_record"}},"created_at":"2026-07-05T06:14:12.996768+00:00","updated_at":"2026-07-05T06:14:12.996768+00:00"}