{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EDZ5VPP7UTNTLRYBLVJGUA74H5","short_pith_number":"pith:EDZ5VPP7","canonical_record":{"source":{"id":"1411.6646","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-11-24T21:14:47Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"99d03920d778d8b849618594b593da65ce7b2ffdcc51ac134ec8084ccf21ca06","abstract_canon_sha256":"7a72f541fdbca358cb7a06a2db0fe9f4a3e8582cbc7e866de9133b54f7eca26b"},"schema_version":"1.0"},"canonical_sha256":"20f3dabdffa4db35c7015d526a03fc3f486056fd8e221b5a5b0b3a2dfdac0a76","source":{"kind":"arxiv","id":"1411.6646","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6646","created_at":"2026-05-18T01:37:35Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6646v2","created_at":"2026-05-18T01:37:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6646","created_at":"2026-05-18T01:37:35Z"},{"alias_kind":"pith_short_12","alias_value":"EDZ5VPP7UTNT","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EDZ5VPP7UTNTLRYB","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EDZ5VPP7","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EDZ5VPP7UTNTLRYBLVJGUA74H5","target":"record","payload":{"canonical_record":{"source":{"id":"1411.6646","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-11-24T21:14:47Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"99d03920d778d8b849618594b593da65ce7b2ffdcc51ac134ec8084ccf21ca06","abstract_canon_sha256":"7a72f541fdbca358cb7a06a2db0fe9f4a3e8582cbc7e866de9133b54f7eca26b"},"schema_version":"1.0"},"canonical_sha256":"20f3dabdffa4db35c7015d526a03fc3f486056fd8e221b5a5b0b3a2dfdac0a76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:35.402521Z","signature_b64":"csBzo/acYKuu813gJGrb+hosaJANobKyv+ZZF7siv/PqQL+mDGLLdexrd+bXx65lIkUEeMPAgL9MMc0YkRqgDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20f3dabdffa4db35c7015d526a03fc3f486056fd8e221b5a5b0b3a2dfdac0a76","last_reissued_at":"2026-05-18T01:37:35.401989Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:35.401989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.6646","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:37:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wNs+YPy70/BvHkuebs51It0BP6sLbQ+VFyMdpeQSpHYnMQhAMAOYLYoWuQpq6RwLcGILf03dax4y4RUPAz2ECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:23:02.653228Z"},"content_sha256":"edd63e6a42b1f2e8ed4ec3147eb4e31638cc9a67b566e6af8750daad74ec103c","schema_version":"1.0","event_id":"sha256:edd63e6a42b1f2e8ed4ec3147eb4e31638cc9a67b566e6af8750daad74ec103c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EDZ5VPP7UTNTLRYBLVJGUA74H5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Robust Class of Data Languages and an Application to Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Belgium), Benedikt Bollig (LSV, Benjamin Monmege (Universit\\'e Libre de Bruxelles, CNRS & Inria, ENS Cachan, France), Germany), Martin Leucker (ISP, Peter Habermehl (LIAFA University Paris Diderot, University of L\\\"ubeck","submitted_at":"2014-11-24T21:14:47Z","abstract_excerpt":"We introduce session automata, an automata model to process data words, i.e., words over an infinite alphabet. Session automata support the notion of fresh data values, which are well suited for modeling protocols in which sessions using fresh values are of major interest, like in security protocols or ad-hoc networks. Session automata have an expressiveness partly extending, partly reducing that of classical register automata. We show that, unlike register automata and their various extensions, session automata are robust: They (i) are closed under intersection, union, and (resource-sensitive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6646","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:37:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u5FJCHmVkMqZ5yhIM2NWCVKZpH8TGaxC2nGx/DRLp76jS08z1UoP/pHTnIBanFYw2rX5gckEn1oXfk0njoj0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:23:02.653722Z"},"content_sha256":"5539d225712e4835b72fd501f380229285e26a5ba7f4ee1b5bf06aa2fa8567cf","schema_version":"1.0","event_id":"sha256:5539d225712e4835b72fd501f380229285e26a5ba7f4ee1b5bf06aa2fa8567cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EDZ5VPP7UTNTLRYBLVJGUA74H5/bundle.json","state_url":"https://pith.science/pith/EDZ5VPP7UTNTLRYBLVJGUA74H5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EDZ5VPP7UTNTLRYBLVJGUA74H5/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-05-30T07:23:02Z","links":{"resolver":"https://pith.science/pith/EDZ5VPP7UTNTLRYBLVJGUA74H5","bundle":"https://pith.science/pith/EDZ5VPP7UTNTLRYBLVJGUA74H5/bundle.json","state":"https://pith.science/pith/EDZ5VPP7UTNTLRYBLVJGUA74H5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EDZ5VPP7UTNTLRYBLVJGUA74H5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EDZ5VPP7UTNTLRYBLVJGUA74H5","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":"7a72f541fdbca358cb7a06a2db0fe9f4a3e8582cbc7e866de9133b54f7eca26b","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-11-24T21:14:47Z","title_canon_sha256":"99d03920d778d8b849618594b593da65ce7b2ffdcc51ac134ec8084ccf21ca06"},"schema_version":"1.0","source":{"id":"1411.6646","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.6646","created_at":"2026-05-18T01:37:35Z"},{"alias_kind":"arxiv_version","alias_value":"1411.6646v2","created_at":"2026-05-18T01:37:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.6646","created_at":"2026-05-18T01:37:35Z"},{"alias_kind":"pith_short_12","alias_value":"EDZ5VPP7UTNT","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EDZ5VPP7UTNTLRYB","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EDZ5VPP7","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:5539d225712e4835b72fd501f380229285e26a5ba7f4ee1b5bf06aa2fa8567cf","target":"graph","created_at":"2026-05-18T01:37:35Z","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":"We introduce session automata, an automata model to process data words, i.e., words over an infinite alphabet. Session automata support the notion of fresh data values, which are well suited for modeling protocols in which sessions using fresh values are of major interest, like in security protocols or ad-hoc networks. Session automata have an expressiveness partly extending, partly reducing that of classical register automata. We show that, unlike register automata and their various extensions, session automata are robust: They (i) are closed under intersection, union, and (resource-sensitive","authors_text":"Belgium), Benedikt Bollig (LSV, Benjamin Monmege (Universit\\'e Libre de Bruxelles, CNRS & Inria, ENS Cachan, France), Germany), Martin Leucker (ISP, Peter Habermehl (LIAFA University Paris Diderot, University of L\\\"ubeck","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-11-24T21:14:47Z","title":"A Robust Class of Data Languages and an Application to Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.6646","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:edd63e6a42b1f2e8ed4ec3147eb4e31638cc9a67b566e6af8750daad74ec103c","target":"record","created_at":"2026-05-18T01:37:35Z","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":"7a72f541fdbca358cb7a06a2db0fe9f4a3e8582cbc7e866de9133b54f7eca26b","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-11-24T21:14:47Z","title_canon_sha256":"99d03920d778d8b849618594b593da65ce7b2ffdcc51ac134ec8084ccf21ca06"},"schema_version":"1.0","source":{"id":"1411.6646","kind":"arxiv","version":2}},"canonical_sha256":"20f3dabdffa4db35c7015d526a03fc3f486056fd8e221b5a5b0b3a2dfdac0a76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20f3dabdffa4db35c7015d526a03fc3f486056fd8e221b5a5b0b3a2dfdac0a76","first_computed_at":"2026-05-18T01:37:35.401989Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:35.401989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"csBzo/acYKuu813gJGrb+hosaJANobKyv+ZZF7siv/PqQL+mDGLLdexrd+bXx65lIkUEeMPAgL9MMc0YkRqgDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:35.402521Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.6646","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:edd63e6a42b1f2e8ed4ec3147eb4e31638cc9a67b566e6af8750daad74ec103c","sha256:5539d225712e4835b72fd501f380229285e26a5ba7f4ee1b5bf06aa2fa8567cf"],"state_sha256":"8a14c1dd59709d9aaceec39f23802289d6bd7fa5ae60ca62e58552c893029690"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pVmVS0txO4jW6VxXJFDunsxpDrIb+7EJc91XMieXPaaClqODh9/yVzKCCDRulVzGtd0eiMdar2WkUGEAUvpCCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:23:02.656264Z","bundle_sha256":"5a84d02954f01f1edc3c9ca0ef9165b240f7a3ec668da0a992c1ea3f4c13273d"}}