{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OCHRTJZHESU6WR47UQPTZDN7JD","short_pith_number":"pith:OCHRTJZH","canonical_record":{"source":{"id":"1312.7603","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-12-29T23:38:16Z","cross_cats_sorted":[],"title_canon_sha256":"bd9555a7fe14c786cfcca200df6923a9f81a5f6ed3b97dade0d2d0a156459930","abstract_canon_sha256":"8b3e1bcdbd4bf9c3de3cffd3b2e9808bdb11e047d3b0fbae12e589aac63c1f16"},"schema_version":"1.0"},"canonical_sha256":"708f19a72724a9eb479fa41f3c8dbf48ea47be9b6d0625a4cec77d096d7cee85","source":{"kind":"arxiv","id":"1312.7603","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7603","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7603v3","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7603","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"OCHRTJZHESU6","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OCHRTJZHESU6WR47","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OCHRTJZH","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OCHRTJZHESU6WR47UQPTZDN7JD","target":"record","payload":{"canonical_record":{"source":{"id":"1312.7603","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-12-29T23:38:16Z","cross_cats_sorted":[],"title_canon_sha256":"bd9555a7fe14c786cfcca200df6923a9f81a5f6ed3b97dade0d2d0a156459930","abstract_canon_sha256":"8b3e1bcdbd4bf9c3de3cffd3b2e9808bdb11e047d3b0fbae12e589aac63c1f16"},"schema_version":"1.0"},"canonical_sha256":"708f19a72724a9eb479fa41f3c8dbf48ea47be9b6d0625a4cec77d096d7cee85","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:07.554869Z","signature_b64":"bl623vRuJURSuST7oHi5YJYqar35qBumgfKw7VZkEDAlz1KcGlZ8rLAlkWeC8piLv39X2XwnO2ytAch6O2nQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"708f19a72724a9eb479fa41f3c8dbf48ea47be9b6d0625a4cec77d096d7cee85","last_reissued_at":"2026-05-18T02:53:07.554161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:07.554161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.7603","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-18T02:53:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bFvn+oJLhh9e3AGzRJ9bmkTn8f1oMAKJI2Cekz0MVVfyf+ECDSRJXqgLH7AVTUXs4hxYcVpu6UWf4R+OnD/JDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T14:10:48.571451Z"},"content_sha256":"12ce045374f2b25dc50731494b117ba0f5d4e63cb22d6a0af808a8b944da4afd","schema_version":"1.0","event_id":"sha256:12ce045374f2b25dc50731494b117ba0f5d4e63cb22d6a0af808a8b944da4afd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OCHRTJZHESU6WR47UQPTZDN7JD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Temporal-Logic Path Checking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Daniel Bundala, Jo\\\"el Ouaknine","submitted_at":"2013-12-29T23:38:16Z","abstract_excerpt":"Given a formula in a temporal logic such as LTL or MTL, a fundamental problem is the complexity of evaluating the formula on a given finite word. For LTL, the complexity of this task was recently shown to be in NC. In this paper, we present an NC algorithm for MTL, a quantitative (or metric) extension of LTL, and give an NCC algorithm for UTL, the unary fragment of LTL. At the time of writing, MTL is the most expressive logic with an NC path-checking algorithm, and UTL is the most expressive fragment of LTL with a more efficient path-checking algorithm than for full LTL (subject to standard co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7603","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-18T02:53:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cWh/1M8kiuWCCjdjCswflnDUbxMKaEdm6KJFVkvU0tZSOQKlFtVu5723a9N4wT9bhZvV8L2ZOqUp+0zOnY5yDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T14:10:48.571801Z"},"content_sha256":"a0fbbd0067f9618e32d7a316b64017c94841ddeac0f6c736cd06fcff8f3a3dfb","schema_version":"1.0","event_id":"sha256:a0fbbd0067f9618e32d7a316b64017c94841ddeac0f6c736cd06fcff8f3a3dfb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OCHRTJZHESU6WR47UQPTZDN7JD/bundle.json","state_url":"https://pith.science/pith/OCHRTJZHESU6WR47UQPTZDN7JD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OCHRTJZHESU6WR47UQPTZDN7JD/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-29T14:10:48Z","links":{"resolver":"https://pith.science/pith/OCHRTJZHESU6WR47UQPTZDN7JD","bundle":"https://pith.science/pith/OCHRTJZHESU6WR47UQPTZDN7JD/bundle.json","state":"https://pith.science/pith/OCHRTJZHESU6WR47UQPTZDN7JD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OCHRTJZHESU6WR47UQPTZDN7JD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OCHRTJZHESU6WR47UQPTZDN7JD","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":"8b3e1bcdbd4bf9c3de3cffd3b2e9808bdb11e047d3b0fbae12e589aac63c1f16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-12-29T23:38:16Z","title_canon_sha256":"bd9555a7fe14c786cfcca200df6923a9f81a5f6ed3b97dade0d2d0a156459930"},"schema_version":"1.0","source":{"id":"1312.7603","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7603","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7603v3","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7603","created_at":"2026-05-18T02:53:07Z"},{"alias_kind":"pith_short_12","alias_value":"OCHRTJZHESU6","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OCHRTJZHESU6WR47","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OCHRTJZH","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:a0fbbd0067f9618e32d7a316b64017c94841ddeac0f6c736cd06fcff8f3a3dfb","target":"graph","created_at":"2026-05-18T02:53:07Z","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":"Given a formula in a temporal logic such as LTL or MTL, a fundamental problem is the complexity of evaluating the formula on a given finite word. For LTL, the complexity of this task was recently shown to be in NC. In this paper, we present an NC algorithm for MTL, a quantitative (or metric) extension of LTL, and give an NCC algorithm for UTL, the unary fragment of LTL. At the time of writing, MTL is the most expressive logic with an NC path-checking algorithm, and UTL is the most expressive fragment of LTL with a more efficient path-checking algorithm than for full LTL (subject to standard co","authors_text":"Daniel Bundala, Jo\\\"el Ouaknine","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-12-29T23:38:16Z","title":"On the Complexity of Temporal-Logic Path Checking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7603","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:12ce045374f2b25dc50731494b117ba0f5d4e63cb22d6a0af808a8b944da4afd","target":"record","created_at":"2026-05-18T02:53:07Z","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":"8b3e1bcdbd4bf9c3de3cffd3b2e9808bdb11e047d3b0fbae12e589aac63c1f16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-12-29T23:38:16Z","title_canon_sha256":"bd9555a7fe14c786cfcca200df6923a9f81a5f6ed3b97dade0d2d0a156459930"},"schema_version":"1.0","source":{"id":"1312.7603","kind":"arxiv","version":3}},"canonical_sha256":"708f19a72724a9eb479fa41f3c8dbf48ea47be9b6d0625a4cec77d096d7cee85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"708f19a72724a9eb479fa41f3c8dbf48ea47be9b6d0625a4cec77d096d7cee85","first_computed_at":"2026-05-18T02:53:07.554161Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:07.554161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bl623vRuJURSuST7oHi5YJYqar35qBumgfKw7VZkEDAlz1KcGlZ8rLAlkWeC8piLv39X2XwnO2ytAch6O2nQBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:07.554869Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.7603","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12ce045374f2b25dc50731494b117ba0f5d4e63cb22d6a0af808a8b944da4afd","sha256:a0fbbd0067f9618e32d7a316b64017c94841ddeac0f6c736cd06fcff8f3a3dfb"],"state_sha256":"d1b8e18d561e15251933889c3078de7c7fe0a048c091377270daf7b527a8c2b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TamIJOCGxy6boyFW88bIMeNyNUQPkaL6nSx7oylK14XOgowxOmg2Xdj67b1/0QRX9Wma6enHruAD6fqHsK/vCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T14:10:48.573694Z","bundle_sha256":"841f1f9122ec3e6a9a0450b3efbb225193af792a9b1d79b28c16b86dff5e59d8"}}