{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:G6T5F4ZB7EGRJWAZUKC42TXSUD","short_pith_number":"pith:G6T5F4ZB","schema_version":"1.0","canonical_sha256":"37a7d2f321f90d14d819a285cd4ef2a0d17469672367eb426f389b8b8dc1e8f6","source":{"kind":"arxiv","id":"1202.4092","version":1},"attestation_state":"computed","paper":{"title":"Automorphism Groups of Countably Categorical Linear Orders are Extremely Amenable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Daniel McDonald, Fran\\c{c}ois G. Dorais, Manuel Rivera, Steven Gubkin","submitted_at":"2012-02-18T18:31:24Z","abstract_excerpt":"We show that the automorphism groups of countably categorical linear orders are extremely amenable. Using methods of Kechris, Pestov, and Todorcevic, we use this fact to derive a structural Ramsey theorem for certain families of finite ordered structures with finitely many partial equivalence relations with convex classes."},"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":"1202.4092","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-02-18T18:31:24Z","cross_cats_sorted":[],"title_canon_sha256":"7449d217431525cb19c471a95b7a4cdbd107ddeb24698ca427a7248cce45df77","abstract_canon_sha256":"83570b4dd4a3034ae0c72e8db93d107016b6196f21c795475d641cc88bebb246"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:06.597483Z","signature_b64":"pQmn57k2PGih1+dTIdOBhNhI3yG0Ht8x73cPL/swyULdxsYMJfnWJybXuwEm2HBF84ZqhswpVoMnvWJLqbEgCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37a7d2f321f90d14d819a285cd4ef2a0d17469672367eb426f389b8b8dc1e8f6","last_reissued_at":"2026-05-18T02:59:06.596681Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:06.596681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automorphism Groups of Countably Categorical Linear Orders are Extremely Amenable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Daniel McDonald, Fran\\c{c}ois G. Dorais, Manuel Rivera, Steven Gubkin","submitted_at":"2012-02-18T18:31:24Z","abstract_excerpt":"We show that the automorphism groups of countably categorical linear orders are extremely amenable. Using methods of Kechris, Pestov, and Todorcevic, we use this fact to derive a structural Ramsey theorem for certain families of finite ordered structures with finitely many partial equivalence relations with convex classes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4092","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":"1202.4092","created_at":"2026-05-18T02:59:06.596828+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.4092v1","created_at":"2026-05-18T02:59:06.596828+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4092","created_at":"2026-05-18T02:59:06.596828+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6T5F4ZB7EGR","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6T5F4ZB7EGRJWAZ","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6T5F4ZB","created_at":"2026-05-18T12:27:06.952714+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/G6T5F4ZB7EGRJWAZUKC42TXSUD","json":"https://pith.science/pith/G6T5F4ZB7EGRJWAZUKC42TXSUD.json","graph_json":"https://pith.science/api/pith-number/G6T5F4ZB7EGRJWAZUKC42TXSUD/graph.json","events_json":"https://pith.science/api/pith-number/G6T5F4ZB7EGRJWAZUKC42TXSUD/events.json","paper":"https://pith.science/paper/G6T5F4ZB"},"agent_actions":{"view_html":"https://pith.science/pith/G6T5F4ZB7EGRJWAZUKC42TXSUD","download_json":"https://pith.science/pith/G6T5F4ZB7EGRJWAZUKC42TXSUD.json","view_paper":"https://pith.science/paper/G6T5F4ZB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.4092&json=true","fetch_graph":"https://pith.science/api/pith-number/G6T5F4ZB7EGRJWAZUKC42TXSUD/graph.json","fetch_events":"https://pith.science/api/pith-number/G6T5F4ZB7EGRJWAZUKC42TXSUD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6T5F4ZB7EGRJWAZUKC42TXSUD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6T5F4ZB7EGRJWAZUKC42TXSUD/action/storage_attestation","attest_author":"https://pith.science/pith/G6T5F4ZB7EGRJWAZUKC42TXSUD/action/author_attestation","sign_citation":"https://pith.science/pith/G6T5F4ZB7EGRJWAZUKC42TXSUD/action/citation_signature","submit_replication":"https://pith.science/pith/G6T5F4ZB7EGRJWAZUKC42TXSUD/action/replication_record"}},"created_at":"2026-05-18T02:59:06.596828+00:00","updated_at":"2026-05-18T02:59:06.596828+00:00"}