{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7V7IEDWWTVQGKAYHOJVLIVTHWT","short_pith_number":"pith:7V7IEDWW","schema_version":"1.0","canonical_sha256":"fd7e820ed69d60650307726ab45667b4efbbcac9863d25552b5192aa6dba3b2c","source":{"kind":"arxiv","id":"2505.01903","version":2},"attestation_state":"computed","paper":{"title":"LookAlike: Consistent Distractor Generation in Math MCQs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Alexander Scarlatos, Andrew Lan, Nigel Fernandez, Nisarg Parikh, Simon Woodhead","submitted_at":"2025-05-03T19:18:06Z","abstract_excerpt":"Large language models (LLMs) are increasingly used to generate distractors for multiple-choice questions (MCQs), especially in domains like math education. However, existing approaches are limited in ensuring that the generated distractors are consistent with common student errors. We propose LookAlike, a method that improves error-distractor consistency via preference optimization. Our two main innovations are: (a) mining synthetic preference pairs from model inconsistencies, and (b) alternating supervised fine-tuning (SFT) with Direct Preference Optimization (DPO) to stabilize training. Unli"},"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":"2505.01903","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-03T19:18:06Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1257fa62537be955d96612c748e48fd3331eb0101805b3da6b3be74d9dcbdc03","abstract_canon_sha256":"5b7d247802fcad1aef3bf4b19a6064888bb6e2681031da07d51d0bd4f705c2a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:17:45.128371Z","signature_b64":"YGVUA4Id5CbdTPnNViFKOFZm4Qf8/AJ7E79auf3ZUS8N14DZwxBaxcHxC8koyVUhUlQ7jUSb2xy9Wk8lWO3yCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd7e820ed69d60650307726ab45667b4efbbcac9863d25552b5192aa6dba3b2c","last_reissued_at":"2026-07-05T11:17:45.127866Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:17:45.127866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LookAlike: Consistent Distractor Generation in Math MCQs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Alexander Scarlatos, Andrew Lan, Nigel Fernandez, Nisarg Parikh, Simon Woodhead","submitted_at":"2025-05-03T19:18:06Z","abstract_excerpt":"Large language models (LLMs) are increasingly used to generate distractors for multiple-choice questions (MCQs), especially in domains like math education. However, existing approaches are limited in ensuring that the generated distractors are consistent with common student errors. We propose LookAlike, a method that improves error-distractor consistency via preference optimization. Our two main innovations are: (a) mining synthetic preference pairs from model inconsistencies, and (b) alternating supervised fine-tuning (SFT) with Direct Preference Optimization (DPO) to stabilize training. Unli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.01903","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/2505.01903/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":"2505.01903","created_at":"2026-07-05T11:17:45.127927+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.01903v2","created_at":"2026-07-05T11:17:45.127927+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.01903","created_at":"2026-07-05T11:17:45.127927+00:00"},{"alias_kind":"pith_short_12","alias_value":"7V7IEDWWTVQG","created_at":"2026-07-05T11:17:45.127927+00:00"},{"alias_kind":"pith_short_16","alias_value":"7V7IEDWWTVQGKAYH","created_at":"2026-07-05T11:17:45.127927+00:00"},{"alias_kind":"pith_short_8","alias_value":"7V7IEDWW","created_at":"2026-07-05T11:17:45.127927+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.12748","citing_title":"Simulating Students or Sycophantic Problem Solving? On Misconception Faithfulness of LLM Simulators","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7V7IEDWWTVQGKAYHOJVLIVTHWT","json":"https://pith.science/pith/7V7IEDWWTVQGKAYHOJVLIVTHWT.json","graph_json":"https://pith.science/api/pith-number/7V7IEDWWTVQGKAYHOJVLIVTHWT/graph.json","events_json":"https://pith.science/api/pith-number/7V7IEDWWTVQGKAYHOJVLIVTHWT/events.json","paper":"https://pith.science/paper/7V7IEDWW"},"agent_actions":{"view_html":"https://pith.science/pith/7V7IEDWWTVQGKAYHOJVLIVTHWT","download_json":"https://pith.science/pith/7V7IEDWWTVQGKAYHOJVLIVTHWT.json","view_paper":"https://pith.science/paper/7V7IEDWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.01903&json=true","fetch_graph":"https://pith.science/api/pith-number/7V7IEDWWTVQGKAYHOJVLIVTHWT/graph.json","fetch_events":"https://pith.science/api/pith-number/7V7IEDWWTVQGKAYHOJVLIVTHWT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7V7IEDWWTVQGKAYHOJVLIVTHWT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7V7IEDWWTVQGKAYHOJVLIVTHWT/action/storage_attestation","attest_author":"https://pith.science/pith/7V7IEDWWTVQGKAYHOJVLIVTHWT/action/author_attestation","sign_citation":"https://pith.science/pith/7V7IEDWWTVQGKAYHOJVLIVTHWT/action/citation_signature","submit_replication":"https://pith.science/pith/7V7IEDWWTVQGKAYHOJVLIVTHWT/action/replication_record"}},"created_at":"2026-07-05T11:17:45.127927+00:00","updated_at":"2026-07-05T11:17:45.127927+00:00"}