{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:TDIP5FDBQFAEB6I7RDV4IHYOJA","short_pith_number":"pith:TDIP5FDB","canonical_record":{"source":{"id":"1011.6432","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-11-30T01:37:50Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"ede951a494a9032e2cf134c94c91ad24a3dab82347b29785cd02c9f53c4f1f57","abstract_canon_sha256":"86866ffdf309e2eee9504f36b45284a4cd6d67361ec80d590a3fb381830ca088"},"schema_version":"1.0"},"canonical_sha256":"98d0fe9461814040f91f88ebc41f0e48325c42ec05c994b190b06baadf9126e9","source":{"kind":"arxiv","id":"1011.6432","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.6432","created_at":"2026-05-17T23:53:19Z"},{"alias_kind":"arxiv_version","alias_value":"1011.6432v1","created_at":"2026-05-17T23:53:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.6432","created_at":"2026-05-17T23:53:19Z"},{"alias_kind":"pith_short_12","alias_value":"TDIP5FDBQFAE","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"TDIP5FDBQFAEB6I7","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"TDIP5FDB","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:TDIP5FDBQFAEB6I7RDV4IHYOJA","target":"record","payload":{"canonical_record":{"source":{"id":"1011.6432","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-11-30T01:37:50Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"ede951a494a9032e2cf134c94c91ad24a3dab82347b29785cd02c9f53c4f1f57","abstract_canon_sha256":"86866ffdf309e2eee9504f36b45284a4cd6d67361ec80d590a3fb381830ca088"},"schema_version":"1.0"},"canonical_sha256":"98d0fe9461814040f91f88ebc41f0e48325c42ec05c994b190b06baadf9126e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:19.582198Z","signature_b64":"wUlACEBqkyh19EZerQbM2k49e82P/56iJFuz0e597d9RFx/RCa+ZK+ClKhxbz/JNggyTKaDVYOzdRmnIEn9YCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98d0fe9461814040f91f88ebc41f0e48325c42ec05c994b190b06baadf9126e9","last_reissued_at":"2026-05-17T23:53:19.581482Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:19.581482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.6432","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-05-17T23:53:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"exyF1to/ceRa73tsK2TeuZvZaIfSAlmpiXkIgocwp9lmyE3Ur2YPIryGTcMQ8W21ADFixRfY5UVkF1l9ydueDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:46:02.208199Z"},"content_sha256":"ff7bd8c68e8eb821d7ae4d6b05aba08f3c55000b9f720db748cd4dd170e9ec0a","schema_version":"1.0","event_id":"sha256:ff7bd8c68e8eb821d7ae4d6b05aba08f3c55000b9f720db748cd4dd170e9ec0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:TDIP5FDBQFAEB6I7RDV4IHYOJA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relating timed and register automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Diego Figueira (INRIA, ENS Cachan, France), LSV, Piotr Hofman (Institute of Informatics, Poland), S{\\l}awomir Lasota (Institute of Informatics, University of Warsaw","submitted_at":"2010-11-30T01:37:50Z","abstract_excerpt":"Timed automata and register automata are well-known  models of computation over timed and data words respectively. The former has clocks that allow to test the lapse of time between two events, whilst the latter includes registers that can store data values for later comparison. Although these two models behave in appearance  differently, several decision problems have the same (un)decidability and complexity results for both models. As a prominent example, emptiness is decidable for alternating automata with one clock or register, both with non-primitive recursive complexity. This is not by c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.6432","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":""},"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-17T23:53:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6jOL/4eWAOLHe/Sm+Knaq2JW09O3p20vwzhdtF06otZpet09EmiGvBFd9MHMU00MgQ1CNDyHJa6B27Kt+a25AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:46:02.208988Z"},"content_sha256":"4be50b02a01f1ed02fa16f1fd4970cd644110399eaac45466fe4b130b193c302","schema_version":"1.0","event_id":"sha256:4be50b02a01f1ed02fa16f1fd4970cd644110399eaac45466fe4b130b193c302"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TDIP5FDBQFAEB6I7RDV4IHYOJA/bundle.json","state_url":"https://pith.science/pith/TDIP5FDBQFAEB6I7RDV4IHYOJA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TDIP5FDBQFAEB6I7RDV4IHYOJA/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-30T10:46:02Z","links":{"resolver":"https://pith.science/pith/TDIP5FDBQFAEB6I7RDV4IHYOJA","bundle":"https://pith.science/pith/TDIP5FDBQFAEB6I7RDV4IHYOJA/bundle.json","state":"https://pith.science/pith/TDIP5FDBQFAEB6I7RDV4IHYOJA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TDIP5FDBQFAEB6I7RDV4IHYOJA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:TDIP5FDBQFAEB6I7RDV4IHYOJA","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":"86866ffdf309e2eee9504f36b45284a4cd6d67361ec80d590a3fb381830ca088","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-11-30T01:37:50Z","title_canon_sha256":"ede951a494a9032e2cf134c94c91ad24a3dab82347b29785cd02c9f53c4f1f57"},"schema_version":"1.0","source":{"id":"1011.6432","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.6432","created_at":"2026-05-17T23:53:19Z"},{"alias_kind":"arxiv_version","alias_value":"1011.6432v1","created_at":"2026-05-17T23:53:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.6432","created_at":"2026-05-17T23:53:19Z"},{"alias_kind":"pith_short_12","alias_value":"TDIP5FDBQFAE","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"TDIP5FDBQFAEB6I7","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"TDIP5FDB","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:4be50b02a01f1ed02fa16f1fd4970cd644110399eaac45466fe4b130b193c302","target":"graph","created_at":"2026-05-17T23:53: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"},"paper":{"abstract_excerpt":"Timed automata and register automata are well-known  models of computation over timed and data words respectively. The former has clocks that allow to test the lapse of time between two events, whilst the latter includes registers that can store data values for later comparison. Although these two models behave in appearance  differently, several decision problems have the same (un)decidability and complexity results for both models. As a prominent example, emptiness is decidable for alternating automata with one clock or register, both with non-primitive recursive complexity. This is not by c","authors_text":"Diego Figueira (INRIA, ENS Cachan, France), LSV, Piotr Hofman (Institute of Informatics, Poland), S{\\l}awomir Lasota (Institute of Informatics, University of Warsaw","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-11-30T01:37:50Z","title":"Relating timed and register automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.6432","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:ff7bd8c68e8eb821d7ae4d6b05aba08f3c55000b9f720db748cd4dd170e9ec0a","target":"record","created_at":"2026-05-17T23:53: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":"86866ffdf309e2eee9504f36b45284a4cd6d67361ec80d590a3fb381830ca088","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-11-30T01:37:50Z","title_canon_sha256":"ede951a494a9032e2cf134c94c91ad24a3dab82347b29785cd02c9f53c4f1f57"},"schema_version":"1.0","source":{"id":"1011.6432","kind":"arxiv","version":1}},"canonical_sha256":"98d0fe9461814040f91f88ebc41f0e48325c42ec05c994b190b06baadf9126e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98d0fe9461814040f91f88ebc41f0e48325c42ec05c994b190b06baadf9126e9","first_computed_at":"2026-05-17T23:53:19.581482Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:19.581482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wUlACEBqkyh19EZerQbM2k49e82P/56iJFuz0e597d9RFx/RCa+ZK+ClKhxbz/JNggyTKaDVYOzdRmnIEn9YCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:19.582198Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.6432","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff7bd8c68e8eb821d7ae4d6b05aba08f3c55000b9f720db748cd4dd170e9ec0a","sha256:4be50b02a01f1ed02fa16f1fd4970cd644110399eaac45466fe4b130b193c302"],"state_sha256":"434ef630f885b2912c60fb63babc92267bc8253f9c0fa7d8d786ca50a6d42813"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QEbPZWTqTAV58s1Iou447okTWcAYZx5n3tZDp2zysY+BZVM27YyV8GLIF1dDD+Twt1FZSVOEagJroP1cEXFuBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:46:02.212770Z","bundle_sha256":"2b245310df35b0607db99278b3f7e1669fb352dd4e9875871c53f29aa323e543"}}