{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:EEITTROGOGNXWVRTMQGG4ZEO3J","short_pith_number":"pith:EEITTROG","schema_version":"1.0","canonical_sha256":"211139c5c6719b7b5633640c6e648eda76c0be3851e028bcf0ad6bc882836c81","source":{"kind":"arxiv","id":"2307.01972","version":1},"attestation_state":"computed","paper":{"title":"Open-Domain Hierarchical Event Schema Induction by Incremental Prompting and Verification","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Chris Callison-Burch, Heng Ji, Jiawei Han, Manling Li, Ruining Zhao, Sha Li","submitted_at":"2023-07-05T01:00:44Z","abstract_excerpt":"Event schemas are a form of world knowledge about the typical progression of events. Recent methods for event schema induction use information extraction systems to construct a large number of event graph instances from documents, and then learn to generalize the schema from such instances. In contrast, we propose to treat event schemas as a form of commonsense knowledge that can be derived from large language models (LLMs). This new paradigm greatly simplifies the schema induction process and allows us to handle both hierarchical relations and temporal relations between events in a straightfo"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2307.01972","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2023-07-05T01:00:44Z","cross_cats_sorted":[],"title_canon_sha256":"62362d344ecb5f6a3733f3b32a7924bbba6e3247aa6a48a8dd8c7570158fd14c","abstract_canon_sha256":"33614075d631816e3472acb51d8ffb4954773e84630b1c30de2ddb2adbfa74db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:28:03.423864Z","signature_b64":"vwlB4dvYzqGD/qrd7YU3h9zvdD+4pBOmL4TjoE76osyxcyv5cQtld5vzmHWNJM+uOF+id6T2XLv06CaSvaBNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"211139c5c6719b7b5633640c6e648eda76c0be3851e028bcf0ad6bc882836c81","last_reissued_at":"2026-07-05T06:28:03.423457Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:28:03.423457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Open-Domain Hierarchical Event Schema Induction by Incremental Prompting and Verification","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Chris Callison-Burch, Heng Ji, Jiawei Han, Manling Li, Ruining Zhao, Sha Li","submitted_at":"2023-07-05T01:00:44Z","abstract_excerpt":"Event schemas are a form of world knowledge about the typical progression of events. Recent methods for event schema induction use information extraction systems to construct a large number of event graph instances from documents, and then learn to generalize the schema from such instances. In contrast, we propose to treat event schemas as a form of commonsense knowledge that can be derived from large language models (LLMs). This new paradigm greatly simplifies the schema induction process and allows us to handle both hierarchical relations and temporal relations between events in a straightfo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.01972","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/2307.01972/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2307.01972","created_at":"2026-07-05T06:28:03.423510+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.01972v1","created_at":"2026-07-05T06:28:03.423510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.01972","created_at":"2026-07-05T06:28:03.423510+00:00"},{"alias_kind":"pith_short_12","alias_value":"EEITTROGOGNX","created_at":"2026-07-05T06:28:03.423510+00:00"},{"alias_kind":"pith_short_16","alias_value":"EEITTROGOGNXWVRT","created_at":"2026-07-05T06:28:03.423510+00:00"},{"alias_kind":"pith_short_8","alias_value":"EEITTROG","created_at":"2026-07-05T06:28:03.423510+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24734","citing_title":"Task Decomposition for Efficient Annotation","ref_index":231,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EEITTROGOGNXWVRTMQGG4ZEO3J","json":"https://pith.science/pith/EEITTROGOGNXWVRTMQGG4ZEO3J.json","graph_json":"https://pith.science/api/pith-number/EEITTROGOGNXWVRTMQGG4ZEO3J/graph.json","events_json":"https://pith.science/api/pith-number/EEITTROGOGNXWVRTMQGG4ZEO3J/events.json","paper":"https://pith.science/paper/EEITTROG"},"agent_actions":{"view_html":"https://pith.science/pith/EEITTROGOGNXWVRTMQGG4ZEO3J","download_json":"https://pith.science/pith/EEITTROGOGNXWVRTMQGG4ZEO3J.json","view_paper":"https://pith.science/paper/EEITTROG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.01972&json=true","fetch_graph":"https://pith.science/api/pith-number/EEITTROGOGNXWVRTMQGG4ZEO3J/graph.json","fetch_events":"https://pith.science/api/pith-number/EEITTROGOGNXWVRTMQGG4ZEO3J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EEITTROGOGNXWVRTMQGG4ZEO3J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EEITTROGOGNXWVRTMQGG4ZEO3J/action/storage_attestation","attest_author":"https://pith.science/pith/EEITTROGOGNXWVRTMQGG4ZEO3J/action/author_attestation","sign_citation":"https://pith.science/pith/EEITTROGOGNXWVRTMQGG4ZEO3J/action/citation_signature","submit_replication":"https://pith.science/pith/EEITTROGOGNXWVRTMQGG4ZEO3J/action/replication_record"}},"created_at":"2026-07-05T06:28:03.423510+00:00","updated_at":"2026-07-05T06:28:03.423510+00:00"}