{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:MFDRUCBCHSGXXSEDHEAKSFGVFG","short_pith_number":"pith:MFDRUCBC","canonical_record":{"source":{"id":"2506.07802","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-06-09T14:32:03Z","cross_cats_sorted":[],"title_canon_sha256":"76b4b35ca875a70d1f295a9c4f251b9df8355bc35fb74cbd0ff65d95c344ef14","abstract_canon_sha256":"2cd18aece521b9c9cb89a03c999e970e752368659e62e816070b663ab2335be5"},"schema_version":"1.0"},"canonical_sha256":"61471a08223c8d7bc8833900a914d529a1d34be811b2389ef3d0711855968778","source":{"kind":"arxiv","id":"2506.07802","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.07802","created_at":"2026-07-05T11:18:33Z"},{"alias_kind":"arxiv_version","alias_value":"2506.07802v1","created_at":"2026-07-05T11:18:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.07802","created_at":"2026-07-05T11:18:33Z"},{"alias_kind":"pith_short_12","alias_value":"MFDRUCBCHSGX","created_at":"2026-07-05T11:18:33Z"},{"alias_kind":"pith_short_16","alias_value":"MFDRUCBCHSGXXSED","created_at":"2026-07-05T11:18:33Z"},{"alias_kind":"pith_short_8","alias_value":"MFDRUCBC","created_at":"2026-07-05T11:18:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:MFDRUCBCHSGXXSEDHEAKSFGVFG","target":"record","payload":{"canonical_record":{"source":{"id":"2506.07802","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-06-09T14:32:03Z","cross_cats_sorted":[],"title_canon_sha256":"76b4b35ca875a70d1f295a9c4f251b9df8355bc35fb74cbd0ff65d95c344ef14","abstract_canon_sha256":"2cd18aece521b9c9cb89a03c999e970e752368659e62e816070b663ab2335be5"},"schema_version":"1.0"},"canonical_sha256":"61471a08223c8d7bc8833900a914d529a1d34be811b2389ef3d0711855968778","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:18:33.673259Z","signature_b64":"IbW18Ao8KcAneuU/eJYse+5fj7nOA9T4N0FqJsIX3EKbGbCbr/Kw+4E/BNx3wWGWcAZ/ydeIm3JR7HREmfvGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61471a08223c8d7bc8833900a914d529a1d34be811b2389ef3d0711855968778","last_reissued_at":"2026-07-05T11:18:33.672782Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:18:33.672782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.07802","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-05T11:18:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/FVksSCSp1LymyVFfOKf14H5G4sZjsLc6Md1BxMa6UOyZjIJAVtc13/TTZNyte0JSQOM7wAnGgC39NHvQJAfAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T17:41:02.757136Z"},"content_sha256":"d80055230943531a900ee93f356167ad1ccd2799ebb0801dae3cb62bf87b5938","schema_version":"1.0","event_id":"sha256:d80055230943531a900ee93f356167ad1ccd2799ebb0801dae3cb62bf87b5938"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:MFDRUCBCHSGXXSEDHEAKSFGVFG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On-The-Fly Symbolic Algorithm for Timed ATL with Abstractions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Didier Lime, Ji\\v{r}\\'i Srba, Kim G. Larsen, Nicolaj {\\O}. Jensen","submitted_at":"2025-06-09T14:32:03Z","abstract_excerpt":"Verification of real-time systems with multiple components controlled by multiple parties is a challenging task due to its computational complexity. We present an on-the-fly algorithm for verifying timed alternating-time temporal logic (TATL), a branching-time logic with quantifiers over outcomes that results from coalitions of players in such systems. We combine existing work on games and timed CTL verification in the abstract dependency graph (ADG) framework, which allows for easy creation of on-the-fly algorithms that only explore the state space as needed. In addition, we generalize the co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.07802","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/2506.07802/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-05T11:18:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cR/iSMMfyFSgTNPXclc+5NjXf7dWPFVFRWowh8yA0DFtS/KQotQrJR7QbQpjDXv4H6Hht0H4wlbk0Q+i4J4UDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T17:41:02.757645Z"},"content_sha256":"a56c79dcfcc5ea39cba4281a4dba5ceeaa78f616081fb7c0221f56904129934c","schema_version":"1.0","event_id":"sha256:a56c79dcfcc5ea39cba4281a4dba5ceeaa78f616081fb7c0221f56904129934c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MFDRUCBCHSGXXSEDHEAKSFGVFG/bundle.json","state_url":"https://pith.science/pith/MFDRUCBCHSGXXSEDHEAKSFGVFG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MFDRUCBCHSGXXSEDHEAKSFGVFG/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-08T17:41:02Z","links":{"resolver":"https://pith.science/pith/MFDRUCBCHSGXXSEDHEAKSFGVFG","bundle":"https://pith.science/pith/MFDRUCBCHSGXXSEDHEAKSFGVFG/bundle.json","state":"https://pith.science/pith/MFDRUCBCHSGXXSEDHEAKSFGVFG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MFDRUCBCHSGXXSEDHEAKSFGVFG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:MFDRUCBCHSGXXSEDHEAKSFGVFG","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":"2cd18aece521b9c9cb89a03c999e970e752368659e62e816070b663ab2335be5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-06-09T14:32:03Z","title_canon_sha256":"76b4b35ca875a70d1f295a9c4f251b9df8355bc35fb74cbd0ff65d95c344ef14"},"schema_version":"1.0","source":{"id":"2506.07802","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.07802","created_at":"2026-07-05T11:18:33Z"},{"alias_kind":"arxiv_version","alias_value":"2506.07802v1","created_at":"2026-07-05T11:18:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.07802","created_at":"2026-07-05T11:18:33Z"},{"alias_kind":"pith_short_12","alias_value":"MFDRUCBCHSGX","created_at":"2026-07-05T11:18:33Z"},{"alias_kind":"pith_short_16","alias_value":"MFDRUCBCHSGXXSED","created_at":"2026-07-05T11:18:33Z"},{"alias_kind":"pith_short_8","alias_value":"MFDRUCBC","created_at":"2026-07-05T11:18:33Z"}],"graph_snapshots":[{"event_id":"sha256:a56c79dcfcc5ea39cba4281a4dba5ceeaa78f616081fb7c0221f56904129934c","target":"graph","created_at":"2026-07-05T11:18: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.07802/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Verification of real-time systems with multiple components controlled by multiple parties is a challenging task due to its computational complexity. We present an on-the-fly algorithm for verifying timed alternating-time temporal logic (TATL), a branching-time logic with quantifiers over outcomes that results from coalitions of players in such systems. We combine existing work on games and timed CTL verification in the abstract dependency graph (ADG) framework, which allows for easy creation of on-the-fly algorithms that only explore the state space as needed. In addition, we generalize the co","authors_text":"Didier Lime, Ji\\v{r}\\'i Srba, Kim G. Larsen, Nicolaj {\\O}. Jensen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-06-09T14:32:03Z","title":"On-The-Fly Symbolic Algorithm for Timed ATL with Abstractions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.07802","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:d80055230943531a900ee93f356167ad1ccd2799ebb0801dae3cb62bf87b5938","target":"record","created_at":"2026-07-05T11:18: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":"2cd18aece521b9c9cb89a03c999e970e752368659e62e816070b663ab2335be5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2025-06-09T14:32:03Z","title_canon_sha256":"76b4b35ca875a70d1f295a9c4f251b9df8355bc35fb74cbd0ff65d95c344ef14"},"schema_version":"1.0","source":{"id":"2506.07802","kind":"arxiv","version":1}},"canonical_sha256":"61471a08223c8d7bc8833900a914d529a1d34be811b2389ef3d0711855968778","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61471a08223c8d7bc8833900a914d529a1d34be811b2389ef3d0711855968778","first_computed_at":"2026-07-05T11:18:33.672782Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:18:33.672782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IbW18Ao8KcAneuU/eJYse+5fj7nOA9T4N0FqJsIX3EKbGbCbr/Kw+4E/BNx3wWGWcAZ/ydeIm3JR7HREmfvGBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:18:33.673259Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.07802","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d80055230943531a900ee93f356167ad1ccd2799ebb0801dae3cb62bf87b5938","sha256:a56c79dcfcc5ea39cba4281a4dba5ceeaa78f616081fb7c0221f56904129934c"],"state_sha256":"5daf7412126c4807685dd26539f622887e1c4749ea85b26a8afcda115f6e80e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ljejgsfgsbvhV4nlqRPzi2R0N/N/UaEVX6zwYn2mn/r1bZL7UTdG+K+Q3N9NtJqCpnY/xzU5lhx6TMctPxr0BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T17:41:02.761856Z","bundle_sha256":"bb53de5dabdceab20ab0e8e836493078d66dd91dfebb7bee22b1125ca82a0677"}}