{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2WVEEKJZCXXBH6DJM6YYSY5JL4","short_pith_number":"pith:2WVEEKJZ","canonical_record":{"source":{"id":"1401.2854","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-01-13T14:45:34Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"046d9ebfb9ea1cd8da269ffb028f760fb2658716ecae2284f39be9f3e82bbeb0","abstract_canon_sha256":"21a47dadf27eb72bf980bc49a1ed6a59d69bd561941b1d43cca4dc612e637bde"},"schema_version":"1.0"},"canonical_sha256":"d5aa42293915ee13f86967b18963a95f1820b41f30e089cd4c5fb015bd655ecc","source":{"kind":"arxiv","id":"1401.2854","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2854","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2854v2","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2854","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"pith_short_12","alias_value":"2WVEEKJZCXXB","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2WVEEKJZCXXBH6DJ","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2WVEEKJZ","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2WVEEKJZCXXBH6DJM6YYSY5JL4","target":"record","payload":{"canonical_record":{"source":{"id":"1401.2854","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-01-13T14:45:34Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"046d9ebfb9ea1cd8da269ffb028f760fb2658716ecae2284f39be9f3e82bbeb0","abstract_canon_sha256":"21a47dadf27eb72bf980bc49a1ed6a59d69bd561941b1d43cca4dc612e637bde"},"schema_version":"1.0"},"canonical_sha256":"d5aa42293915ee13f86967b18963a95f1820b41f30e089cd4c5fb015bd655ecc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:16.321955Z","signature_b64":"+9z/TU56IyM/qLAI5g30R8dw2MFu4vEEtvAYK3Rcj7Yla3StkwZl8mxFxtKoOjl7D5SbrnWsLhrmzvUqMpMYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5aa42293915ee13f86967b18963a95f1820b41f30e089cd4c5fb015bd655ecc","last_reissued_at":"2026-05-18T01:01:16.321250Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:16.321250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.2854","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-18T01:01:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LsLraEiqLxDtR+fWAN9EY20lhdnJpjmfN/XUH0boe/GtNugIY265ereACEJM1jSKlf/TrBkVfQZG+UdP2b97Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T07:59:35.613003Z"},"content_sha256":"87d38d1887ab78a532b58c1a68c575b68ba4c89542d2299e66bc9c056c1a6bd8","schema_version":"1.0","event_id":"sha256:87d38d1887ab78a532b58c1a68c575b68ba4c89542d2299e66bc9c056c1a6bd8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2WVEEKJZCXXBH6DJM6YYSY5JL4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A reduced semantics for deciding trace equivalence using constraint systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CR","authors_text":"David Baelde, Lucca Hirschi, St\\'ephanie Delaune","submitted_at":"2014-01-13T14:45:34Z","abstract_excerpt":"Many privacy-type properties of security protocols can be modelled using trace equivalence properties in suitable process algebras. It has been shown that such properties can be decided for interesting classes of finite processes (i.e., without replication) by means of symbolic execution and constraint solving. However, this does not suffice to obtain practical tools. Current prototypes suffer from a classical combinatorial explosion problem caused by the exploration of many interleavings in the behaviour of processes. M\\\"odersheim et al. have tackled this problem for reachability properties u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2854","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-18T01:01:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QNGi5eYBIJnOfOLLmT71K3GdGwtLfRD/thqaeQKn+lhTx2Ja6WjSWiTmsF8g1Hzzsn5bCoIkJLGdSkMisHJPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T07:59:35.613398Z"},"content_sha256":"5b08700274f40faec6c75a1b8b6cacd7adcd0291f024d129acca00de4fab4612","schema_version":"1.0","event_id":"sha256:5b08700274f40faec6c75a1b8b6cacd7adcd0291f024d129acca00de4fab4612"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2WVEEKJZCXXBH6DJM6YYSY5JL4/bundle.json","state_url":"https://pith.science/pith/2WVEEKJZCXXBH6DJM6YYSY5JL4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2WVEEKJZCXXBH6DJM6YYSY5JL4/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-22T07:59:35Z","links":{"resolver":"https://pith.science/pith/2WVEEKJZCXXBH6DJM6YYSY5JL4","bundle":"https://pith.science/pith/2WVEEKJZCXXBH6DJM6YYSY5JL4/bundle.json","state":"https://pith.science/pith/2WVEEKJZCXXBH6DJM6YYSY5JL4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2WVEEKJZCXXBH6DJM6YYSY5JL4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2WVEEKJZCXXBH6DJM6YYSY5JL4","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":"21a47dadf27eb72bf980bc49a1ed6a59d69bd561941b1d43cca4dc612e637bde","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-01-13T14:45:34Z","title_canon_sha256":"046d9ebfb9ea1cd8da269ffb028f760fb2658716ecae2284f39be9f3e82bbeb0"},"schema_version":"1.0","source":{"id":"1401.2854","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2854","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2854v2","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2854","created_at":"2026-05-18T01:01:16Z"},{"alias_kind":"pith_short_12","alias_value":"2WVEEKJZCXXB","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2WVEEKJZCXXBH6DJ","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2WVEEKJZ","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:5b08700274f40faec6c75a1b8b6cacd7adcd0291f024d129acca00de4fab4612","target":"graph","created_at":"2026-05-18T01:01:16Z","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":"Many privacy-type properties of security protocols can be modelled using trace equivalence properties in suitable process algebras. It has been shown that such properties can be decided for interesting classes of finite processes (i.e., without replication) by means of symbolic execution and constraint solving. However, this does not suffice to obtain practical tools. Current prototypes suffer from a classical combinatorial explosion problem caused by the exploration of many interleavings in the behaviour of processes. M\\\"odersheim et al. have tackled this problem for reachability properties u","authors_text":"David Baelde, Lucca Hirschi, St\\'ephanie Delaune","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-01-13T14:45:34Z","title":"A reduced semantics for deciding trace equivalence using constraint systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2854","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:87d38d1887ab78a532b58c1a68c575b68ba4c89542d2299e66bc9c056c1a6bd8","target":"record","created_at":"2026-05-18T01:01:16Z","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":"21a47dadf27eb72bf980bc49a1ed6a59d69bd561941b1d43cca4dc612e637bde","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-01-13T14:45:34Z","title_canon_sha256":"046d9ebfb9ea1cd8da269ffb028f760fb2658716ecae2284f39be9f3e82bbeb0"},"schema_version":"1.0","source":{"id":"1401.2854","kind":"arxiv","version":2}},"canonical_sha256":"d5aa42293915ee13f86967b18963a95f1820b41f30e089cd4c5fb015bd655ecc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5aa42293915ee13f86967b18963a95f1820b41f30e089cd4c5fb015bd655ecc","first_computed_at":"2026-05-18T01:01:16.321250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:16.321250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+9z/TU56IyM/qLAI5g30R8dw2MFu4vEEtvAYK3Rcj7Yla3StkwZl8mxFxtKoOjl7D5SbrnWsLhrmzvUqMpMYCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:16.321955Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2854","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87d38d1887ab78a532b58c1a68c575b68ba4c89542d2299e66bc9c056c1a6bd8","sha256:5b08700274f40faec6c75a1b8b6cacd7adcd0291f024d129acca00de4fab4612"],"state_sha256":"08ba42c61f3d15f22f7a6a66b90a55b327ea2c865f73c2698d8a156a8fbfd2ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JzS7a5uoCee21nZEMQZiKswdoVMaVpMz8UB7GtF8+fH0ddlgSAoVRtVNv4FkjubNv2y1X6d/ky7uiTo5khGLBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T07:59:35.615399Z","bundle_sha256":"b66163220cec1d50990e5f9703c8076436c9b9cb918e2b5eb4cd0d1b5be6f688"}}