{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5UIAIQ5YXCN5VK7EHCTPFTTXXL","short_pith_number":"pith:5UIAIQ5Y","canonical_record":{"source":{"id":"1904.09184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-04-18T07:59:44Z","cross_cats_sorted":[],"title_canon_sha256":"a56bd5a6de0e126d594c87f1662adaa84dabfc8630daba924d96bdd0cfa5eeb6","abstract_canon_sha256":"bb278c6635367dc7d699ccbceb7b0583c56adb21cff289d8d28967e0959c5843"},"schema_version":"1.0"},"canonical_sha256":"ed100443b8b89bdaabe438a6f2ce77baf02609873b7b1a1b201f63b44ce8810d","source":{"kind":"arxiv","id":"1904.09184","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09184","created_at":"2026-05-17T23:48:08Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09184v1","created_at":"2026-05-17T23:48:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09184","created_at":"2026-05-17T23:48:08Z"},{"alias_kind":"pith_short_12","alias_value":"5UIAIQ5YXCN5","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5UIAIQ5YXCN5VK7E","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5UIAIQ5Y","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5UIAIQ5YXCN5VK7EHCTPFTTXXL","target":"record","payload":{"canonical_record":{"source":{"id":"1904.09184","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-04-18T07:59:44Z","cross_cats_sorted":[],"title_canon_sha256":"a56bd5a6de0e126d594c87f1662adaa84dabfc8630daba924d96bdd0cfa5eeb6","abstract_canon_sha256":"bb278c6635367dc7d699ccbceb7b0583c56adb21cff289d8d28967e0959c5843"},"schema_version":"1.0"},"canonical_sha256":"ed100443b8b89bdaabe438a6f2ce77baf02609873b7b1a1b201f63b44ce8810d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:08.080431Z","signature_b64":"vhn34X5A/F/5dbg2A6d+XADXaopDTvWxy4xJdqaRwsMRKcgXatd/i+3sDN8FnVWIaDrtB7nPclEDUlHbjSOZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed100443b8b89bdaabe438a6f2ce77baf02609873b7b1a1b201f63b44ce8810d","last_reissued_at":"2026-05-17T23:48:08.079977Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:08.079977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.09184","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-17T23:48:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YW9KnZm65GpzLmuYZFVomPIhEazjUQuHOC5JQpfDSWPbjt7UL6JuOHsBdghsDxhxbH67zKGA0Nr9GFD/HxQMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:29:46.070167Z"},"content_sha256":"056293cd53ba8cdb082a7ece88e40ae9915f663287dbb530011f987c339f151a","schema_version":"1.0","event_id":"sha256:056293cd53ba8cdb082a7ece88e40ae9915f663287dbb530011f987c339f151a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5UIAIQ5YXCN5VK7EHCTPFTTXXL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Undecidability of future timeline-based planning over dense temporal domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Adriano Peron, Alberto Molinari, Angelo Montanari, Laura Bozzelli","submitted_at":"2019-04-18T07:59:44Z","abstract_excerpt":"Planning is one of the most studied problems in computer science. In this paper, we consider the timeline-based approach, where the domain is modeled by a set of independent, but interacting, components, identified by a set of state variables, whose behavior over time (timelines) is governed by a set of temporal constraints (synchronization rules). Timeline-based planning in the dense-time setting has been recently shown to be undecidable in the general case, and undecidability relies on the high expressiveness of the trigger synchronization rules. In this paper, we strengthen the previous neg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09184","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-17T23:48:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lg+UBOTS2WjaR+/2b75IwfBKmOOJsxVR3YMYY6YkkDKOKs0HC4CIYiboWA/Wqb+fADfyLWre4UgKftdiYAi2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:29:46.070524Z"},"content_sha256":"3d8974722ebdc1494d422f6f1ad986094e8cad5a91d4c8fcecd5ed1ddbe60ce6","schema_version":"1.0","event_id":"sha256:3d8974722ebdc1494d422f6f1ad986094e8cad5a91d4c8fcecd5ed1ddbe60ce6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5UIAIQ5YXCN5VK7EHCTPFTTXXL/bundle.json","state_url":"https://pith.science/pith/5UIAIQ5YXCN5VK7EHCTPFTTXXL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5UIAIQ5YXCN5VK7EHCTPFTTXXL/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-23T08:29:46Z","links":{"resolver":"https://pith.science/pith/5UIAIQ5YXCN5VK7EHCTPFTTXXL","bundle":"https://pith.science/pith/5UIAIQ5YXCN5VK7EHCTPFTTXXL/bundle.json","state":"https://pith.science/pith/5UIAIQ5YXCN5VK7EHCTPFTTXXL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5UIAIQ5YXCN5VK7EHCTPFTTXXL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5UIAIQ5YXCN5VK7EHCTPFTTXXL","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":"bb278c6635367dc7d699ccbceb7b0583c56adb21cff289d8d28967e0959c5843","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-04-18T07:59:44Z","title_canon_sha256":"a56bd5a6de0e126d594c87f1662adaa84dabfc8630daba924d96bdd0cfa5eeb6"},"schema_version":"1.0","source":{"id":"1904.09184","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09184","created_at":"2026-05-17T23:48:08Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09184v1","created_at":"2026-05-17T23:48:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09184","created_at":"2026-05-17T23:48:08Z"},{"alias_kind":"pith_short_12","alias_value":"5UIAIQ5YXCN5","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5UIAIQ5YXCN5VK7E","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5UIAIQ5Y","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:3d8974722ebdc1494d422f6f1ad986094e8cad5a91d4c8fcecd5ed1ddbe60ce6","target":"graph","created_at":"2026-05-17T23:48:08Z","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":"Planning is one of the most studied problems in computer science. In this paper, we consider the timeline-based approach, where the domain is modeled by a set of independent, but interacting, components, identified by a set of state variables, whose behavior over time (timelines) is governed by a set of temporal constraints (synchronization rules). Timeline-based planning in the dense-time setting has been recently shown to be undecidable in the general case, and undecidability relies on the high expressiveness of the trigger synchronization rules. In this paper, we strengthen the previous neg","authors_text":"Adriano Peron, Alberto Molinari, Angelo Montanari, Laura Bozzelli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-04-18T07:59:44Z","title":"Undecidability of future timeline-based planning over dense temporal domains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09184","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:056293cd53ba8cdb082a7ece88e40ae9915f663287dbb530011f987c339f151a","target":"record","created_at":"2026-05-17T23:48:08Z","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":"bb278c6635367dc7d699ccbceb7b0583c56adb21cff289d8d28967e0959c5843","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-04-18T07:59:44Z","title_canon_sha256":"a56bd5a6de0e126d594c87f1662adaa84dabfc8630daba924d96bdd0cfa5eeb6"},"schema_version":"1.0","source":{"id":"1904.09184","kind":"arxiv","version":1}},"canonical_sha256":"ed100443b8b89bdaabe438a6f2ce77baf02609873b7b1a1b201f63b44ce8810d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed100443b8b89bdaabe438a6f2ce77baf02609873b7b1a1b201f63b44ce8810d","first_computed_at":"2026-05-17T23:48:08.079977Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:08.079977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vhn34X5A/F/5dbg2A6d+XADXaopDTvWxy4xJdqaRwsMRKcgXatd/i+3sDN8FnVWIaDrtB7nPclEDUlHbjSOZAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:08.080431Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.09184","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:056293cd53ba8cdb082a7ece88e40ae9915f663287dbb530011f987c339f151a","sha256:3d8974722ebdc1494d422f6f1ad986094e8cad5a91d4c8fcecd5ed1ddbe60ce6"],"state_sha256":"f05a1ef6d0756b0256c85e16c2541e75bfb74a69fd2a5f748a5a402949ae2828"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rn2glxI4lITMcc9YIX6qac+kCWEr2P1Z2T93X0XRdXR4w65xUCU2HB1eb9NrMG0BF0wzXH/xU+Y/CqbwYzNwAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T08:29:46.072438Z","bundle_sha256":"c117033625b6df7707e221b7080615df9cbe19e5599315eca4ae777b5e1771aa"}}