{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2WGYKHGYBEPPDIMOEXEX6RIJDP","short_pith_number":"pith:2WGYKHGY","schema_version":"1.0","canonical_sha256":"d58d851cd8091ef1a18e25c97f45091bc0597c29f7a7100248110b30a6fa29c6","source":{"kind":"arxiv","id":"1611.05423","version":3},"attestation_state":"computed","paper":{"title":"Density of monochromatic infinite subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Louis DeBiasio, Paul McKenney","submitted_at":"2016-11-16T19:58:48Z","abstract_excerpt":"For any countably infinite graph $G$, Ramsey's theorem guarantees an infinite monochromatic copy of $G$ in any $r$-coloring of the edges of the countably infinite complete graph $K_\\mathbb{N}$. Taking this a step further, it is natural to wonder how \"large\" of a monochromatic copy of $G$ we can find with respect to some measure -- for instance, the density (or upper density) of the vertex set of $G$ in the positive integers. Unlike finite Ramsey theory, where this question has been studied extensively, the analogous problem for infinite graphs has been mostly overlooked.\n  In one of the few re"},"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":"1611.05423","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-16T19:58:48Z","cross_cats_sorted":[],"title_canon_sha256":"5e12d9f1bacbcdea6fa6283cfcf88b1f7c3fc603d055da73adfd048c03bebb9c","abstract_canon_sha256":"7f19d95d5b7a7ee8e454969cd8c993d77e0470cdfe132c778c250fd5130de428"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:05.297406Z","signature_b64":"u1DbQI97x5z4OO2ffOhTndSgWYQR8O9UJzqH8qZBklRkLcVcnko/K+mgmltQjEwMIvYXNev7J6TwntJyeSoFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d58d851cd8091ef1a18e25c97f45091bc0597c29f7a7100248110b30a6fa29c6","last_reissued_at":"2026-05-18T00:08:05.296969Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:05.296969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Density of monochromatic infinite subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Louis DeBiasio, Paul McKenney","submitted_at":"2016-11-16T19:58:48Z","abstract_excerpt":"For any countably infinite graph $G$, Ramsey's theorem guarantees an infinite monochromatic copy of $G$ in any $r$-coloring of the edges of the countably infinite complete graph $K_\\mathbb{N}$. Taking this a step further, it is natural to wonder how \"large\" of a monochromatic copy of $G$ we can find with respect to some measure -- for instance, the density (or upper density) of the vertex set of $G$ in the positive integers. Unlike finite Ramsey theory, where this question has been studied extensively, the analogous problem for infinite graphs has been mostly overlooked.\n  In one of the few re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05423","kind":"arxiv","version":3},"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":"1611.05423","created_at":"2026-05-18T00:08:05.297043+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.05423v3","created_at":"2026-05-18T00:08:05.297043+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05423","created_at":"2026-05-18T00:08:05.297043+00:00"},{"alias_kind":"pith_short_12","alias_value":"2WGYKHGYBEPP","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2WGYKHGYBEPPDIMO","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2WGYKHGY","created_at":"2026-05-18T12:29:55.572404+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/2WGYKHGYBEPPDIMOEXEX6RIJDP","json":"https://pith.science/pith/2WGYKHGYBEPPDIMOEXEX6RIJDP.json","graph_json":"https://pith.science/api/pith-number/2WGYKHGYBEPPDIMOEXEX6RIJDP/graph.json","events_json":"https://pith.science/api/pith-number/2WGYKHGYBEPPDIMOEXEX6RIJDP/events.json","paper":"https://pith.science/paper/2WGYKHGY"},"agent_actions":{"view_html":"https://pith.science/pith/2WGYKHGYBEPPDIMOEXEX6RIJDP","download_json":"https://pith.science/pith/2WGYKHGYBEPPDIMOEXEX6RIJDP.json","view_paper":"https://pith.science/paper/2WGYKHGY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.05423&json=true","fetch_graph":"https://pith.science/api/pith-number/2WGYKHGYBEPPDIMOEXEX6RIJDP/graph.json","fetch_events":"https://pith.science/api/pith-number/2WGYKHGYBEPPDIMOEXEX6RIJDP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2WGYKHGYBEPPDIMOEXEX6RIJDP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2WGYKHGYBEPPDIMOEXEX6RIJDP/action/storage_attestation","attest_author":"https://pith.science/pith/2WGYKHGYBEPPDIMOEXEX6RIJDP/action/author_attestation","sign_citation":"https://pith.science/pith/2WGYKHGYBEPPDIMOEXEX6RIJDP/action/citation_signature","submit_replication":"https://pith.science/pith/2WGYKHGYBEPPDIMOEXEX6RIJDP/action/replication_record"}},"created_at":"2026-05-18T00:08:05.297043+00:00","updated_at":"2026-05-18T00:08:05.297043+00:00"}