{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:UMARYFTLPSOEQORBVW5MFURX7K","short_pith_number":"pith:UMARYFTL","schema_version":"1.0","canonical_sha256":"a3011c166b7c9c483a21adbac2d237fabde676ac348f767999fb413648bf0285","source":{"kind":"arxiv","id":"1103.1605","version":2},"attestation_state":"computed","paper":{"title":"Reduction maps and minimal model theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Brian Lehmann, Yoshinori Gongyo","submitted_at":"2011-03-08T19:05:08Z","abstract_excerpt":"We use reduction maps to study the minimal model program. Our main result is that the existence of a good minimal model for a klt pair $(X,\\Delta)$ can be detected on the base of the $(K_{X}+\\Delta)$-trivial reduction map. Thus we show that the main conjectures of the minimal model program can be interpreted as a natural statement on the existence of curves on $X$."},"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":"1103.1605","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2011-03-08T19:05:08Z","cross_cats_sorted":[],"title_canon_sha256":"9a72804a65f54756b3d30b3a7d3aa604c3057af807cf4f37381fb526b6f7cdee","abstract_canon_sha256":"2d420fffea47256f60a270aeaf0a2c8915f2ff29073d7957c8f60d9e7e0707b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:36.693778Z","signature_b64":"zbOkdzrcYn0smb68CsEhFI9jemKgpK19wrknRrbHy3ZETJzUm0Y7SrTuK+Jb+EkRc5oNYnjVS1vm53UegABnDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3011c166b7c9c483a21adbac2d237fabde676ac348f767999fb413648bf0285","last_reissued_at":"2026-05-17T23:53:36.693160Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:36.693160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reduction maps and minimal model theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Brian Lehmann, Yoshinori Gongyo","submitted_at":"2011-03-08T19:05:08Z","abstract_excerpt":"We use reduction maps to study the minimal model program. Our main result is that the existence of a good minimal model for a klt pair $(X,\\Delta)$ can be detected on the base of the $(K_{X}+\\Delta)$-trivial reduction map. Thus we show that the main conjectures of the minimal model program can be interpreted as a natural statement on the existence of curves on $X$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1605","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":""},"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":"1103.1605","created_at":"2026-05-17T23:53:36.693258+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.1605v2","created_at":"2026-05-17T23:53:36.693258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1605","created_at":"2026-05-17T23:53:36.693258+00:00"},{"alias_kind":"pith_short_12","alias_value":"UMARYFTLPSOE","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"UMARYFTLPSOEQORB","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"UMARYFTL","created_at":"2026-05-18T12:26:42.757692+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UMARYFTLPSOEQORBVW5MFURX7K","json":"https://pith.science/pith/UMARYFTLPSOEQORBVW5MFURX7K.json","graph_json":"https://pith.science/api/pith-number/UMARYFTLPSOEQORBVW5MFURX7K/graph.json","events_json":"https://pith.science/api/pith-number/UMARYFTLPSOEQORBVW5MFURX7K/events.json","paper":"https://pith.science/paper/UMARYFTL"},"agent_actions":{"view_html":"https://pith.science/pith/UMARYFTLPSOEQORBVW5MFURX7K","download_json":"https://pith.science/pith/UMARYFTLPSOEQORBVW5MFURX7K.json","view_paper":"https://pith.science/paper/UMARYFTL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.1605&json=true","fetch_graph":"https://pith.science/api/pith-number/UMARYFTLPSOEQORBVW5MFURX7K/graph.json","fetch_events":"https://pith.science/api/pith-number/UMARYFTLPSOEQORBVW5MFURX7K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UMARYFTLPSOEQORBVW5MFURX7K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UMARYFTLPSOEQORBVW5MFURX7K/action/storage_attestation","attest_author":"https://pith.science/pith/UMARYFTLPSOEQORBVW5MFURX7K/action/author_attestation","sign_citation":"https://pith.science/pith/UMARYFTLPSOEQORBVW5MFURX7K/action/citation_signature","submit_replication":"https://pith.science/pith/UMARYFTLPSOEQORBVW5MFURX7K/action/replication_record"}},"created_at":"2026-05-17T23:53:36.693258+00:00","updated_at":"2026-05-17T23:53:36.693258+00:00"}