{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:WTH5OHJ2LTSHEUL2BJYBZKKBGI","short_pith_number":"pith:WTH5OHJ2","schema_version":"1.0","canonical_sha256":"b4cfd71d3a5ce472517a0a701ca941323b344cdf2404b8140e70d68e1dd7ec52","source":{"kind":"arxiv","id":"2001.02657","version":1},"attestation_state":"computed","paper":{"title":"Motivated proofs: What they are, why they matter and how to write them","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.HO","authors_text":"Rebecca Lea Morris","submitted_at":"2020-01-08T17:56:25Z","abstract_excerpt":"Mathematicians judge proofs to possess, or lack, a variety of different qualities, including, for example, explanatory power, depth, purity, beauty and fit. Philosophers of mathematical practice have begun to investigate the nature of such qualities. However, mathematicians frequently draw attention to another desirable proof quality: being motivated. Intuitively, motivated proofs contain no \"puzzling\" steps, but they have received little further analysis. In this paper, I begin a philosophical investigation into motivated proofs. I suggest that a proof is motivated if and only if mathematicia"},"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":"2001.02657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.HO","submitted_at":"2020-01-08T17:56:25Z","cross_cats_sorted":[],"title_canon_sha256":"02a6ec0d0c40ab04339c25018b59a8ed949b20e606f4d4996683d84b9b8a3af3","abstract_canon_sha256":"71165ef406027542d8bbc069d4963608009bdbd15f83da74776035ea86a5dcef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:50:12.301250Z","signature_b64":"NZ8DjTgtIv6gMN1lFoo1mHLD9dGkygKfo98rpkuQOYQbuJtbDUW0dPaNuZlgnUrksj3t4ywxhlqbl3prPCWqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4cfd71d3a5ce472517a0a701ca941323b344cdf2404b8140e70d68e1dd7ec52","last_reissued_at":"2026-07-05T00:50:12.300836Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:50:12.300836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Motivated proofs: What they are, why they matter and how to write them","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.HO","authors_text":"Rebecca Lea Morris","submitted_at":"2020-01-08T17:56:25Z","abstract_excerpt":"Mathematicians judge proofs to possess, or lack, a variety of different qualities, including, for example, explanatory power, depth, purity, beauty and fit. Philosophers of mathematical practice have begun to investigate the nature of such qualities. However, mathematicians frequently draw attention to another desirable proof quality: being motivated. Intuitively, motivated proofs contain no \"puzzling\" steps, but they have received little further analysis. In this paper, I begin a philosophical investigation into motivated proofs. I suggest that a proof is motivated if and only if mathematicia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.02657","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/2001.02657/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":"2001.02657","created_at":"2026-07-05T00:50:12.300891+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.02657v1","created_at":"2026-07-05T00:50:12.300891+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.02657","created_at":"2026-07-05T00:50:12.300891+00:00"},{"alias_kind":"pith_short_12","alias_value":"WTH5OHJ2LTSH","created_at":"2026-07-05T00:50:12.300891+00:00"},{"alias_kind":"pith_short_16","alias_value":"WTH5OHJ2LTSHEUL2","created_at":"2026-07-05T00:50:12.300891+00:00"},{"alias_kind":"pith_short_8","alias_value":"WTH5OHJ2","created_at":"2026-07-05T00:50:12.300891+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.02208","citing_title":"Proof2Hybrid: Automatic Mathematical Benchmark Synthesis for Proof-Centric Problems","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WTH5OHJ2LTSHEUL2BJYBZKKBGI","json":"https://pith.science/pith/WTH5OHJ2LTSHEUL2BJYBZKKBGI.json","graph_json":"https://pith.science/api/pith-number/WTH5OHJ2LTSHEUL2BJYBZKKBGI/graph.json","events_json":"https://pith.science/api/pith-number/WTH5OHJ2LTSHEUL2BJYBZKKBGI/events.json","paper":"https://pith.science/paper/WTH5OHJ2"},"agent_actions":{"view_html":"https://pith.science/pith/WTH5OHJ2LTSHEUL2BJYBZKKBGI","download_json":"https://pith.science/pith/WTH5OHJ2LTSHEUL2BJYBZKKBGI.json","view_paper":"https://pith.science/paper/WTH5OHJ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.02657&json=true","fetch_graph":"https://pith.science/api/pith-number/WTH5OHJ2LTSHEUL2BJYBZKKBGI/graph.json","fetch_events":"https://pith.science/api/pith-number/WTH5OHJ2LTSHEUL2BJYBZKKBGI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WTH5OHJ2LTSHEUL2BJYBZKKBGI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WTH5OHJ2LTSHEUL2BJYBZKKBGI/action/storage_attestation","attest_author":"https://pith.science/pith/WTH5OHJ2LTSHEUL2BJYBZKKBGI/action/author_attestation","sign_citation":"https://pith.science/pith/WTH5OHJ2LTSHEUL2BJYBZKKBGI/action/citation_signature","submit_replication":"https://pith.science/pith/WTH5OHJ2LTSHEUL2BJYBZKKBGI/action/replication_record"}},"created_at":"2026-07-05T00:50:12.300891+00:00","updated_at":"2026-07-05T00:50:12.300891+00:00"}