{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UKX7WLFQN6H3USP3S7Y3KIS2BL","short_pith_number":"pith:UKX7WLFQ","canonical_record":{"source":{"id":"1609.02627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-09-09T00:53:21Z","cross_cats_sorted":[],"title_canon_sha256":"836f63320b60a1b33324e4f77d02bcf165c27800429b9664cc8684454b5c54a3","abstract_canon_sha256":"f24d56afdb8620c5c9bbde20a7c21ac5f8f0bcf392f070edab263503803566b3"},"schema_version":"1.0"},"canonical_sha256":"a2affb2cb06f8fba49fb97f1b5225a0acd82b7ce71a13e86d17fd12fc7b4b797","source":{"kind":"arxiv","id":"1609.02627","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.02627","created_at":"2026-05-18T01:04:52Z"},{"alias_kind":"arxiv_version","alias_value":"1609.02627v1","created_at":"2026-05-18T01:04:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02627","created_at":"2026-05-18T01:04:52Z"},{"alias_kind":"pith_short_12","alias_value":"UKX7WLFQN6H3","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UKX7WLFQN6H3USP3","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UKX7WLFQ","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UKX7WLFQN6H3USP3S7Y3KIS2BL","target":"record","payload":{"canonical_record":{"source":{"id":"1609.02627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-09-09T00:53:21Z","cross_cats_sorted":[],"title_canon_sha256":"836f63320b60a1b33324e4f77d02bcf165c27800429b9664cc8684454b5c54a3","abstract_canon_sha256":"f24d56afdb8620c5c9bbde20a7c21ac5f8f0bcf392f070edab263503803566b3"},"schema_version":"1.0"},"canonical_sha256":"a2affb2cb06f8fba49fb97f1b5225a0acd82b7ce71a13e86d17fd12fc7b4b797","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:52.949054Z","signature_b64":"L9TP+2bpKRWdibykCKLKX8kO7HTBsqudLeWmNcyc/K7j4Xl88LXNfAvam4WPHFtYB53m7NNY549i9KR/n/C0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2affb2cb06f8fba49fb97f1b5225a0acd82b7ce71a13e86d17fd12fc7b4b797","last_reissued_at":"2026-05-18T01:04:52.948244Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:52.948244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.02627","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:04:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j9biRXaJM3QCJYeJmuc1geyY8TWw/8PyHvIDIP8aZ8B50mqzGir6f7j+hzAbY0q6M6pZvSN2wu/bx0T4PuHlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T04:37:30.759731Z"},"content_sha256":"ce404ab3d69c3f2284a55b35ccd464373aef823be9378935606b6a2abe299cc3","schema_version":"1.0","event_id":"sha256:ce404ab3d69c3f2284a55b35ccd464373aef823be9378935606b6a2abe299cc3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UKX7WLFQN6H3USP3S7Y3KIS2BL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coloring trees in reverse mathematics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Damir Dzhafarov, Ludovic Patey","submitted_at":"2016-09-09T00:53:21Z","abstract_excerpt":"The tree theorem for pairs ($\\mathsf{TT}^2_2$), first introduced by Chubb, Hirst, and McNicholl, asserts that given a finite coloring of pairs of comparable nodes in the full binary tree $2^{<\\omega}$, there is a set of nodes isomorphic to $2^{<\\omega}$ which is homogeneous for the coloring. This is a generalization of the more familiar Ramsey's theorem for pairs ($\\mathsf{RT}^2_2$), which has been studied extensively in computability theory and reverse mathematics. We answer a longstanding open question about the strength of $\\mathsf{TT}^2_2$, by showing that this principle does not imply the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02627","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:04:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fiDqHPVcCz0V0YYnOBwmVdba4SWhrqTR1T7AIVTvkoQdSHCvpv1zKX677jvq3YgYxSaOk0wRV7daX7XBvMybAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T04:37:30.760171Z"},"content_sha256":"60801e85bafcf79f1119a317d9388258402ebc245444f7455768952fcd1fa459","schema_version":"1.0","event_id":"sha256:60801e85bafcf79f1119a317d9388258402ebc245444f7455768952fcd1fa459"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UKX7WLFQN6H3USP3S7Y3KIS2BL/bundle.json","state_url":"https://pith.science/pith/UKX7WLFQN6H3USP3S7Y3KIS2BL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UKX7WLFQN6H3USP3S7Y3KIS2BL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-11T04:37:30Z","links":{"resolver":"https://pith.science/pith/UKX7WLFQN6H3USP3S7Y3KIS2BL","bundle":"https://pith.science/pith/UKX7WLFQN6H3USP3S7Y3KIS2BL/bundle.json","state":"https://pith.science/pith/UKX7WLFQN6H3USP3S7Y3KIS2BL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UKX7WLFQN6H3USP3S7Y3KIS2BL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UKX7WLFQN6H3USP3S7Y3KIS2BL","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":"f24d56afdb8620c5c9bbde20a7c21ac5f8f0bcf392f070edab263503803566b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-09-09T00:53:21Z","title_canon_sha256":"836f63320b60a1b33324e4f77d02bcf165c27800429b9664cc8684454b5c54a3"},"schema_version":"1.0","source":{"id":"1609.02627","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.02627","created_at":"2026-05-18T01:04:52Z"},{"alias_kind":"arxiv_version","alias_value":"1609.02627v1","created_at":"2026-05-18T01:04:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.02627","created_at":"2026-05-18T01:04:52Z"},{"alias_kind":"pith_short_12","alias_value":"UKX7WLFQN6H3","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UKX7WLFQN6H3USP3","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UKX7WLFQ","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:60801e85bafcf79f1119a317d9388258402ebc245444f7455768952fcd1fa459","target":"graph","created_at":"2026-05-18T01:04:52Z","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"},"paper":{"abstract_excerpt":"The tree theorem for pairs ($\\mathsf{TT}^2_2$), first introduced by Chubb, Hirst, and McNicholl, asserts that given a finite coloring of pairs of comparable nodes in the full binary tree $2^{<\\omega}$, there is a set of nodes isomorphic to $2^{<\\omega}$ which is homogeneous for the coloring. This is a generalization of the more familiar Ramsey's theorem for pairs ($\\mathsf{RT}^2_2$), which has been studied extensively in computability theory and reverse mathematics. We answer a longstanding open question about the strength of $\\mathsf{TT}^2_2$, by showing that this principle does not imply the","authors_text":"Damir Dzhafarov, Ludovic Patey","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-09-09T00:53:21Z","title":"Coloring trees in reverse mathematics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.02627","kind":"arxiv","version":1},"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:ce404ab3d69c3f2284a55b35ccd464373aef823be9378935606b6a2abe299cc3","target":"record","created_at":"2026-05-18T01:04:52Z","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":"f24d56afdb8620c5c9bbde20a7c21ac5f8f0bcf392f070edab263503803566b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2016-09-09T00:53:21Z","title_canon_sha256":"836f63320b60a1b33324e4f77d02bcf165c27800429b9664cc8684454b5c54a3"},"schema_version":"1.0","source":{"id":"1609.02627","kind":"arxiv","version":1}},"canonical_sha256":"a2affb2cb06f8fba49fb97f1b5225a0acd82b7ce71a13e86d17fd12fc7b4b797","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2affb2cb06f8fba49fb97f1b5225a0acd82b7ce71a13e86d17fd12fc7b4b797","first_computed_at":"2026-05-18T01:04:52.948244Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:52.948244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L9TP+2bpKRWdibykCKLKX8kO7HTBsqudLeWmNcyc/K7j4Xl88LXNfAvam4WPHFtYB53m7NNY549i9KR/n/C0Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:52.949054Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.02627","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce404ab3d69c3f2284a55b35ccd464373aef823be9378935606b6a2abe299cc3","sha256:60801e85bafcf79f1119a317d9388258402ebc245444f7455768952fcd1fa459"],"state_sha256":"12845525e58815957c8edad2bf66c35b422e29a69c006afe8fed39fee529556c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WgeqlDFFON0hUBFR4eCiFhncqz90TfCiBd95mzWvrCJlhHj7fNcC/RyzFgBhfNOsOD7lO5ORc+ogtX5la2SvCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T04:37:30.763464Z","bundle_sha256":"9e01cbdea52f7b1dd24d641a318d17b7a81b4efb376ace08a99c8cb20b1b20a4"}}