{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3YOSXJCFCMPXORGNVOQC3PCRK3","short_pith_number":"pith:3YOSXJCF","canonical_record":{"source":{"id":"1410.5056","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-19T10:49:53Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"ae97aa83e0b4e91d4ec63129f4fe290ea3ef50679c94779c0a74c6e5c8f9b927","abstract_canon_sha256":"f9dc63e0d50008f51444ab261b0e4acb02a4a116eaec31f48cbd51bd5e95c36c"},"schema_version":"1.0"},"canonical_sha256":"de1d2ba445131f7744cdaba02dbc5156f432cbb4ce40190228c82bdcb15d0851","source":{"kind":"arxiv","id":"1410.5056","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5056","created_at":"2026-05-18T01:29:38Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5056v3","created_at":"2026-05-18T01:29:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5056","created_at":"2026-05-18T01:29:38Z"},{"alias_kind":"pith_short_12","alias_value":"3YOSXJCFCMPX","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3YOSXJCFCMPXORGN","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3YOSXJCF","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3YOSXJCFCMPXORGNVOQC3PCRK3","target":"record","payload":{"canonical_record":{"source":{"id":"1410.5056","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-19T10:49:53Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"ae97aa83e0b4e91d4ec63129f4fe290ea3ef50679c94779c0a74c6e5c8f9b927","abstract_canon_sha256":"f9dc63e0d50008f51444ab261b0e4acb02a4a116eaec31f48cbd51bd5e95c36c"},"schema_version":"1.0"},"canonical_sha256":"de1d2ba445131f7744cdaba02dbc5156f432cbb4ce40190228c82bdcb15d0851","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:38.452874Z","signature_b64":"RVidnqdQT6ZMm25PQftdWmfWAFVx6hEnEKMGuM6LTlT0jS6OS006GT+UoyFsJYZ8czVQ+x/AtxT2Iwj8XOxKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de1d2ba445131f7744cdaba02dbc5156f432cbb4ce40190228c82bdcb15d0851","last_reissued_at":"2026-05-18T01:29:38.452288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:38.452288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.5056","source_version":3,"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:29:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1rgb6RHf+gHygtNpP904XuvNxtlvrtdbKnRJDX7a5u5CX16ZzxIuvu38e8W0WE04b2OPp3GaKZvQRfLijkwGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:05:16.450723Z"},"content_sha256":"7bdf13690df3722d988d650d0a83c5c3d79a5bc95b52cb4757264da6770ac586","schema_version":"1.0","event_id":"sha256:7bdf13690df3722d988d650d0a83c5c3d79a5bc95b52cb4757264da6770ac586"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3YOSXJCFCMPXORGNVOQC3PCRK3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Abstraction Refinement for Trace Inclusion of Infinite State Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Adam Rogalewicz, Radu Iosif, Tomas Vojnar","submitted_at":"2014-10-19T10:49:53Z","abstract_excerpt":"A \\emph{data automaton} is a finite automaton equipped with variables (counters or registers) ranging over infinite data domains. A trace of a data automaton is an alternating sequence of alphabet symbols and values taken by the counters during an execution of the automaton. The problem addressed in this paper is the inclusion between the sets of traces (data languages) recognized by such automata. Since the problem is undecidable in general, we give a semi-algorithm based on abstraction refinement, which is proved to be sound and complete, but whose termination is not guaranteed. We have impl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5056","kind":"arxiv","version":3},"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:29:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8j5zb1es23fqmwN6+q4DUlJqmresv/NlDDzIzz39kweKC//cF7AD8l5/HD3Hc9cfUfG8ZbvpEka7w0nhayGpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:05:16.451280Z"},"content_sha256":"93ea3f1f96b3a9e87dc1f05560e57359dfe4a9c51c4d93a8fc30be82c7e878fb","schema_version":"1.0","event_id":"sha256:93ea3f1f96b3a9e87dc1f05560e57359dfe4a9c51c4d93a8fc30be82c7e878fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3YOSXJCFCMPXORGNVOQC3PCRK3/bundle.json","state_url":"https://pith.science/pith/3YOSXJCFCMPXORGNVOQC3PCRK3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3YOSXJCFCMPXORGNVOQC3PCRK3/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-30T06:05:16Z","links":{"resolver":"https://pith.science/pith/3YOSXJCFCMPXORGNVOQC3PCRK3","bundle":"https://pith.science/pith/3YOSXJCFCMPXORGNVOQC3PCRK3/bundle.json","state":"https://pith.science/pith/3YOSXJCFCMPXORGNVOQC3PCRK3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3YOSXJCFCMPXORGNVOQC3PCRK3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3YOSXJCFCMPXORGNVOQC3PCRK3","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":"f9dc63e0d50008f51444ab261b0e4acb02a4a116eaec31f48cbd51bd5e95c36c","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-19T10:49:53Z","title_canon_sha256":"ae97aa83e0b4e91d4ec63129f4fe290ea3ef50679c94779c0a74c6e5c8f9b927"},"schema_version":"1.0","source":{"id":"1410.5056","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.5056","created_at":"2026-05-18T01:29:38Z"},{"alias_kind":"arxiv_version","alias_value":"1410.5056v3","created_at":"2026-05-18T01:29:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.5056","created_at":"2026-05-18T01:29:38Z"},{"alias_kind":"pith_short_12","alias_value":"3YOSXJCFCMPX","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3YOSXJCFCMPXORGN","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3YOSXJCF","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:93ea3f1f96b3a9e87dc1f05560e57359dfe4a9c51c4d93a8fc30be82c7e878fb","target":"graph","created_at":"2026-05-18T01:29:38Z","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":"A \\emph{data automaton} is a finite automaton equipped with variables (counters or registers) ranging over infinite data domains. A trace of a data automaton is an alternating sequence of alphabet symbols and values taken by the counters during an execution of the automaton. The problem addressed in this paper is the inclusion between the sets of traces (data languages) recognized by such automata. Since the problem is undecidable in general, we give a semi-algorithm based on abstraction refinement, which is proved to be sound and complete, but whose termination is not guaranteed. We have impl","authors_text":"Adam Rogalewicz, Radu Iosif, Tomas Vojnar","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-19T10:49:53Z","title":"Abstraction Refinement for Trace Inclusion of Infinite State Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.5056","kind":"arxiv","version":3},"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:7bdf13690df3722d988d650d0a83c5c3d79a5bc95b52cb4757264da6770ac586","target":"record","created_at":"2026-05-18T01:29:38Z","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":"f9dc63e0d50008f51444ab261b0e4acb02a4a116eaec31f48cbd51bd5e95c36c","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-19T10:49:53Z","title_canon_sha256":"ae97aa83e0b4e91d4ec63129f4fe290ea3ef50679c94779c0a74c6e5c8f9b927"},"schema_version":"1.0","source":{"id":"1410.5056","kind":"arxiv","version":3}},"canonical_sha256":"de1d2ba445131f7744cdaba02dbc5156f432cbb4ce40190228c82bdcb15d0851","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de1d2ba445131f7744cdaba02dbc5156f432cbb4ce40190228c82bdcb15d0851","first_computed_at":"2026-05-18T01:29:38.452288Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:38.452288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RVidnqdQT6ZMm25PQftdWmfWAFVx6hEnEKMGuM6LTlT0jS6OS006GT+UoyFsJYZ8czVQ+x/AtxT2Iwj8XOxKDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:38.452874Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.5056","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bdf13690df3722d988d650d0a83c5c3d79a5bc95b52cb4757264da6770ac586","sha256:93ea3f1f96b3a9e87dc1f05560e57359dfe4a9c51c4d93a8fc30be82c7e878fb"],"state_sha256":"c180ce44794055725ad270b8ce0b7b056e429f93fdb06473d87b03874b34f0b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p+AFFgbTG1rh2s0+02ywiE7ACE956T9gebJwJ3dMZxCbCINE1zN86ph72NVfzL9+8WXTs89yg8k0sBbpCzmcCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:05:16.453467Z","bundle_sha256":"5933950df8d6e4bd0bd272042eb637f46a1805601384b784bc0dd0cdc8323424"}}