{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HXOAYQKUJP4JS27LMCH5HHTQNU","short_pith_number":"pith:HXOAYQKU","schema_version":"1.0","canonical_sha256":"3ddc0c41544bf8996beb608fd39e706d19177e08f83d96b75d054a87a6b2ede4","source":{"kind":"arxiv","id":"1209.5372","version":1},"attestation_state":"computed","paper":{"title":"Simplicity of twin tree lattices with non-trivial commutation relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Bertrand Remy (ICJ), Pierre-Emmanuel Caprace","submitted_at":"2012-09-24T19:34:55Z","abstract_excerpt":"We prove a simplicity criterion for certain twin tree lattices. It applies to all rank two Kac-Moody groups over finite fields with non-trivial commutation relations, thereby yielding examples of simple non-uniform lattices in the product of two trees."},"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":"1209.5372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2012-09-24T19:34:55Z","cross_cats_sorted":[],"title_canon_sha256":"4247ff9344a6073c4a073549b3f6066b3c91cab8d32e06f37025520e93d80696","abstract_canon_sha256":"c8280149b10d83e9eea2950707f345c06a68fefa6b5285682e5d216b327ef305"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:58.320613Z","signature_b64":"J9KLluUdE0XNrKhSRsz7dR22+D/a7tvBbjCNBrl+jOMKPC2qbzrB+9GA2CHURr/Mt+hoZ9yKNl0cD/D31iITBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ddc0c41544bf8996beb608fd39e706d19177e08f83d96b75d054a87a6b2ede4","last_reissued_at":"2026-05-18T03:44:58.320028Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:58.320028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simplicity of twin tree lattices with non-trivial commutation relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Bertrand Remy (ICJ), Pierre-Emmanuel Caprace","submitted_at":"2012-09-24T19:34:55Z","abstract_excerpt":"We prove a simplicity criterion for certain twin tree lattices. It applies to all rank two Kac-Moody groups over finite fields with non-trivial commutation relations, thereby yielding examples of simple non-uniform lattices in the product of two trees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5372","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":"1209.5372","created_at":"2026-05-18T03:44:58.320112+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.5372v1","created_at":"2026-05-18T03:44:58.320112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5372","created_at":"2026-05-18T03:44:58.320112+00:00"},{"alias_kind":"pith_short_12","alias_value":"HXOAYQKUJP4J","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HXOAYQKUJP4JS27L","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HXOAYQKU","created_at":"2026-05-18T12:27:09.501522+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/HXOAYQKUJP4JS27LMCH5HHTQNU","json":"https://pith.science/pith/HXOAYQKUJP4JS27LMCH5HHTQNU.json","graph_json":"https://pith.science/api/pith-number/HXOAYQKUJP4JS27LMCH5HHTQNU/graph.json","events_json":"https://pith.science/api/pith-number/HXOAYQKUJP4JS27LMCH5HHTQNU/events.json","paper":"https://pith.science/paper/HXOAYQKU"},"agent_actions":{"view_html":"https://pith.science/pith/HXOAYQKUJP4JS27LMCH5HHTQNU","download_json":"https://pith.science/pith/HXOAYQKUJP4JS27LMCH5HHTQNU.json","view_paper":"https://pith.science/paper/HXOAYQKU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.5372&json=true","fetch_graph":"https://pith.science/api/pith-number/HXOAYQKUJP4JS27LMCH5HHTQNU/graph.json","fetch_events":"https://pith.science/api/pith-number/HXOAYQKUJP4JS27LMCH5HHTQNU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HXOAYQKUJP4JS27LMCH5HHTQNU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HXOAYQKUJP4JS27LMCH5HHTQNU/action/storage_attestation","attest_author":"https://pith.science/pith/HXOAYQKUJP4JS27LMCH5HHTQNU/action/author_attestation","sign_citation":"https://pith.science/pith/HXOAYQKUJP4JS27LMCH5HHTQNU/action/citation_signature","submit_replication":"https://pith.science/pith/HXOAYQKUJP4JS27LMCH5HHTQNU/action/replication_record"}},"created_at":"2026-05-18T03:44:58.320112+00:00","updated_at":"2026-05-18T03:44:58.320112+00:00"}