{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5LV2SCNCEIWAUNYVRVLPMNVIIY","short_pith_number":"pith:5LV2SCNC","canonical_record":{"source":{"id":"1410.4950","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-18T12:12:05Z","cross_cats_sorted":[],"title_canon_sha256":"fe9f57ce4564a387f20a93dd344263e3be34565953125727ec010dee0f2c178e","abstract_canon_sha256":"885a6cf096c274f18569dc440941b7f02c8f6ace8bb51e67cc0c47f00fe0acd2"},"schema_version":"1.0"},"canonical_sha256":"eaeba909a2222c0a37158d56f636a8460fcd1fc480609b8ea45018b9b7a8572b","source":{"kind":"arxiv","id":"1410.4950","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4950","created_at":"2026-05-18T01:27:36Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4950v4","created_at":"2026-05-18T01:27:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4950","created_at":"2026-05-18T01:27:36Z"},{"alias_kind":"pith_short_12","alias_value":"5LV2SCNCEIWA","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5LV2SCNCEIWAUNYV","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5LV2SCNC","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5LV2SCNCEIWAUNYVRVLPMNVIIY","target":"record","payload":{"canonical_record":{"source":{"id":"1410.4950","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-18T12:12:05Z","cross_cats_sorted":[],"title_canon_sha256":"fe9f57ce4564a387f20a93dd344263e3be34565953125727ec010dee0f2c178e","abstract_canon_sha256":"885a6cf096c274f18569dc440941b7f02c8f6ace8bb51e67cc0c47f00fe0acd2"},"schema_version":"1.0"},"canonical_sha256":"eaeba909a2222c0a37158d56f636a8460fcd1fc480609b8ea45018b9b7a8572b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:36.713241Z","signature_b64":"HBKZQGXSVSAijXvQZjGB4sYtS9BPTnI3ax71Gm7dXY5R1wDGmtTGABbqgIrSvXaJ3T8zypCMM3CobLWePCgtBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eaeba909a2222c0a37158d56f636a8460fcd1fc480609b8ea45018b9b7a8572b","last_reissued_at":"2026-05-18T01:27:36.712669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:36.712669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.4950","source_version":4,"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-18T01:27:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bu5InIkvAAvUTz1zGr30tFQer4ENzboUMrNdKpCbu+HWx4UZllsbR0exV0mxdlzfYly5rRByl9iFeQcDJbwoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:08:58.290210Z"},"content_sha256":"73844bcd4e66e995c2604495b55e9752018c978e28a927616dc621b050bce26c","schema_version":"1.0","event_id":"sha256:73844bcd4e66e995c2604495b55e9752018c978e28a927616dc621b050bce26c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5LV2SCNCEIWAUNYVRVLPMNVIIY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-Optimal Scheduling for LTL with Future Discounting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ichiro Hasuo, Shota Nakagawa","submitted_at":"2014-10-18T12:12:05Z","abstract_excerpt":"We study the search problem for optimal schedulers for the linear temporal logic (LTL) with future discounting. The logic, introduced by Almagor, Boker and Kupferman, is a quantitative variant of LTL in which an event in the far future has only discounted contribution to a truth value (that is a real number in the unit interval [0, 1]). The precise problem we study---it naturally arises e.g. in search for a scheduler that recovers from an internal error state as soon as possible---is the following: given a Kripke frame, a formula and a number in [0, 1] called a margin, find a path of the Kripk"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4950","kind":"arxiv","version":4},"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-18T01:27:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y9unhnL4dYUT1GWljdoJZN5SdwTU4/45oqZi29Vcxj/c/rsaKw0If07hOUdRzsAzdD/Z96GpJwTv7nJdZPusCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:08:58.290874Z"},"content_sha256":"ee1145024066289d95cd3799aa8dd4e6abda01ea21bf504e6e180ef0751f4d0d","schema_version":"1.0","event_id":"sha256:ee1145024066289d95cd3799aa8dd4e6abda01ea21bf504e6e180ef0751f4d0d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5LV2SCNCEIWAUNYVRVLPMNVIIY/bundle.json","state_url":"https://pith.science/pith/5LV2SCNCEIWAUNYVRVLPMNVIIY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5LV2SCNCEIWAUNYVRVLPMNVIIY/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-31T02:08:58Z","links":{"resolver":"https://pith.science/pith/5LV2SCNCEIWAUNYVRVLPMNVIIY","bundle":"https://pith.science/pith/5LV2SCNCEIWAUNYVRVLPMNVIIY/bundle.json","state":"https://pith.science/pith/5LV2SCNCEIWAUNYVRVLPMNVIIY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5LV2SCNCEIWAUNYVRVLPMNVIIY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5LV2SCNCEIWAUNYVRVLPMNVIIY","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":"885a6cf096c274f18569dc440941b7f02c8f6ace8bb51e67cc0c47f00fe0acd2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-18T12:12:05Z","title_canon_sha256":"fe9f57ce4564a387f20a93dd344263e3be34565953125727ec010dee0f2c178e"},"schema_version":"1.0","source":{"id":"1410.4950","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4950","created_at":"2026-05-18T01:27:36Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4950v4","created_at":"2026-05-18T01:27:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4950","created_at":"2026-05-18T01:27:36Z"},{"alias_kind":"pith_short_12","alias_value":"5LV2SCNCEIWA","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5LV2SCNCEIWAUNYV","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5LV2SCNC","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:ee1145024066289d95cd3799aa8dd4e6abda01ea21bf504e6e180ef0751f4d0d","target":"graph","created_at":"2026-05-18T01:27:36Z","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 the search problem for optimal schedulers for the linear temporal logic (LTL) with future discounting. The logic, introduced by Almagor, Boker and Kupferman, is a quantitative variant of LTL in which an event in the far future has only discounted contribution to a truth value (that is a real number in the unit interval [0, 1]). The precise problem we study---it naturally arises e.g. in search for a scheduler that recovers from an internal error state as soon as possible---is the following: given a Kripke frame, a formula and a number in [0, 1] called a margin, find a path of the Kripk","authors_text":"Ichiro Hasuo, Shota Nakagawa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-18T12:12:05Z","title":"Near-Optimal Scheduling for LTL with Future Discounting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4950","kind":"arxiv","version":4},"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:73844bcd4e66e995c2604495b55e9752018c978e28a927616dc621b050bce26c","target":"record","created_at":"2026-05-18T01:27:36Z","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":"885a6cf096c274f18569dc440941b7f02c8f6ace8bb51e67cc0c47f00fe0acd2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-18T12:12:05Z","title_canon_sha256":"fe9f57ce4564a387f20a93dd344263e3be34565953125727ec010dee0f2c178e"},"schema_version":"1.0","source":{"id":"1410.4950","kind":"arxiv","version":4}},"canonical_sha256":"eaeba909a2222c0a37158d56f636a8460fcd1fc480609b8ea45018b9b7a8572b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eaeba909a2222c0a37158d56f636a8460fcd1fc480609b8ea45018b9b7a8572b","first_computed_at":"2026-05-18T01:27:36.712669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:36.712669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HBKZQGXSVSAijXvQZjGB4sYtS9BPTnI3ax71Gm7dXY5R1wDGmtTGABbqgIrSvXaJ3T8zypCMM3CobLWePCgtBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:36.713241Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.4950","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73844bcd4e66e995c2604495b55e9752018c978e28a927616dc621b050bce26c","sha256:ee1145024066289d95cd3799aa8dd4e6abda01ea21bf504e6e180ef0751f4d0d"],"state_sha256":"8424c0a5c44c03e3329680460e43cd2ebc578c8fe781286c52177069c3fe6223"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0AEuhRXhSeJU5qddmV5F09St1btHqdSH3If1VloGlyZ/IaGmJ7Dl+Q9Sz8sUEnT0YMAq1ogICyMiM1u6Wc+yBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:08:58.294170Z","bundle_sha256":"864581b6642dffb265cbd28d169e988d27a39abbcb50df91338ef01cc5c9e848"}}