{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JET3PL3JXUNQ7JR6AQENZMHLEC","short_pith_number":"pith:JET3PL3J","canonical_record":{"source":{"id":"1706.08608","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2017-06-26T21:32:16Z","cross_cats_sorted":[],"title_canon_sha256":"7b751f2cfb353c1c9b14191c5e18fe50236d81d427668759d847e548f64df6cd","abstract_canon_sha256":"d8de600b213976b36f124ee3279ba65f9d7038dc3bd2b8bc2d4fceb717a79042"},"schema_version":"1.0"},"canonical_sha256":"4927b7af69bd1b0fa63e0408dcb0eb20be7b6c952ec7ec7849fc9041e4d21433","source":{"kind":"arxiv","id":"1706.08608","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08608","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08608v1","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08608","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"JET3PL3JXUNQ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JET3PL3JXUNQ7JR6","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JET3PL3J","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JET3PL3JXUNQ7JR6AQENZMHLEC","target":"record","payload":{"canonical_record":{"source":{"id":"1706.08608","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2017-06-26T21:32:16Z","cross_cats_sorted":[],"title_canon_sha256":"7b751f2cfb353c1c9b14191c5e18fe50236d81d427668759d847e548f64df6cd","abstract_canon_sha256":"d8de600b213976b36f124ee3279ba65f9d7038dc3bd2b8bc2d4fceb717a79042"},"schema_version":"1.0"},"canonical_sha256":"4927b7af69bd1b0fa63e0408dcb0eb20be7b6c952ec7ec7849fc9041e4d21433","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:31.585594Z","signature_b64":"dGX5o/eSND512QxzazOBwCOHyd20tSUrEO9V16rO091KmquvzHQJLThFQYvx5d7HnI2pZmxDo9PGZjE3YFRAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4927b7af69bd1b0fa63e0408dcb0eb20be7b6c952ec7ec7849fc9041e4d21433","last_reissued_at":"2026-05-18T00:41:31.584903Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:31.584903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.08608","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:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MLMMOeLN2QGrnv3h6lkAzgFB80Hcc4FQ+J0xkAHKaMYrzeS1Cm9rY+8Zv7xL14ijUWafobRtD9xmTiit0ddbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:09:25.245084Z"},"content_sha256":"f3408842f9b39f0d8c6870fae73d6e4009d1f02edb22f473c0a29f990fc86749","schema_version":"1.0","event_id":"sha256:f3408842f9b39f0d8c6870fae73d6e4009d1f02edb22f473c0a29f990fc86749"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JET3PL3JXUNQ7JR6AQENZMHLEC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Model-checking Counting Temporal Logics on Flat Structures","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Arnaud Sangnier, Daniel Thoma, Martin Leucker, Normann Decker, Peter Habermehl","submitted_at":"2017-06-26T21:32:16Z","abstract_excerpt":"We study several extensions of linear-time and computation-tree temporal logics with quantifiers that allow for counting how often certain properties hold. For most of these extensions, the model-checking problem is undecidable, but we show that decidability can be recovered by considering flat Kripke structures where each state belongs to at most one simple loop. Most decision procedures are based on results on (flat) counter systems where counters are used to implement the evaluation of counting operators."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08608","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:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GYtjp8vP57ZZAyL0lRIaeB0Rx8fUZQTaikGDXrgODLs4zHqwUoM5Sya2Ce8nYhdc1rt7MZPrHuRsNXWHb7gFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:09:25.245445Z"},"content_sha256":"90be50a89727b2e948b0a3e9c0ac4e6f01851436f74221d4157dd31d7c59784c","schema_version":"1.0","event_id":"sha256:90be50a89727b2e948b0a3e9c0ac4e6f01851436f74221d4157dd31d7c59784c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JET3PL3JXUNQ7JR6AQENZMHLEC/bundle.json","state_url":"https://pith.science/pith/JET3PL3JXUNQ7JR6AQENZMHLEC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JET3PL3JXUNQ7JR6AQENZMHLEC/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-06-11T13:09:25Z","links":{"resolver":"https://pith.science/pith/JET3PL3JXUNQ7JR6AQENZMHLEC","bundle":"https://pith.science/pith/JET3PL3JXUNQ7JR6AQENZMHLEC/bundle.json","state":"https://pith.science/pith/JET3PL3JXUNQ7JR6AQENZMHLEC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JET3PL3JXUNQ7JR6AQENZMHLEC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JET3PL3JXUNQ7JR6AQENZMHLEC","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":"d8de600b213976b36f124ee3279ba65f9d7038dc3bd2b8bc2d4fceb717a79042","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2017-06-26T21:32:16Z","title_canon_sha256":"7b751f2cfb353c1c9b14191c5e18fe50236d81d427668759d847e548f64df6cd"},"schema_version":"1.0","source":{"id":"1706.08608","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08608","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08608v1","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08608","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"JET3PL3JXUNQ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JET3PL3JXUNQ7JR6","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JET3PL3J","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:90be50a89727b2e948b0a3e9c0ac4e6f01851436f74221d4157dd31d7c59784c","target":"graph","created_at":"2026-05-18T00:41:31Z","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 study several extensions of linear-time and computation-tree temporal logics with quantifiers that allow for counting how often certain properties hold. For most of these extensions, the model-checking problem is undecidable, but we show that decidability can be recovered by considering flat Kripke structures where each state belongs to at most one simple loop. Most decision procedures are based on results on (flat) counter systems where counters are used to implement the evaluation of counting operators.","authors_text":"Arnaud Sangnier, Daniel Thoma, Martin Leucker, Normann Decker, Peter Habermehl","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2017-06-26T21:32:16Z","title":"Model-checking Counting Temporal Logics on Flat Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08608","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:f3408842f9b39f0d8c6870fae73d6e4009d1f02edb22f473c0a29f990fc86749","target":"record","created_at":"2026-05-18T00:41:31Z","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":"d8de600b213976b36f124ee3279ba65f9d7038dc3bd2b8bc2d4fceb717a79042","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2017-06-26T21:32:16Z","title_canon_sha256":"7b751f2cfb353c1c9b14191c5e18fe50236d81d427668759d847e548f64df6cd"},"schema_version":"1.0","source":{"id":"1706.08608","kind":"arxiv","version":1}},"canonical_sha256":"4927b7af69bd1b0fa63e0408dcb0eb20be7b6c952ec7ec7849fc9041e4d21433","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4927b7af69bd1b0fa63e0408dcb0eb20be7b6c952ec7ec7849fc9041e4d21433","first_computed_at":"2026-05-18T00:41:31.584903Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:31.584903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dGX5o/eSND512QxzazOBwCOHyd20tSUrEO9V16rO091KmquvzHQJLThFQYvx5d7HnI2pZmxDo9PGZjE3YFRAAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:31.585594Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.08608","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3408842f9b39f0d8c6870fae73d6e4009d1f02edb22f473c0a29f990fc86749","sha256:90be50a89727b2e948b0a3e9c0ac4e6f01851436f74221d4157dd31d7c59784c"],"state_sha256":"e11b53cfca20ac887f6ca166b0882a385c7d24361e7ea09bb88e7506a01b047d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KaPPeKGN0EeLNsAMavmwZP6TDRgVsRj2kOIv+F2nxFgg/pf4J5eBXEAPUy0i5GYDxlA/yQGCgL5kFHmy3qrWBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T13:09:25.247441Z","bundle_sha256":"086447001fb26da428a1bb98428c5e8cd45e661be73dab06c2dc1a090f07f660"}}