{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:S6ZX5OT7IJ4YYIUS2XJZL6HMWP","short_pith_number":"pith:S6ZX5OT7","canonical_record":{"source":{"id":"1008.4548","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2010-08-26T17:07:12Z","cross_cats_sorted":[],"title_canon_sha256":"66e3bd78fe1eadcb12d2205cc2b562f81ed195655279af718e4c365959a145aa","abstract_canon_sha256":"c7a97e516a2e312187dae19e536b07ac6f75a01b997393042ab3af8fcf7e94ba"},"schema_version":"1.0"},"canonical_sha256":"97b37eba7f42798c2292d5d395f8ecb3ccc7438519e7b13e7b4c9405609831b0","source":{"kind":"arxiv","id":"1008.4548","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.4548","created_at":"2026-05-18T04:32:11Z"},{"alias_kind":"arxiv_version","alias_value":"1008.4548v2","created_at":"2026-05-18T04:32:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4548","created_at":"2026-05-18T04:32:11Z"},{"alias_kind":"pith_short_12","alias_value":"S6ZX5OT7IJ4Y","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"S6ZX5OT7IJ4YYIUS","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"S6ZX5OT7","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:S6ZX5OT7IJ4YYIUS2XJZL6HMWP","target":"record","payload":{"canonical_record":{"source":{"id":"1008.4548","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2010-08-26T17:07:12Z","cross_cats_sorted":[],"title_canon_sha256":"66e3bd78fe1eadcb12d2205cc2b562f81ed195655279af718e4c365959a145aa","abstract_canon_sha256":"c7a97e516a2e312187dae19e536b07ac6f75a01b997393042ab3af8fcf7e94ba"},"schema_version":"1.0"},"canonical_sha256":"97b37eba7f42798c2292d5d395f8ecb3ccc7438519e7b13e7b4c9405609831b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:11.725147Z","signature_b64":"mV41MZN7EIzAfvUTd/xoct7Eob0O3wkVce9lvtX3zno5/4eAHDaa1yI5UMsvI9mOyzSA0OK9Gki3+K3op9M3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97b37eba7f42798c2292d5d395f8ecb3ccc7438519e7b13e7b4c9405609831b0","last_reissued_at":"2026-05-18T04:32:11.724669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:11.724669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1008.4548","source_version":2,"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-18T04:32:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IyAGmhPpZMLYozMwVwfLnEhA0/bK8dauTjpR9+h3SaU/Gmv14zq+5G1AZ7N5FjiK1mItWD4Xz3UOhn3SYi37Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:38:14.313135Z"},"content_sha256":"14e844edc4be601ff4733a7055991831a7c0647b3e5517a0870001380f0005b4","schema_version":"1.0","event_id":"sha256:14e844edc4be601ff4733a7055991831a7c0647b3e5517a0870001380f0005b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:S6ZX5OT7IJ4YYIUS2XJZL6HMWP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reverse mathematics and infinite traceable graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"David Galvin, Peter Cholak, Reed Solomon","submitted_at":"2010-08-26T17:07:12Z","abstract_excerpt":"This paper falls within the general program of investigating the proof theoretic strength (in terms of reverse mathematics) of combinatorial principals which follow from versions of Ramsey's theorem. We examine two statements in graph theory and one statement in lattice theory proved by Galvin, Rival and Sands \\cite{GRS:82} using Ramsey's theorem for 4-tuples. Our main results are that the statements concerning graph theory are equivalent to Ramsey's theorem for 4-tuples over $\\RCA$ while the statement concerning lattices is provable in $\\RCA$.\n  Revised 12/2010. To appear in Archive for Mathe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4548","kind":"arxiv","version":2},"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-18T04:32:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M7WmaKZrCaQwH1fSEU+j+2GI/VCCMucR7m2sbsUZQRuqDduEUuFjB82k1ac5XTP+M3nJNe1oLoanA58vOkmGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:38:14.313497Z"},"content_sha256":"5fb943758e763ac6a1d8be9f8b7a02cb402255dbde263fa43aabea0b42d65c65","schema_version":"1.0","event_id":"sha256:5fb943758e763ac6a1d8be9f8b7a02cb402255dbde263fa43aabea0b42d65c65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S6ZX5OT7IJ4YYIUS2XJZL6HMWP/bundle.json","state_url":"https://pith.science/pith/S6ZX5OT7IJ4YYIUS2XJZL6HMWP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S6ZX5OT7IJ4YYIUS2XJZL6HMWP/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-06-01T00:38:14Z","links":{"resolver":"https://pith.science/pith/S6ZX5OT7IJ4YYIUS2XJZL6HMWP","bundle":"https://pith.science/pith/S6ZX5OT7IJ4YYIUS2XJZL6HMWP/bundle.json","state":"https://pith.science/pith/S6ZX5OT7IJ4YYIUS2XJZL6HMWP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S6ZX5OT7IJ4YYIUS2XJZL6HMWP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:S6ZX5OT7IJ4YYIUS2XJZL6HMWP","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":"c7a97e516a2e312187dae19e536b07ac6f75a01b997393042ab3af8fcf7e94ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2010-08-26T17:07:12Z","title_canon_sha256":"66e3bd78fe1eadcb12d2205cc2b562f81ed195655279af718e4c365959a145aa"},"schema_version":"1.0","source":{"id":"1008.4548","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1008.4548","created_at":"2026-05-18T04:32:11Z"},{"alias_kind":"arxiv_version","alias_value":"1008.4548v2","created_at":"2026-05-18T04:32:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4548","created_at":"2026-05-18T04:32:11Z"},{"alias_kind":"pith_short_12","alias_value":"S6ZX5OT7IJ4Y","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"S6ZX5OT7IJ4YYIUS","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"S6ZX5OT7","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:5fb943758e763ac6a1d8be9f8b7a02cb402255dbde263fa43aabea0b42d65c65","target":"graph","created_at":"2026-05-18T04:32:11Z","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":"This paper falls within the general program of investigating the proof theoretic strength (in terms of reverse mathematics) of combinatorial principals which follow from versions of Ramsey's theorem. We examine two statements in graph theory and one statement in lattice theory proved by Galvin, Rival and Sands \\cite{GRS:82} using Ramsey's theorem for 4-tuples. Our main results are that the statements concerning graph theory are equivalent to Ramsey's theorem for 4-tuples over $\\RCA$ while the statement concerning lattices is provable in $\\RCA$.\n  Revised 12/2010. To appear in Archive for Mathe","authors_text":"David Galvin, Peter Cholak, Reed Solomon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2010-08-26T17:07:12Z","title":"Reverse mathematics and infinite traceable graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4548","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:14e844edc4be601ff4733a7055991831a7c0647b3e5517a0870001380f0005b4","target":"record","created_at":"2026-05-18T04:32:11Z","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":"c7a97e516a2e312187dae19e536b07ac6f75a01b997393042ab3af8fcf7e94ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2010-08-26T17:07:12Z","title_canon_sha256":"66e3bd78fe1eadcb12d2205cc2b562f81ed195655279af718e4c365959a145aa"},"schema_version":"1.0","source":{"id":"1008.4548","kind":"arxiv","version":2}},"canonical_sha256":"97b37eba7f42798c2292d5d395f8ecb3ccc7438519e7b13e7b4c9405609831b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97b37eba7f42798c2292d5d395f8ecb3ccc7438519e7b13e7b4c9405609831b0","first_computed_at":"2026-05-18T04:32:11.724669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:32:11.724669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mV41MZN7EIzAfvUTd/xoct7Eob0O3wkVce9lvtX3zno5/4eAHDaa1yI5UMsvI9mOyzSA0OK9Gki3+K3op9M3Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:32:11.725147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1008.4548","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14e844edc4be601ff4733a7055991831a7c0647b3e5517a0870001380f0005b4","sha256:5fb943758e763ac6a1d8be9f8b7a02cb402255dbde263fa43aabea0b42d65c65"],"state_sha256":"58d108c96931d9280226571ccb5a0da5472246087a5520de7770549db23d74e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w0YlChWJyGoBO0/T/FhXbDQ9LhhGneJ8AOBkwhLZz9vY32+0SGbKT8fu2UHMFvdJpJ+agdMvWdadrGF5iJ0iCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T00:38:14.315673Z","bundle_sha256":"0795f81508b087684d0296b0062d03a788d151c78e4919f5bc5d69d51b339986"}}