{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:UHWXN54ZTIF6V3SXXRV2E6744F","short_pith_number":"pith:UHWXN54Z","canonical_record":{"source":{"id":"2503.08551","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-03-11T15:39:43Z","cross_cats_sorted":[],"title_canon_sha256":"2b97ed5b7019ecf63ab2cd57e32befcf36594aad5587b1fb2a3edd896ae8e524","abstract_canon_sha256":"f1bbc48936f007c16b9aa523ba93f2645bcf9b5600af8c126327f4dffb37df83"},"schema_version":"1.0"},"canonical_sha256":"a1ed76f7999a0beaee57bc6ba27bfce1541fc724a199aff5d377664743a13abc","source":{"kind":"arxiv","id":"2503.08551","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.08551","created_at":"2026-07-05T10:29:02Z"},{"alias_kind":"arxiv_version","alias_value":"2503.08551v1","created_at":"2026-07-05T10:29:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.08551","created_at":"2026-07-05T10:29:02Z"},{"alias_kind":"pith_short_12","alias_value":"UHWXN54ZTIF6","created_at":"2026-07-05T10:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"UHWXN54ZTIF6V3SX","created_at":"2026-07-05T10:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"UHWXN54Z","created_at":"2026-07-05T10:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:UHWXN54ZTIF6V3SXXRV2E6744F","target":"record","payload":{"canonical_record":{"source":{"id":"2503.08551","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-03-11T15:39:43Z","cross_cats_sorted":[],"title_canon_sha256":"2b97ed5b7019ecf63ab2cd57e32befcf36594aad5587b1fb2a3edd896ae8e524","abstract_canon_sha256":"f1bbc48936f007c16b9aa523ba93f2645bcf9b5600af8c126327f4dffb37df83"},"schema_version":"1.0"},"canonical_sha256":"a1ed76f7999a0beaee57bc6ba27bfce1541fc724a199aff5d377664743a13abc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:29:02.058957Z","signature_b64":"eHITV6RutqLUWKLSAu0B4Ewh1czz600TX2gP4CzASfyUocX2dEKvR7vzMfqs7hqt6g4MLOzATXx9ivmOw4yPCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1ed76f7999a0beaee57bc6ba27bfce1541fc724a199aff5d377664743a13abc","last_reissued_at":"2026-07-05T10:29:02.058452Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:29:02.058452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2503.08551","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-05T10:29:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bRhI3JovU0X711X05nfX4ZrJXjeYR82uZUdwmiH/6tM0cPEcuHrHL3n1m1SJVWw7cKJQdVF3gpEn/S7qN28GAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T21:49:56.254241Z"},"content_sha256":"999f918bf496ac6abdb8379bf976edf132498b07f38e3761a7987c8a06b2e936","schema_version":"1.0","event_id":"sha256:999f918bf496ac6abdb8379bf976edf132498b07f38e3761a7987c8a06b2e936"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:UHWXN54ZTIF6V3SXXRV2E6744F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reasoning and Sampling-Augmented MCQ Difficulty Prediction via LLMs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andrew Lan, Peter Tran, Stephen Sireci, Wanyong Feng","submitted_at":"2025-03-11T15:39:43Z","abstract_excerpt":"The difficulty of multiple-choice questions (MCQs) is a crucial factor for educational assessments. Predicting MCQ difficulty is challenging since it requires understanding both the complexity of reaching the correct option and the plausibility of distractors, i.e., incorrect options. In this paper, we propose a novel, two-stage method to predict the difficulty of MCQs. First, to better estimate the complexity of each MCQ, we use large language models (LLMs) to augment the reasoning steps required to reach each option. We use not just the MCQ itself but also these reasoning steps as input to p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.08551","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/2503.08551/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:29:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3AqrREWqA/gYZB57JHBOR8w5j70+NoRe2nmpipCKvi2uGMkz4O0l6iJk7FUrdPpLl0BDtavnnZat7T//BeQ2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T21:49:56.255205Z"},"content_sha256":"6e455a632dde806db77723c38bb4cf0ba138a093557eb708aa8e652d34cb8ae8","schema_version":"1.0","event_id":"sha256:6e455a632dde806db77723c38bb4cf0ba138a093557eb708aa8e652d34cb8ae8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UHWXN54ZTIF6V3SXXRV2E6744F/bundle.json","state_url":"https://pith.science/pith/UHWXN54ZTIF6V3SXXRV2E6744F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UHWXN54ZTIF6V3SXXRV2E6744F/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:49:56Z","links":{"resolver":"https://pith.science/pith/UHWXN54ZTIF6V3SXXRV2E6744F","bundle":"https://pith.science/pith/UHWXN54ZTIF6V3SXXRV2E6744F/bundle.json","state":"https://pith.science/pith/UHWXN54ZTIF6V3SXXRV2E6744F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UHWXN54ZTIF6V3SXXRV2E6744F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:UHWXN54ZTIF6V3SXXRV2E6744F","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":"f1bbc48936f007c16b9aa523ba93f2645bcf9b5600af8c126327f4dffb37df83","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-03-11T15:39:43Z","title_canon_sha256":"2b97ed5b7019ecf63ab2cd57e32befcf36594aad5587b1fb2a3edd896ae8e524"},"schema_version":"1.0","source":{"id":"2503.08551","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.08551","created_at":"2026-07-05T10:29:02Z"},{"alias_kind":"arxiv_version","alias_value":"2503.08551v1","created_at":"2026-07-05T10:29:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.08551","created_at":"2026-07-05T10:29:02Z"},{"alias_kind":"pith_short_12","alias_value":"UHWXN54ZTIF6","created_at":"2026-07-05T10:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"UHWXN54ZTIF6V3SX","created_at":"2026-07-05T10:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"UHWXN54Z","created_at":"2026-07-05T10:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:6e455a632dde806db77723c38bb4cf0ba138a093557eb708aa8e652d34cb8ae8","target":"graph","created_at":"2026-07-05T10:29:02Z","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/2503.08551/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The difficulty of multiple-choice questions (MCQs) is a crucial factor for educational assessments. Predicting MCQ difficulty is challenging since it requires understanding both the complexity of reaching the correct option and the plausibility of distractors, i.e., incorrect options. In this paper, we propose a novel, two-stage method to predict the difficulty of MCQs. First, to better estimate the complexity of each MCQ, we use large language models (LLMs) to augment the reasoning steps required to reach each option. We use not just the MCQ itself but also these reasoning steps as input to p","authors_text":"Andrew Lan, Peter Tran, Stephen Sireci, Wanyong Feng","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-03-11T15:39:43Z","title":"Reasoning and Sampling-Augmented MCQ Difficulty Prediction via LLMs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.08551","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:999f918bf496ac6abdb8379bf976edf132498b07f38e3761a7987c8a06b2e936","target":"record","created_at":"2026-07-05T10:29:02Z","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":"f1bbc48936f007c16b9aa523ba93f2645bcf9b5600af8c126327f4dffb37df83","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-03-11T15:39:43Z","title_canon_sha256":"2b97ed5b7019ecf63ab2cd57e32befcf36594aad5587b1fb2a3edd896ae8e524"},"schema_version":"1.0","source":{"id":"2503.08551","kind":"arxiv","version":1}},"canonical_sha256":"a1ed76f7999a0beaee57bc6ba27bfce1541fc724a199aff5d377664743a13abc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1ed76f7999a0beaee57bc6ba27bfce1541fc724a199aff5d377664743a13abc","first_computed_at":"2026-07-05T10:29:02.058452Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:29:02.058452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eHITV6RutqLUWKLSAu0B4Ewh1czz600TX2gP4CzASfyUocX2dEKvR7vzMfqs7hqt6g4MLOzATXx9ivmOw4yPCA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:29:02.058957Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.08551","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:999f918bf496ac6abdb8379bf976edf132498b07f38e3761a7987c8a06b2e936","sha256:6e455a632dde806db77723c38bb4cf0ba138a093557eb708aa8e652d34cb8ae8"],"state_sha256":"380524503cdc0d47f28db7a07bd4e1982a7fb62cb9f4d03e8d9c8cd7c82f97ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"op96fzewXS2JPGeL4kqjD6E8xz1o9ToUZtNBc8e0SYnksIXO57iaSsv+BSmTQknfiPI5gpRn08TRBJLVeznhCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T21:49:56.262056Z","bundle_sha256":"182bc049e1579e8ce2a0f7a5c4db23bb41e82e6f752a08cf098d339875a4e27b"}}