{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:W77I4FNSJIPVNRH6O7WAJBGBTX","short_pith_number":"pith:W77I4FNS","canonical_record":{"source":{"id":"0804.4525","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2008-04-29T04:26:08Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"dd74c2cd9789c9a377e2a574c08d0b16b8b071d7d24d34815194fc7e397f015c","abstract_canon_sha256":"49eb0d764434a37dd26b3d8e3c65a4c49913d23484822c9f561ab3ef7b4d256a"},"schema_version":"1.0"},"canonical_sha256":"b7fe8e15b24a1f56c4fe77ec0484c19dc72a8e1f02f5989a9070529a99d9dc76","source":{"kind":"arxiv","id":"0804.4525","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0804.4525","created_at":"2026-07-04T15:34:43Z"},{"alias_kind":"arxiv_version","alias_value":"0804.4525v1","created_at":"2026-07-04T15:34:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.4525","created_at":"2026-07-04T15:34:43Z"},{"alias_kind":"pith_short_12","alias_value":"W77I4FNSJIPV","created_at":"2026-07-04T15:34:43Z"},{"alias_kind":"pith_short_16","alias_value":"W77I4FNSJIPVNRH6","created_at":"2026-07-04T15:34:43Z"},{"alias_kind":"pith_short_8","alias_value":"W77I4FNS","created_at":"2026-07-04T15:34:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:W77I4FNSJIPVNRH6O7WAJBGBTX","target":"record","payload":{"canonical_record":{"source":{"id":"0804.4525","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2008-04-29T04:26:08Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"dd74c2cd9789c9a377e2a574c08d0b16b8b071d7d24d34815194fc7e397f015c","abstract_canon_sha256":"49eb0d764434a37dd26b3d8e3c65a4c49913d23484822c9f561ab3ef7b4d256a"},"schema_version":"1.0"},"canonical_sha256":"b7fe8e15b24a1f56c4fe77ec0484c19dc72a8e1f02f5989a9070529a99d9dc76","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:34:43.413427Z","signature_b64":"dPalrWERVYJJtMc752ikKSfOJ296DmcRjbsH8hIcjAcE7j+kGHQBoZ1wnvB14vWLFYC1rh8/KsTVwyQEWgCoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7fe8e15b24a1f56c4fe77ec0484c19dc72a8e1f02f5989a9070529a99d9dc76","last_reissued_at":"2026-07-04T15:34:43.412901Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:34:43.412901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0804.4525","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-07-04T15:34:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bb1LASGsX6Q8k3XI/Eh8x+X7ahKhWkdoatlGGegRDaNrjb1Yj9/SqQ+fuSFSEsGQeaMVGhVN2j6DSXhuoIDkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T10:32:06.236796Z"},"content_sha256":"57475387626fcfe03427746e026a784d9c04f400718433cc15e900a856d0fe11","schema_version":"1.0","event_id":"sha256:57475387626fcfe03427746e026a784d9c04f400718433cc15e900a856d0fe11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:W77I4FNSJIPVNRH6O7WAJBGBTX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Coverage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.PL","authors_text":"Krishnendu Chatterjee, Luca de Alfaro, Rupak Majumdar","submitted_at":"2008-04-29T04:26:08Z","abstract_excerpt":"We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between the tester and the system, where the system state space is partitioned according to some coverage criterion and the objective of the tester is to maximize the set of partitions (or coverage goals) visited during the game. We show the complexity of the maximal coverage problem for non-deterministic systems is PSPACE-complete, but is NP-complete for deterministic systems. For the special case of non-deterministic systems with a re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.4525","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0804.4525/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T15:34:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k+OuuIopycyyeC9u1txDn//kvq+oYU2PXiz1zYUVTXKuOiRJObEeno8Xp5AGgflKDjaGE7EjAY01ZVggnGkECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T10:32:06.237304Z"},"content_sha256":"5c64d3fbb76dd432a2caf07f7a2dc26293f9bc86e80ca7519c882c0736f0ea98","schema_version":"1.0","event_id":"sha256:5c64d3fbb76dd432a2caf07f7a2dc26293f9bc86e80ca7519c882c0736f0ea98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W77I4FNSJIPVNRH6O7WAJBGBTX/bundle.json","state_url":"https://pith.science/pith/W77I4FNSJIPVNRH6O7WAJBGBTX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W77I4FNSJIPVNRH6O7WAJBGBTX/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-08-06T10:32:06Z","links":{"resolver":"https://pith.science/pith/W77I4FNSJIPVNRH6O7WAJBGBTX","bundle":"https://pith.science/pith/W77I4FNSJIPVNRH6O7WAJBGBTX/bundle.json","state":"https://pith.science/pith/W77I4FNSJIPVNRH6O7WAJBGBTX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W77I4FNSJIPVNRH6O7WAJBGBTX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:W77I4FNSJIPVNRH6O7WAJBGBTX","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":"49eb0d764434a37dd26b3d8e3c65a4c49913d23484822c9f561ab3ef7b4d256a","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2008-04-29T04:26:08Z","title_canon_sha256":"dd74c2cd9789c9a377e2a574c08d0b16b8b071d7d24d34815194fc7e397f015c"},"schema_version":"1.0","source":{"id":"0804.4525","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0804.4525","created_at":"2026-07-04T15:34:43Z"},{"alias_kind":"arxiv_version","alias_value":"0804.4525v1","created_at":"2026-07-04T15:34:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.4525","created_at":"2026-07-04T15:34:43Z"},{"alias_kind":"pith_short_12","alias_value":"W77I4FNSJIPV","created_at":"2026-07-04T15:34:43Z"},{"alias_kind":"pith_short_16","alias_value":"W77I4FNSJIPVNRH6","created_at":"2026-07-04T15:34:43Z"},{"alias_kind":"pith_short_8","alias_value":"W77I4FNS","created_at":"2026-07-04T15:34:43Z"}],"graph_snapshots":[{"event_id":"sha256:5c64d3fbb76dd432a2caf07f7a2dc26293f9bc86e80ca7519c882c0736f0ea98","target":"graph","created_at":"2026-07-04T15:34:43Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0804.4525/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between the tester and the system, where the system state space is partitioned according to some coverage criterion and the objective of the tester is to maximize the set of partitions (or coverage goals) visited during the game. We show the complexity of the maximal coverage problem for non-deterministic systems is PSPACE-complete, but is NP-complete for deterministic systems. For the special case of non-deterministic systems with a re","authors_text":"Krishnendu Chatterjee, Luca de Alfaro, Rupak Majumdar","cross_cats":["cs.SE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2008-04-29T04:26:08Z","title":"The Complexity of Coverage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.4525","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:57475387626fcfe03427746e026a784d9c04f400718433cc15e900a856d0fe11","target":"record","created_at":"2026-07-04T15:34:43Z","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":"49eb0d764434a37dd26b3d8e3c65a4c49913d23484822c9f561ab3ef7b4d256a","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2008-04-29T04:26:08Z","title_canon_sha256":"dd74c2cd9789c9a377e2a574c08d0b16b8b071d7d24d34815194fc7e397f015c"},"schema_version":"1.0","source":{"id":"0804.4525","kind":"arxiv","version":1}},"canonical_sha256":"b7fe8e15b24a1f56c4fe77ec0484c19dc72a8e1f02f5989a9070529a99d9dc76","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7fe8e15b24a1f56c4fe77ec0484c19dc72a8e1f02f5989a9070529a99d9dc76","first_computed_at":"2026-07-04T15:34:43.412901Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:34:43.412901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dPalrWERVYJJtMc752ikKSfOJ296DmcRjbsH8hIcjAcE7j+kGHQBoZ1wnvB14vWLFYC1rh8/KsTVwyQEWgCoBQ==","signature_status":"signed_v1","signed_at":"2026-07-04T15:34:43.413427Z","signed_message":"canonical_sha256_bytes"},"source_id":"0804.4525","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57475387626fcfe03427746e026a784d9c04f400718433cc15e900a856d0fe11","sha256:5c64d3fbb76dd432a2caf07f7a2dc26293f9bc86e80ca7519c882c0736f0ea98"],"state_sha256":"f9d94ee4a761712279a36db7a5fb9dd391eff943207d36be5bbfb7e64068a591"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QNK53WPTfjIIBkCrERFPANHiU2VqziIMNLr3Tj74V9WsyzumZZUByGV7a83rOpRLogFYFf46pm5beTuH7Wq5CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T10:32:06.240939Z","bundle_sha256":"6bed5ac1d659a75ac0acf57ec9ac7cc1aebeb1c9713e6a9994685b106063f596"}}