{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VKT33CXEJZYK3JJE7IVQ7TTT7W","short_pith_number":"pith:VKT33CXE","canonical_record":{"source":{"id":"1711.08151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-11-22T06:43:21Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b354f96e05f4d3fb5d646e7e5a1a44fc9851923bd53502ebb4f1780aca4bb9a7","abstract_canon_sha256":"836722934705525443efdcbd6f52afa9a21a484ed642b17d0958da6a7d23fbfd"},"schema_version":"1.0"},"canonical_sha256":"aaa7bd8ae44e70ada524fa2b0fce73fd855f5a4062dacabb4374b25dfc8edb32","source":{"kind":"arxiv","id":"1711.08151","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08151","created_at":"2026-05-18T00:29:50Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08151v1","created_at":"2026-05-18T00:29:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08151","created_at":"2026-05-18T00:29:50Z"},{"alias_kind":"pith_short_12","alias_value":"VKT33CXEJZYK","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VKT33CXEJZYK3JJE","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VKT33CXE","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VKT33CXEJZYK3JJE7IVQ7TTT7W","target":"record","payload":{"canonical_record":{"source":{"id":"1711.08151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-11-22T06:43:21Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b354f96e05f4d3fb5d646e7e5a1a44fc9851923bd53502ebb4f1780aca4bb9a7","abstract_canon_sha256":"836722934705525443efdcbd6f52afa9a21a484ed642b17d0958da6a7d23fbfd"},"schema_version":"1.0"},"canonical_sha256":"aaa7bd8ae44e70ada524fa2b0fce73fd855f5a4062dacabb4374b25dfc8edb32","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:50.552537Z","signature_b64":"pCkTyW8DXRjloCfA9IfBFltsBfVs5UHPxoiuosJDBjkTlDW/BcV9yjwQ5A7J2Uoq/2Q22y0isudA12a1oXrCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aaa7bd8ae44e70ada524fa2b0fce73fd855f5a4062dacabb4374b25dfc8edb32","last_reissued_at":"2026-05-18T00:29:50.551931Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:50.551931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.08151","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:29:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xXgxyLm2KKztxUcr1YU6KluCLlASV/+xx6HX3ZTPy3t4xl7ye9zp8OVRIBx8zzeMWO2EMezKpw7cvBC+3+hBDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:34:49.967108Z"},"content_sha256":"446cb3553b099397bedc181726803361749274a1d5a33c3e8fe94f2b3902d365","schema_version":"1.0","event_id":"sha256:446cb3553b099397bedc181726803361749274a1d5a33c3e8fe94f2b3902d365"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VKT33CXEJZYK3JJE7IVQ7TTT7W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiagent Simple Temporal Problem: The Arc-Consistency Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.MA","authors_text":"Jae Hee Lee, Sanjiang Li, Shufeng Kong","submitted_at":"2017-11-22T06:43:21Z","abstract_excerpt":"The Simple Temporal Problem (STP) is a fundamental temporal reasoning problem and has recently been extended to the Multiagent Simple Temporal Problem (MaSTP). In this paper we present a novel approach that is based on enforcing arc-consistency (AC) on the input (multiagent) simple temporal network. We show that the AC-based approach is sufficient for solving both the STP and MaSTP and provide efficient algorithms for them. As our AC-based approach does not impose new constraints between agents, it does not violate the privacy of the agents and is superior to the state-of-the-art approach to M"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08151","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:29:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kWIH1RhzkR8CxH05p5NXwXUxsCJRGjV2Ivc6b72AXVJqbdxqW2CALfsm/Ba3jxqRx62pqk9Qf/7Fj0f+duSDBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:34:49.967465Z"},"content_sha256":"1af0d11ddb6a07c3e000c8532db98dd929f813032c9fd74af1d609464e1b6c67","schema_version":"1.0","event_id":"sha256:1af0d11ddb6a07c3e000c8532db98dd929f813032c9fd74af1d609464e1b6c67"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VKT33CXEJZYK3JJE7IVQ7TTT7W/bundle.json","state_url":"https://pith.science/pith/VKT33CXEJZYK3JJE7IVQ7TTT7W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VKT33CXEJZYK3JJE7IVQ7TTT7W/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-03T07:34:49Z","links":{"resolver":"https://pith.science/pith/VKT33CXEJZYK3JJE7IVQ7TTT7W","bundle":"https://pith.science/pith/VKT33CXEJZYK3JJE7IVQ7TTT7W/bundle.json","state":"https://pith.science/pith/VKT33CXEJZYK3JJE7IVQ7TTT7W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VKT33CXEJZYK3JJE7IVQ7TTT7W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VKT33CXEJZYK3JJE7IVQ7TTT7W","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":"836722934705525443efdcbd6f52afa9a21a484ed642b17d0958da6a7d23fbfd","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-11-22T06:43:21Z","title_canon_sha256":"b354f96e05f4d3fb5d646e7e5a1a44fc9851923bd53502ebb4f1780aca4bb9a7"},"schema_version":"1.0","source":{"id":"1711.08151","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08151","created_at":"2026-05-18T00:29:50Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08151v1","created_at":"2026-05-18T00:29:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08151","created_at":"2026-05-18T00:29:50Z"},{"alias_kind":"pith_short_12","alias_value":"VKT33CXEJZYK","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VKT33CXEJZYK3JJE","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VKT33CXE","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:1af0d11ddb6a07c3e000c8532db98dd929f813032c9fd74af1d609464e1b6c67","target":"graph","created_at":"2026-05-18T00:29:50Z","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":"The Simple Temporal Problem (STP) is a fundamental temporal reasoning problem and has recently been extended to the Multiagent Simple Temporal Problem (MaSTP). In this paper we present a novel approach that is based on enforcing arc-consistency (AC) on the input (multiagent) simple temporal network. We show that the AC-based approach is sufficient for solving both the STP and MaSTP and provide efficient algorithms for them. As our AC-based approach does not impose new constraints between agents, it does not violate the privacy of the agents and is superior to the state-of-the-art approach to M","authors_text":"Jae Hee Lee, Sanjiang Li, Shufeng Kong","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-11-22T06:43:21Z","title":"Multiagent Simple Temporal Problem: The Arc-Consistency Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08151","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:446cb3553b099397bedc181726803361749274a1d5a33c3e8fe94f2b3902d365","target":"record","created_at":"2026-05-18T00:29:50Z","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":"836722934705525443efdcbd6f52afa9a21a484ed642b17d0958da6a7d23fbfd","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-11-22T06:43:21Z","title_canon_sha256":"b354f96e05f4d3fb5d646e7e5a1a44fc9851923bd53502ebb4f1780aca4bb9a7"},"schema_version":"1.0","source":{"id":"1711.08151","kind":"arxiv","version":1}},"canonical_sha256":"aaa7bd8ae44e70ada524fa2b0fce73fd855f5a4062dacabb4374b25dfc8edb32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aaa7bd8ae44e70ada524fa2b0fce73fd855f5a4062dacabb4374b25dfc8edb32","first_computed_at":"2026-05-18T00:29:50.551931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:50.551931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pCkTyW8DXRjloCfA9IfBFltsBfVs5UHPxoiuosJDBjkTlDW/BcV9yjwQ5A7J2Uoq/2Q22y0isudA12a1oXrCAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:50.552537Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.08151","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:446cb3553b099397bedc181726803361749274a1d5a33c3e8fe94f2b3902d365","sha256:1af0d11ddb6a07c3e000c8532db98dd929f813032c9fd74af1d609464e1b6c67"],"state_sha256":"b65880535452213a25d7164b97699ff028bbb2fa436fb2276d1e434a018ff814"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9dzso09rHfjLwn0/g8bU8ElduR9s05rNMxKhRK4uJgmXzaXytq9JmpwxEqTjoOWjiU6q/dgw084uKN3IygKyCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:34:49.969434Z","bundle_sha256":"e536f6b3a724cbc45fa3c2247855d72d9a134c4cbf40ec0ceef2827c9536378d"}}