{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VZDFC2CNCZP4KX2AW2FWFYN3K6","short_pith_number":"pith:VZDFC2CN","schema_version":"1.0","canonical_sha256":"ae4651684d165fc55f40b68b62e1bb57b0e85ae12ea1373ddb421def91d82241","source":{"kind":"arxiv","id":"2105.11698","version":1},"attestation_state":"computed","paper":{"title":"Guiding the Growth: Difficulty-Controllable Question Generation through Step-by-Step Rewriting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Bang Liu, Chenghua Lin, Ruihui Zhao, Siyao Li, Sujian Li, Yefeng Zheng, Yi Cheng","submitted_at":"2021-05-25T06:43:13Z","abstract_excerpt":"This paper explores the task of Difficulty-Controllable Question Generation (DCQG), which aims at generating questions with required difficulty levels. Previous research on this task mainly defines the difficulty of a question as whether it can be correctly answered by a Question Answering (QA) system, lacking interpretability and controllability. In our work, we redefine question difficulty as the number of inference steps required to answer it and argue that Question Generation (QG) systems should have stronger control over the logic of generated questions. To this end, we propose a novel fr"},"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":"2105.11698","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2021-05-25T06:43:13Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"22b9cca2b8a697556aa3519ba6eec1d211a5c2bd71f194935655764b835c51d4","abstract_canon_sha256":"cb2bba5cbb83b4aa3f9cf53360970a4a40e33cd237852d03a243b18d958804ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:42:55.615006Z","signature_b64":"6Xdjn08OjjcDnNtYGByRYo9uWlblsLnyEOIUhax+hzM1j7re0J5x3RvI71Wxz9P1Naq1LtT9viOUSVjLVmp0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae4651684d165fc55f40b68b62e1bb57b0e85ae12ea1373ddb421def91d82241","last_reissued_at":"2026-07-05T02:42:55.614533Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:42:55.614533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Guiding the Growth: Difficulty-Controllable Question Generation through Step-by-Step Rewriting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Bang Liu, Chenghua Lin, Ruihui Zhao, Siyao Li, Sujian Li, Yefeng Zheng, Yi Cheng","submitted_at":"2021-05-25T06:43:13Z","abstract_excerpt":"This paper explores the task of Difficulty-Controllable Question Generation (DCQG), which aims at generating questions with required difficulty levels. Previous research on this task mainly defines the difficulty of a question as whether it can be correctly answered by a Question Answering (QA) system, lacking interpretability and controllability. In our work, we redefine question difficulty as the number of inference steps required to answer it and argue that Question Generation (QG) systems should have stronger control over the logic of generated questions. To this end, we propose a novel fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.11698","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/2105.11698/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":"2105.11698","created_at":"2026-07-05T02:42:55.614587+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.11698v1","created_at":"2026-07-05T02:42:55.614587+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.11698","created_at":"2026-07-05T02:42:55.614587+00:00"},{"alias_kind":"pith_short_12","alias_value":"VZDFC2CNCZP4","created_at":"2026-07-05T02:42:55.614587+00:00"},{"alias_kind":"pith_short_16","alias_value":"VZDFC2CNCZP4KX2A","created_at":"2026-07-05T02:42:55.614587+00:00"},{"alias_kind":"pith_short_8","alias_value":"VZDFC2CN","created_at":"2026-07-05T02:42:55.614587+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.21389","citing_title":"AutoJudger: An Agent-Driven Framework for Efficient Benchmarking of MLLMs","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VZDFC2CNCZP4KX2AW2FWFYN3K6","json":"https://pith.science/pith/VZDFC2CNCZP4KX2AW2FWFYN3K6.json","graph_json":"https://pith.science/api/pith-number/VZDFC2CNCZP4KX2AW2FWFYN3K6/graph.json","events_json":"https://pith.science/api/pith-number/VZDFC2CNCZP4KX2AW2FWFYN3K6/events.json","paper":"https://pith.science/paper/VZDFC2CN"},"agent_actions":{"view_html":"https://pith.science/pith/VZDFC2CNCZP4KX2AW2FWFYN3K6","download_json":"https://pith.science/pith/VZDFC2CNCZP4KX2AW2FWFYN3K6.json","view_paper":"https://pith.science/paper/VZDFC2CN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.11698&json=true","fetch_graph":"https://pith.science/api/pith-number/VZDFC2CNCZP4KX2AW2FWFYN3K6/graph.json","fetch_events":"https://pith.science/api/pith-number/VZDFC2CNCZP4KX2AW2FWFYN3K6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VZDFC2CNCZP4KX2AW2FWFYN3K6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VZDFC2CNCZP4KX2AW2FWFYN3K6/action/storage_attestation","attest_author":"https://pith.science/pith/VZDFC2CNCZP4KX2AW2FWFYN3K6/action/author_attestation","sign_citation":"https://pith.science/pith/VZDFC2CNCZP4KX2AW2FWFYN3K6/action/citation_signature","submit_replication":"https://pith.science/pith/VZDFC2CNCZP4KX2AW2FWFYN3K6/action/replication_record"}},"created_at":"2026-07-05T02:42:55.614587+00:00","updated_at":"2026-07-05T02:42:55.614587+00:00"}