{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:EHAOXF6T3LG7LTH7LO3FJ4DQ7Q","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"83b0e407cb2a000f8ae4e757010ff402202de4ee2211aa6b0e715243fd22bc8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2020-07-19T18:27:42Z","title_canon_sha256":"17caaf0cdbc6b6d56bfc6719c15b83172fa45e384fb32d90396d54fe0ed49644"},"schema_version":"1.0","source":{"id":"2007.09739","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.09739","created_at":"2026-07-05T02:32:32Z"},{"alias_kind":"arxiv_version","alias_value":"2007.09739v2","created_at":"2026-07-05T02:32:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.09739","created_at":"2026-07-05T02:32:32Z"},{"alias_kind":"pith_short_12","alias_value":"EHAOXF6T3LG7","created_at":"2026-07-05T02:32:32Z"},{"alias_kind":"pith_short_16","alias_value":"EHAOXF6T3LG7LTH7","created_at":"2026-07-05T02:32:32Z"},{"alias_kind":"pith_short_8","alias_value":"EHAOXF6T","created_at":"2026-07-05T02:32:32Z"}],"graph_snapshots":[{"event_id":"sha256:7c8514a819c96a7d9697d168485d6efae3eea82f8245776b38df17bd3963585a","target":"graph","created_at":"2026-07-05T02:32:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.09739/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Milliken's tree theorem is a deep result in combinatorics that generalizes a vast number of other results in the subject, most notably Ramsey's theorem and its many variants and consequences. Motivated by a question of Dobrinen, we initiate the study of Milliken's tree theorem from the point of view of computability theory. Our advance here stems from a careful analysis of the Halpern-La\\\"{u}chli theorem which shows that it can be carried out effectively (i.e., that it is computably true). We use this as the basis of a new inductive proof of Milliken's tree theorem that permits us to gauge its","authors_text":"Beno\\^it Monin, Damir D. Dzhafarov, Ludovic Patey, Paul-Elliot Angl\\`es d'Auriac, Peter A. Cholak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2020-07-19T18:27:42Z","title":"Milliken's tree theorem and its applications: a computability-theoretic perspective"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.09739","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e61cfb0f03d8b46a438d42bc2c388ece1fdb4bb64ddf2ad6fbb6601c0ef822d0","target":"record","created_at":"2026-07-05T02:32:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"83b0e407cb2a000f8ae4e757010ff402202de4ee2211aa6b0e715243fd22bc8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2020-07-19T18:27:42Z","title_canon_sha256":"17caaf0cdbc6b6d56bfc6719c15b83172fa45e384fb32d90396d54fe0ed49644"},"schema_version":"1.0","source":{"id":"2007.09739","kind":"arxiv","version":2}},"canonical_sha256":"21c0eb97d3dacdf5ccff5bb654f070fc2a2e3d8bec1fc0db3255764a7b64df2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21c0eb97d3dacdf5ccff5bb654f070fc2a2e3d8bec1fc0db3255764a7b64df2b","first_computed_at":"2026-07-05T02:32:32.958012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:32:32.958012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S5zxb9EgVnQa/GfkujPuPIhLzeyEgOyakPREp9By0kN0VbwKYVgXyUJ3kLZdS8RfnKbqZV6lEhUFOIqVv8NGCg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:32:32.958603Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.09739","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e61cfb0f03d8b46a438d42bc2c388ece1fdb4bb64ddf2ad6fbb6601c0ef822d0","sha256:7c8514a819c96a7d9697d168485d6efae3eea82f8245776b38df17bd3963585a"],"state_sha256":"b741476045b25d5e940940533b1c652a21f614783740a85261a194e3c1272e4a"}