{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:GHHBJ3Y5Q7CI3H54VCBZJJDGKN","short_pith_number":"pith:GHHBJ3Y5","canonical_record":{"source":{"id":"2308.15299","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-08-29T13:36:45Z","cross_cats_sorted":[],"title_canon_sha256":"ceb623788a239affd1751097a3058667ca4e5a9df040c2b8601741a48b9d6544","abstract_canon_sha256":"332cf492c91dd075165968d580bd9d38bf85098b8c8436e1cf41a76c0c646c91"},"schema_version":"1.0"},"canonical_sha256":"31ce14ef1d87c48d9fbca88394a4665353e9728396df35ecce3f7f72cbc26a79","source":{"kind":"arxiv","id":"2308.15299","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.15299","created_at":"2026-07-05T06:45:52Z"},{"alias_kind":"arxiv_version","alias_value":"2308.15299v1","created_at":"2026-07-05T06:45:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.15299","created_at":"2026-07-05T06:45:52Z"},{"alias_kind":"pith_short_12","alias_value":"GHHBJ3Y5Q7CI","created_at":"2026-07-05T06:45:52Z"},{"alias_kind":"pith_short_16","alias_value":"GHHBJ3Y5Q7CI3H54","created_at":"2026-07-05T06:45:52Z"},{"alias_kind":"pith_short_8","alias_value":"GHHBJ3Y5","created_at":"2026-07-05T06:45:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:GHHBJ3Y5Q7CI3H54VCBZJJDGKN","target":"record","payload":{"canonical_record":{"source":{"id":"2308.15299","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-08-29T13:36:45Z","cross_cats_sorted":[],"title_canon_sha256":"ceb623788a239affd1751097a3058667ca4e5a9df040c2b8601741a48b9d6544","abstract_canon_sha256":"332cf492c91dd075165968d580bd9d38bf85098b8c8436e1cf41a76c0c646c91"},"schema_version":"1.0"},"canonical_sha256":"31ce14ef1d87c48d9fbca88394a4665353e9728396df35ecce3f7f72cbc26a79","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:45:52.717143Z","signature_b64":"5lN5oOsugv7LM5h0jE+1KhOztemoHiVk77BUrgfKppJBPWOODKXpIBjfoV61VGzmZXkVvmC+Fq1hOvtQnzeJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31ce14ef1d87c48d9fbca88394a4665353e9728396df35ecce3f7f72cbc26a79","last_reissued_at":"2026-07-05T06:45:52.716573Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:45:52.716573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.15299","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-05T06:45:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CEKUHJ1/vtt4tyB+HzgG1fRj6HqCqDE7tfRbMxN8STkL8yXqEkhO4CqlbfttAVqrr8KNyaRxpsCPzWyDDOQ7CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T21:11:42.976026Z"},"content_sha256":"cd0a295195d0a0ae8fb414c36321d497d3b579f020f68ed7d4d010ff058ed1f3","schema_version":"1.0","event_id":"sha256:cd0a295195d0a0ae8fb414c36321d497d3b579f020f68ed7d4d010ff058ed1f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:GHHBJ3Y5Q7CI3H54VCBZJJDGKN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TaskLAMA: Probing the Complex Task Understanding of Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Deepak Ramachandran, Isaac Noble, Mehran Kazemi, Quan Yuan, Vaiva Imbrasaite, Xin Xu","submitted_at":"2023-08-29T13:36:45Z","abstract_excerpt":"Structured Complex Task Decomposition (SCTD) is the problem of breaking down a complex real-world task (such as planning a wedding) into a directed acyclic graph over individual steps that contribute to achieving the task, with edges specifying temporal dependencies between them. SCTD is an important component of assistive planning tools, and a challenge for commonsense reasoning systems. We probe how accurately SCTD can be done with the knowledge extracted from Large Language Models (LLMs). We introduce a high-quality human-annotated dataset for this problem and novel metrics to fairly assess"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.15299","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/2308.15299/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-05T06:45:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6LYiqQtAc92AizqhqUlbkAQ581hMX5ZUSwP5LoovlS9Ir4kjBcacOtslQdptYJumRtqh/5K4F4mGRRyGzkGsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T21:11:42.976562Z"},"content_sha256":"2ecb08d1f65e47ec6060ff9fdb0fd86a5ca9ab9d5a0641459d6b3d3239e354a3","schema_version":"1.0","event_id":"sha256:2ecb08d1f65e47ec6060ff9fdb0fd86a5ca9ab9d5a0641459d6b3d3239e354a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GHHBJ3Y5Q7CI3H54VCBZJJDGKN/bundle.json","state_url":"https://pith.science/pith/GHHBJ3Y5Q7CI3H54VCBZJJDGKN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GHHBJ3Y5Q7CI3H54VCBZJJDGKN/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-17T21:11:42Z","links":{"resolver":"https://pith.science/pith/GHHBJ3Y5Q7CI3H54VCBZJJDGKN","bundle":"https://pith.science/pith/GHHBJ3Y5Q7CI3H54VCBZJJDGKN/bundle.json","state":"https://pith.science/pith/GHHBJ3Y5Q7CI3H54VCBZJJDGKN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GHHBJ3Y5Q7CI3H54VCBZJJDGKN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:GHHBJ3Y5Q7CI3H54VCBZJJDGKN","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":"332cf492c91dd075165968d580bd9d38bf85098b8c8436e1cf41a76c0c646c91","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-08-29T13:36:45Z","title_canon_sha256":"ceb623788a239affd1751097a3058667ca4e5a9df040c2b8601741a48b9d6544"},"schema_version":"1.0","source":{"id":"2308.15299","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.15299","created_at":"2026-07-05T06:45:52Z"},{"alias_kind":"arxiv_version","alias_value":"2308.15299v1","created_at":"2026-07-05T06:45:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.15299","created_at":"2026-07-05T06:45:52Z"},{"alias_kind":"pith_short_12","alias_value":"GHHBJ3Y5Q7CI","created_at":"2026-07-05T06:45:52Z"},{"alias_kind":"pith_short_16","alias_value":"GHHBJ3Y5Q7CI3H54","created_at":"2026-07-05T06:45:52Z"},{"alias_kind":"pith_short_8","alias_value":"GHHBJ3Y5","created_at":"2026-07-05T06:45:52Z"}],"graph_snapshots":[{"event_id":"sha256:2ecb08d1f65e47ec6060ff9fdb0fd86a5ca9ab9d5a0641459d6b3d3239e354a3","target":"graph","created_at":"2026-07-05T06:45:52Z","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/2308.15299/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Structured Complex Task Decomposition (SCTD) is the problem of breaking down a complex real-world task (such as planning a wedding) into a directed acyclic graph over individual steps that contribute to achieving the task, with edges specifying temporal dependencies between them. SCTD is an important component of assistive planning tools, and a challenge for commonsense reasoning systems. We probe how accurately SCTD can be done with the knowledge extracted from Large Language Models (LLMs). We introduce a high-quality human-annotated dataset for this problem and novel metrics to fairly assess","authors_text":"Deepak Ramachandran, Isaac Noble, Mehran Kazemi, Quan Yuan, Vaiva Imbrasaite, Xin Xu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-08-29T13:36:45Z","title":"TaskLAMA: Probing the Complex Task Understanding of Language Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.15299","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:cd0a295195d0a0ae8fb414c36321d497d3b579f020f68ed7d4d010ff058ed1f3","target":"record","created_at":"2026-07-05T06:45:52Z","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":"332cf492c91dd075165968d580bd9d38bf85098b8c8436e1cf41a76c0c646c91","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-08-29T13:36:45Z","title_canon_sha256":"ceb623788a239affd1751097a3058667ca4e5a9df040c2b8601741a48b9d6544"},"schema_version":"1.0","source":{"id":"2308.15299","kind":"arxiv","version":1}},"canonical_sha256":"31ce14ef1d87c48d9fbca88394a4665353e9728396df35ecce3f7f72cbc26a79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31ce14ef1d87c48d9fbca88394a4665353e9728396df35ecce3f7f72cbc26a79","first_computed_at":"2026-07-05T06:45:52.716573Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:45:52.716573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5lN5oOsugv7LM5h0jE+1KhOztemoHiVk77BUrgfKppJBPWOODKXpIBjfoV61VGzmZXkVvmC+Fq1hOvtQnzeJDg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:45:52.717143Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.15299","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd0a295195d0a0ae8fb414c36321d497d3b579f020f68ed7d4d010ff058ed1f3","sha256:2ecb08d1f65e47ec6060ff9fdb0fd86a5ca9ab9d5a0641459d6b3d3239e354a3"],"state_sha256":"3044dcb29fbf4ee4ce105674256121aee66eefb1226c93bc4ae42ba00b110f9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GNuBzKpGGMdjB0ZgZhRxgiLF9sdmfl4lNdihCYYpZ1+TgKuFAyAJRz3jxoUnB/V8LqiGABygkq1+rlcnsuXXBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T21:11:42.980357Z","bundle_sha256":"07e8507a579f510486a1c378d8cb6659c247ee13f9d301d79b30c5f2ef5cb6ec"}}