{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4ISJJZA4U45E3CSIDL76BUWQPW","short_pith_number":"pith:4ISJJZA4","schema_version":"1.0","canonical_sha256":"e22494e41ca73a4d8a481affe0d2d07dbe073c42857f1f444e1162e3e19ab14e","source":{"kind":"arxiv","id":"1107.0783","version":1},"attestation_state":"computed","paper":{"title":"The Construction of Numerically Calabi-Yau Orders on Projective Surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.RA","authors_text":"Hugo Bowne-Anderson","submitted_at":"2011-07-05T05:53:42Z","abstract_excerpt":"In this paper, we construct a vast collection of maximal numerically Calabi-Yau orders utilising a noncommutative analogue of the well-known commutative cyclic covering trick. Such orders play an integral role in the Mori program for orders on projective surfaces and although we know a substantial amount about them, there are relatively few known examples."},"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":"1107.0783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2011-07-05T05:53:42Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"a65b7a56d370c45f2f8ff3da8e127b9c72fa7738a4a6e0e573d8671a8ca9fba0","abstract_canon_sha256":"43ec23b668f18c5f8bc6a85adeacc9f8e60dfd0ab24ae62248cc7fa13efbd3ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:52.695498Z","signature_b64":"Abl5S59xyErVhpX7r5qp4BbfBhX732cKOeFjY06OK09x7IjyHKsB0vlRYSwRbv4knF6ccWxnKKQxu3b1kmXeAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e22494e41ca73a4d8a481affe0d2d07dbe073c42857f1f444e1162e3e19ab14e","last_reissued_at":"2026-05-18T04:18:52.695049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:52.695049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Construction of Numerically Calabi-Yau Orders on Projective Surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.RA","authors_text":"Hugo Bowne-Anderson","submitted_at":"2011-07-05T05:53:42Z","abstract_excerpt":"In this paper, we construct a vast collection of maximal numerically Calabi-Yau orders utilising a noncommutative analogue of the well-known commutative cyclic covering trick. Such orders play an integral role in the Mori program for orders on projective surfaces and although we know a substantial amount about them, there are relatively few known examples."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0783","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":""},"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":"1107.0783","created_at":"2026-05-18T04:18:52.695121+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.0783v1","created_at":"2026-05-18T04:18:52.695121+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0783","created_at":"2026-05-18T04:18:52.695121+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ISJJZA4U45E","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ISJJZA4U45E3CSI","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ISJJZA4","created_at":"2026-05-18T12:26:20.644004+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/4ISJJZA4U45E3CSIDL76BUWQPW","json":"https://pith.science/pith/4ISJJZA4U45E3CSIDL76BUWQPW.json","graph_json":"https://pith.science/api/pith-number/4ISJJZA4U45E3CSIDL76BUWQPW/graph.json","events_json":"https://pith.science/api/pith-number/4ISJJZA4U45E3CSIDL76BUWQPW/events.json","paper":"https://pith.science/paper/4ISJJZA4"},"agent_actions":{"view_html":"https://pith.science/pith/4ISJJZA4U45E3CSIDL76BUWQPW","download_json":"https://pith.science/pith/4ISJJZA4U45E3CSIDL76BUWQPW.json","view_paper":"https://pith.science/paper/4ISJJZA4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.0783&json=true","fetch_graph":"https://pith.science/api/pith-number/4ISJJZA4U45E3CSIDL76BUWQPW/graph.json","fetch_events":"https://pith.science/api/pith-number/4ISJJZA4U45E3CSIDL76BUWQPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ISJJZA4U45E3CSIDL76BUWQPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ISJJZA4U45E3CSIDL76BUWQPW/action/storage_attestation","attest_author":"https://pith.science/pith/4ISJJZA4U45E3CSIDL76BUWQPW/action/author_attestation","sign_citation":"https://pith.science/pith/4ISJJZA4U45E3CSIDL76BUWQPW/action/citation_signature","submit_replication":"https://pith.science/pith/4ISJJZA4U45E3CSIDL76BUWQPW/action/replication_record"}},"created_at":"2026-05-18T04:18:52.695121+00:00","updated_at":"2026-05-18T04:18:52.695121+00:00"}