{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ZIYIZ6DPFMRSWDPS2LSGIIJSD6","short_pith_number":"pith:ZIYIZ6DP","canonical_record":{"source":{"id":"2401.14174","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-01-25T13:34:33Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d3dc6d59aa6bd904fb3cc7fbc6eb297f60b93bd154f5973b69b6d92af2abd994","abstract_canon_sha256":"5c02451595dbe77d4834c6d3dbe3aaf14e8ac362472bd8ac5634da9fd0b9ae19"},"schema_version":"1.0"},"canonical_sha256":"ca308cf86f2b232b0df2d2e46421321fb3c422ebc47fa38c818f36cceaa6e77f","source":{"kind":"arxiv","id":"2401.14174","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.14174","created_at":"2026-07-05T10:03:40Z"},{"alias_kind":"arxiv_version","alias_value":"2401.14174v2","created_at":"2026-07-05T10:03:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.14174","created_at":"2026-07-05T10:03:40Z"},{"alias_kind":"pith_short_12","alias_value":"ZIYIZ6DPFMRS","created_at":"2026-07-05T10:03:40Z"},{"alias_kind":"pith_short_16","alias_value":"ZIYIZ6DPFMRSWDPS","created_at":"2026-07-05T10:03:40Z"},{"alias_kind":"pith_short_8","alias_value":"ZIYIZ6DP","created_at":"2026-07-05T10:03:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ZIYIZ6DPFMRSWDPS2LSGIIJSD6","target":"record","payload":{"canonical_record":{"source":{"id":"2401.14174","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-01-25T13:34:33Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d3dc6d59aa6bd904fb3cc7fbc6eb297f60b93bd154f5973b69b6d92af2abd994","abstract_canon_sha256":"5c02451595dbe77d4834c6d3dbe3aaf14e8ac362472bd8ac5634da9fd0b9ae19"},"schema_version":"1.0"},"canonical_sha256":"ca308cf86f2b232b0df2d2e46421321fb3c422ebc47fa38c818f36cceaa6e77f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:03:40.829792Z","signature_b64":"vIKO+apzC8GeDCzgvzldX+yyjyQMpE3biJYMAAiLSxdWtasMI7Ecn8ZXPg9EvLAh3HPKKZRbFPOkZU0LV2IhAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca308cf86f2b232b0df2d2e46421321fb3c422ebc47fa38c818f36cceaa6e77f","last_reissued_at":"2026-07-05T10:03:40.829210Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:03:40.829210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.14174","source_version":2,"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-05T10:03:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6jc+q8aPoek3T1QqdfB7t+71wZqRilGpB2/iYB1b5Pm/6euxr1bJn+mjAnrzWnrTLpYKhvQ0BGerdYOjlVuADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T13:51:42.735976Z"},"content_sha256":"4ad938b15bb7f86770194838ec0d7f985a94d26246417da655e9d381ae50f101","schema_version":"1.0","event_id":"sha256:4ad938b15bb7f86770194838ec0d7f985a94d26246417da655e9d381ae50f101"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ZIYIZ6DPFMRSWDPS2LSGIIJSD6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Structural Complexity Analysis of Hierarchical Task Network Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CC","authors_text":"Cornelius Brand, Fionn Mc Inerney, Robert Ganian, Simon Wietheger","submitted_at":"2024-01-25T13:34:33Z","abstract_excerpt":"We perform a refined complexity-theoretic analysis of three classical problems in the context of Hierarchical Task Network Planning: the verification of a provided plan, whether an executable plan exists, and whether a given state can be reached. Our focus lies on identifying structural properties which yield tractability. We obtain new polynomial algorithms for all three problems on a natural class of primitive networks, along with corresponding lower bounds. We also obtain an algorithmic meta-theorem for lifting polynomial-time solvability from primitive to general task networks, and prove t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.14174","kind":"arxiv","version":2},"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/2401.14174/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-05T10:03:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i7bzoGAwbN4w6Rm5JGnWVN+QdLlO6hAfEiNpopWq1fSCG3wgu+S1y+/O2xOGKN6dO/W6VMM9l1eaK0f6pVaTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T13:51:42.736361Z"},"content_sha256":"da587b60489f8964f1f3c68bb3cc12509f5b97e6254d4f37c9b5888f575d9e48","schema_version":"1.0","event_id":"sha256:da587b60489f8964f1f3c68bb3cc12509f5b97e6254d4f37c9b5888f575d9e48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZIYIZ6DPFMRSWDPS2LSGIIJSD6/bundle.json","state_url":"https://pith.science/pith/ZIYIZ6DPFMRSWDPS2LSGIIJSD6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZIYIZ6DPFMRSWDPS2LSGIIJSD6/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-07-08T13:51:42Z","links":{"resolver":"https://pith.science/pith/ZIYIZ6DPFMRSWDPS2LSGIIJSD6","bundle":"https://pith.science/pith/ZIYIZ6DPFMRSWDPS2LSGIIJSD6/bundle.json","state":"https://pith.science/pith/ZIYIZ6DPFMRSWDPS2LSGIIJSD6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZIYIZ6DPFMRSWDPS2LSGIIJSD6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ZIYIZ6DPFMRSWDPS2LSGIIJSD6","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":"5c02451595dbe77d4834c6d3dbe3aaf14e8ac362472bd8ac5634da9fd0b9ae19","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-01-25T13:34:33Z","title_canon_sha256":"d3dc6d59aa6bd904fb3cc7fbc6eb297f60b93bd154f5973b69b6d92af2abd994"},"schema_version":"1.0","source":{"id":"2401.14174","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.14174","created_at":"2026-07-05T10:03:40Z"},{"alias_kind":"arxiv_version","alias_value":"2401.14174v2","created_at":"2026-07-05T10:03:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.14174","created_at":"2026-07-05T10:03:40Z"},{"alias_kind":"pith_short_12","alias_value":"ZIYIZ6DPFMRS","created_at":"2026-07-05T10:03:40Z"},{"alias_kind":"pith_short_16","alias_value":"ZIYIZ6DPFMRSWDPS","created_at":"2026-07-05T10:03:40Z"},{"alias_kind":"pith_short_8","alias_value":"ZIYIZ6DP","created_at":"2026-07-05T10:03:40Z"}],"graph_snapshots":[{"event_id":"sha256:da587b60489f8964f1f3c68bb3cc12509f5b97e6254d4f37c9b5888f575d9e48","target":"graph","created_at":"2026-07-05T10:03:40Z","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/2401.14174/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We perform a refined complexity-theoretic analysis of three classical problems in the context of Hierarchical Task Network Planning: the verification of a provided plan, whether an executable plan exists, and whether a given state can be reached. Our focus lies on identifying structural properties which yield tractability. We obtain new polynomial algorithms for all three problems on a natural class of primitive networks, along with corresponding lower bounds. We also obtain an algorithmic meta-theorem for lifting polynomial-time solvability from primitive to general task networks, and prove t","authors_text":"Cornelius Brand, Fionn Mc Inerney, Robert Ganian, Simon Wietheger","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-01-25T13:34:33Z","title":"A Structural Complexity Analysis of Hierarchical Task Network Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.14174","kind":"arxiv","version":2},"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:4ad938b15bb7f86770194838ec0d7f985a94d26246417da655e9d381ae50f101","target":"record","created_at":"2026-07-05T10:03:40Z","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":"5c02451595dbe77d4834c6d3dbe3aaf14e8ac362472bd8ac5634da9fd0b9ae19","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-01-25T13:34:33Z","title_canon_sha256":"d3dc6d59aa6bd904fb3cc7fbc6eb297f60b93bd154f5973b69b6d92af2abd994"},"schema_version":"1.0","source":{"id":"2401.14174","kind":"arxiv","version":2}},"canonical_sha256":"ca308cf86f2b232b0df2d2e46421321fb3c422ebc47fa38c818f36cceaa6e77f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca308cf86f2b232b0df2d2e46421321fb3c422ebc47fa38c818f36cceaa6e77f","first_computed_at":"2026-07-05T10:03:40.829210Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:03:40.829210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vIKO+apzC8GeDCzgvzldX+yyjyQMpE3biJYMAAiLSxdWtasMI7Ecn8ZXPg9EvLAh3HPKKZRbFPOkZU0LV2IhAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:03:40.829792Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.14174","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ad938b15bb7f86770194838ec0d7f985a94d26246417da655e9d381ae50f101","sha256:da587b60489f8964f1f3c68bb3cc12509f5b97e6254d4f37c9b5888f575d9e48"],"state_sha256":"ed4f1682f291d2c86c694a486b3ede4b7616498b29fc0730162be2b8f3158906"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cvgg5DbJQgZdCAHBuD3zLCevve/SRc9KHo8/Icednt2oB/gl7nPhJLdcCoeIh603OYgVPcXSQX2pnOSHMG8GAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T13:51:42.738367Z","bundle_sha256":"37cda953245d0a3dc312faa698e97b3592363dff4e70c136c80d0d46c47f49e8"}}