{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:BGLBZ24STPS4HLSF3WM3R5U6JP","short_pith_number":"pith:BGLBZ24S","canonical_record":{"source":{"id":"1710.02516","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-10-06T17:50:25Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"d3fae6ea3f7c0a88c5218953e41bfe47e6320d129923f41dcbe80d8223f0cab0","abstract_canon_sha256":"ed559f62b2abf524c8d0c1205bdb973495f9d6e7d55f6c4e5ed95b37d1a5eb01"},"schema_version":"1.0"},"canonical_sha256":"09961ceb929be5c3ae45dd99b8f69e4bfec5d49dffbdae747549b2e283c9cfda","source":{"kind":"arxiv","id":"1710.02516","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02516","created_at":"2026-05-18T00:33:33Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02516v1","created_at":"2026-05-18T00:33:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02516","created_at":"2026-05-18T00:33:33Z"},{"alias_kind":"pith_short_12","alias_value":"BGLBZ24STPS4","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BGLBZ24STPS4HLSF","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BGLBZ24S","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:BGLBZ24STPS4HLSF3WM3R5U6JP","target":"record","payload":{"canonical_record":{"source":{"id":"1710.02516","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-10-06T17:50:25Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"d3fae6ea3f7c0a88c5218953e41bfe47e6320d129923f41dcbe80d8223f0cab0","abstract_canon_sha256":"ed559f62b2abf524c8d0c1205bdb973495f9d6e7d55f6c4e5ed95b37d1a5eb01"},"schema_version":"1.0"},"canonical_sha256":"09961ceb929be5c3ae45dd99b8f69e4bfec5d49dffbdae747549b2e283c9cfda","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:33.233090Z","signature_b64":"OOfQb6VJHynVZfDSF6wApGyPcfvZp1NLG0lT8WvH4KJE5ualkpdkEp9h+eLVo6Nn7V3KYZRgyA7GH/g0gDj0AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09961ceb929be5c3ae45dd99b8f69e4bfec5d49dffbdae747549b2e283c9cfda","last_reissued_at":"2026-05-18T00:33:33.232357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:33.232357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.02516","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-18T00:33:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"13UFUDVgZQLkvHlis+AEEetPIiI05DOrqmpUXYtmP2lZytaEoBcnV4ZIM+j79gdYjUDudEVogpmLsq2aUJhdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:56:37.197932Z"},"content_sha256":"ab4766c8b08fc449074f5ddce045edfe3e2f7c0ef1dd191f7e1bead5164ad35c","schema_version":"1.0","event_id":"sha256:ab4766c8b08fc449074f5ddce045edfe3e2f7c0ef1dd191f7e1bead5164ad35c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:BGLBZ24STPS4HLSF3WM3R5U6JP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity of Deciding Detectability in Discrete Event Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.SY","authors_text":"Tom\\'a\\v{s} Masopust","submitted_at":"2017-10-06T17:50:25Z","abstract_excerpt":"Detectability of discrete event systems (DESs) is a question whether the current and subsequent states can be determined based on observations. Shu and Lin designed a polynomial-time algorithm to check strong (periodic) detectability and an exponential-time (polynomial-space) algorithm to check weak (periodic) detectability. Zhang showed that checking weak (periodic) detectability is PSpace-complete. This intractable complexity opens a question whether there are structurally simpler DESs for which the problem is tractable. In this paper, we show that it is not the case by considering DESs repr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02516","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-18T00:33:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"soi5u5IYYlq3wVdZrDnGyTg2cicyfmf1iCPzYRy57qjSxvPPu2IapokKfq+5q26FTOsc5Xks4Mz6CHDP5IXnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:56:37.198766Z"},"content_sha256":"ce319633a45c566a37187bb3bb22c30d60cd8b03c9daba4fcf2761811f07e260","schema_version":"1.0","event_id":"sha256:ce319633a45c566a37187bb3bb22c30d60cd8b03c9daba4fcf2761811f07e260"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BGLBZ24STPS4HLSF3WM3R5U6JP/bundle.json","state_url":"https://pith.science/pith/BGLBZ24STPS4HLSF3WM3R5U6JP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BGLBZ24STPS4HLSF3WM3R5U6JP/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-26T12:56:37Z","links":{"resolver":"https://pith.science/pith/BGLBZ24STPS4HLSF3WM3R5U6JP","bundle":"https://pith.science/pith/BGLBZ24STPS4HLSF3WM3R5U6JP/bundle.json","state":"https://pith.science/pith/BGLBZ24STPS4HLSF3WM3R5U6JP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BGLBZ24STPS4HLSF3WM3R5U6JP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BGLBZ24STPS4HLSF3WM3R5U6JP","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":"ed559f62b2abf524c8d0c1205bdb973495f9d6e7d55f6c4e5ed95b37d1a5eb01","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-10-06T17:50:25Z","title_canon_sha256":"d3fae6ea3f7c0a88c5218953e41bfe47e6320d129923f41dcbe80d8223f0cab0"},"schema_version":"1.0","source":{"id":"1710.02516","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02516","created_at":"2026-05-18T00:33:33Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02516v1","created_at":"2026-05-18T00:33:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02516","created_at":"2026-05-18T00:33:33Z"},{"alias_kind":"pith_short_12","alias_value":"BGLBZ24STPS4","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BGLBZ24STPS4HLSF","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BGLBZ24S","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:ce319633a45c566a37187bb3bb22c30d60cd8b03c9daba4fcf2761811f07e260","target":"graph","created_at":"2026-05-18T00:33:33Z","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":"Detectability of discrete event systems (DESs) is a question whether the current and subsequent states can be determined based on observations. Shu and Lin designed a polynomial-time algorithm to check strong (periodic) detectability and an exponential-time (polynomial-space) algorithm to check weak (periodic) detectability. Zhang showed that checking weak (periodic) detectability is PSpace-complete. This intractable complexity opens a question whether there are structurally simpler DESs for which the problem is tractable. In this paper, we show that it is not the case by considering DESs repr","authors_text":"Tom\\'a\\v{s} Masopust","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-10-06T17:50:25Z","title":"Complexity of Deciding Detectability in Discrete Event Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02516","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:ab4766c8b08fc449074f5ddce045edfe3e2f7c0ef1dd191f7e1bead5164ad35c","target":"record","created_at":"2026-05-18T00:33:33Z","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":"ed559f62b2abf524c8d0c1205bdb973495f9d6e7d55f6c4e5ed95b37d1a5eb01","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-10-06T17:50:25Z","title_canon_sha256":"d3fae6ea3f7c0a88c5218953e41bfe47e6320d129923f41dcbe80d8223f0cab0"},"schema_version":"1.0","source":{"id":"1710.02516","kind":"arxiv","version":1}},"canonical_sha256":"09961ceb929be5c3ae45dd99b8f69e4bfec5d49dffbdae747549b2e283c9cfda","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09961ceb929be5c3ae45dd99b8f69e4bfec5d49dffbdae747549b2e283c9cfda","first_computed_at":"2026-05-18T00:33:33.232357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:33.232357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OOfQb6VJHynVZfDSF6wApGyPcfvZp1NLG0lT8WvH4KJE5ualkpdkEp9h+eLVo6Nn7V3KYZRgyA7GH/g0gDj0AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:33.233090Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.02516","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ab4766c8b08fc449074f5ddce045edfe3e2f7c0ef1dd191f7e1bead5164ad35c","sha256:ce319633a45c566a37187bb3bb22c30d60cd8b03c9daba4fcf2761811f07e260"],"state_sha256":"920d41bdff2572083a015d395e2ea0767b2b883b62d00e6bce0d6479ddfa69dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lKVmtUK9JJpKWqZIXP5v7dnj44ZLUzdeZWO1SrcYlp4fOEo9YSuBR1kf7/uiohuX0bGj/3ihX+WuHu2VzIKIBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:56:37.202544Z","bundle_sha256":"88bbe00b338fe84e5d4fc59c00de002d1e8ad00919abeae8ad9a13dad090ab7a"}}