{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:CGLKJCVO3JEB4J3H2JQGRBR3AM","short_pith_number":"pith:CGLKJCVO","schema_version":"1.0","canonical_sha256":"1196a48aaeda481e2767d26068863b031bbf673b272f330e0d2687727bbf7d6e","source":{"kind":"arxiv","id":"2307.06731","version":6},"attestation_state":"computed","paper":{"title":"Trivial Isomorphisms between Reduced Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Alessandro Vignati, Ben De Bondt, Ilijas Farah","submitted_at":"2023-07-13T13:04:42Z","abstract_excerpt":"We introduce a general method for showing under weak forcing axioms that reduced products of countable models of a theory $T$ have as few automorphisms as possible. We show that such forcing axioms imply that reduced products of countably infinite or finite fields, linear orders, trees, or random graphs have only trivial automorphisms. We also show that Todor\\v{c}evi\\'c's Open Colouring Axiom, $\\mathsf{OCA}_{\\mathrm{T}}$, implies that all automorphisms of $\\mathcal{P}(\\mathbb{N})/{\\mathrm{Fin}}$ are trivial."},"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":"2307.06731","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2023-07-13T13:04:42Z","cross_cats_sorted":[],"title_canon_sha256":"c665a9ce5ef83be2357178efd6d719f9a6e0093d47ec394dff9f8b9dfa3b7e06","abstract_canon_sha256":"c0af354630e207791a1088476c55f5085b189db54af0965accc75fdfb39e56f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:27:18.934678Z","signature_b64":"VQ+YTMXc0UQwsY1abI1a1J6dmkNXmh788930JG6N5ynfSwGbiT10tCo7HzMaeCsowMP17Lxb2xqn+pPI5e0iBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1196a48aaeda481e2767d26068863b031bbf673b272f330e0d2687727bbf7d6e","last_reissued_at":"2026-07-05T09:27:18.934167Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:27:18.934167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trivial Isomorphisms between Reduced Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Alessandro Vignati, Ben De Bondt, Ilijas Farah","submitted_at":"2023-07-13T13:04:42Z","abstract_excerpt":"We introduce a general method for showing under weak forcing axioms that reduced products of countable models of a theory $T$ have as few automorphisms as possible. We show that such forcing axioms imply that reduced products of countably infinite or finite fields, linear orders, trees, or random graphs have only trivial automorphisms. We also show that Todor\\v{c}evi\\'c's Open Colouring Axiom, $\\mathsf{OCA}_{\\mathrm{T}}$, implies that all automorphisms of $\\mathcal{P}(\\mathbb{N})/{\\mathrm{Fin}}$ are trivial."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.06731","kind":"arxiv","version":6},"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/2307.06731/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":"2307.06731","created_at":"2026-07-05T09:27:18.934226+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.06731v6","created_at":"2026-07-05T09:27:18.934226+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.06731","created_at":"2026-07-05T09:27:18.934226+00:00"},{"alias_kind":"pith_short_12","alias_value":"CGLKJCVO3JEB","created_at":"2026-07-05T09:27:18.934226+00:00"},{"alias_kind":"pith_short_16","alias_value":"CGLKJCVO3JEB4J3H","created_at":"2026-07-05T09:27:18.934226+00:00"},{"alias_kind":"pith_short_8","alias_value":"CGLKJCVO","created_at":"2026-07-05T09:27:18.934226+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.10073","citing_title":"Rigidity of Higson coronas","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CGLKJCVO3JEB4J3H2JQGRBR3AM","json":"https://pith.science/pith/CGLKJCVO3JEB4J3H2JQGRBR3AM.json","graph_json":"https://pith.science/api/pith-number/CGLKJCVO3JEB4J3H2JQGRBR3AM/graph.json","events_json":"https://pith.science/api/pith-number/CGLKJCVO3JEB4J3H2JQGRBR3AM/events.json","paper":"https://pith.science/paper/CGLKJCVO"},"agent_actions":{"view_html":"https://pith.science/pith/CGLKJCVO3JEB4J3H2JQGRBR3AM","download_json":"https://pith.science/pith/CGLKJCVO3JEB4J3H2JQGRBR3AM.json","view_paper":"https://pith.science/paper/CGLKJCVO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.06731&json=true","fetch_graph":"https://pith.science/api/pith-number/CGLKJCVO3JEB4J3H2JQGRBR3AM/graph.json","fetch_events":"https://pith.science/api/pith-number/CGLKJCVO3JEB4J3H2JQGRBR3AM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CGLKJCVO3JEB4J3H2JQGRBR3AM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CGLKJCVO3JEB4J3H2JQGRBR3AM/action/storage_attestation","attest_author":"https://pith.science/pith/CGLKJCVO3JEB4J3H2JQGRBR3AM/action/author_attestation","sign_citation":"https://pith.science/pith/CGLKJCVO3JEB4J3H2JQGRBR3AM/action/citation_signature","submit_replication":"https://pith.science/pith/CGLKJCVO3JEB4J3H2JQGRBR3AM/action/replication_record"}},"created_at":"2026-07-05T09:27:18.934226+00:00","updated_at":"2026-07-05T09:27:18.934226+00:00"}