{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:N4FANHGLY5CMNI5ME2DV76MHDE","short_pith_number":"pith:N4FANHGL","schema_version":"1.0","canonical_sha256":"6f0a069ccbc744c6a3ac26875ff98719146d7cd119848992df0672dc345d5dc3","source":{"kind":"arxiv","id":"1912.06302","version":3},"attestation_state":"computed","paper":{"title":"Colored unavoidable patterns and balanceable graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adriana Hansberg, Alp M\\\"uyesser, Amanda Montejano, Matt Bowen","submitted_at":"2019-12-13T02:50:01Z","abstract_excerpt":"We study a Tur\\'an-type problem on edge-colored complete graphs. We show that for any $r$ and $t$, any sufficiently large $r$-edge-colored complete graph on $n$ vertices with $\\Omega(n^{2-1/tr^r})$ edges in each color contains a member from certain finite family $\\mathcal{F}_t^r$ of $r$-edge-colored complete graphs. We conjecture that $\\Omega(n^{2-1/t})$ edges in each color are sufficient to find a member from ${\\mathcal{F}}_t^r$. A result of Gir\\~ao and Narayanan confirms this conjecture when $r=2$.\n  Next, we study a related problem where the corresponding Tur\\'an threshold is linear. We cal"},"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":"1912.06302","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-13T02:50:01Z","cross_cats_sorted":[],"title_canon_sha256":"8962716802da69c15988c4eb3a5b1421bf6e9e1466e4e724282c42f5613d8ac1","abstract_canon_sha256":"53c7b959d9da0c1c2badabb01a1816274a63aa604c17ae9696022986a95b7467"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:58:03.226143Z","signature_b64":"GK3RmFadLWgzwu8E8N+Zj9EP8ovgeOrB2SfK9QxqmDXlLw6ejMIENq5kSyrGpNpUcLQkYTs6HsZXiVWJaiXYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f0a069ccbc744c6a3ac26875ff98719146d7cd119848992df0672dc345d5dc3","last_reissued_at":"2026-07-05T02:58:03.225716Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:58:03.225716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Colored unavoidable patterns and balanceable graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adriana Hansberg, Alp M\\\"uyesser, Amanda Montejano, Matt Bowen","submitted_at":"2019-12-13T02:50:01Z","abstract_excerpt":"We study a Tur\\'an-type problem on edge-colored complete graphs. We show that for any $r$ and $t$, any sufficiently large $r$-edge-colored complete graph on $n$ vertices with $\\Omega(n^{2-1/tr^r})$ edges in each color contains a member from certain finite family $\\mathcal{F}_t^r$ of $r$-edge-colored complete graphs. We conjecture that $\\Omega(n^{2-1/t})$ edges in each color are sufficient to find a member from ${\\mathcal{F}}_t^r$. A result of Gir\\~ao and Narayanan confirms this conjecture when $r=2$.\n  Next, we study a related problem where the corresponding Tur\\'an threshold is linear. We cal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.06302","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.06302/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":"1912.06302","created_at":"2026-07-05T02:58:03.225780+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.06302v3","created_at":"2026-07-05T02:58:03.225780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.06302","created_at":"2026-07-05T02:58:03.225780+00:00"},{"alias_kind":"pith_short_12","alias_value":"N4FANHGLY5CM","created_at":"2026-07-05T02:58:03.225780+00:00"},{"alias_kind":"pith_short_16","alias_value":"N4FANHGLY5CMNI5M","created_at":"2026-07-05T02:58:03.225780+00:00"},{"alias_kind":"pith_short_8","alias_value":"N4FANHGL","created_at":"2026-07-05T02:58:03.225780+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2003.04804","citing_title":"On the balanceability of some graph classes","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2011.11119","citing_title":"The balancing number and list balancing number of some graph classes","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N4FANHGLY5CMNI5ME2DV76MHDE","json":"https://pith.science/pith/N4FANHGLY5CMNI5ME2DV76MHDE.json","graph_json":"https://pith.science/api/pith-number/N4FANHGLY5CMNI5ME2DV76MHDE/graph.json","events_json":"https://pith.science/api/pith-number/N4FANHGLY5CMNI5ME2DV76MHDE/events.json","paper":"https://pith.science/paper/N4FANHGL"},"agent_actions":{"view_html":"https://pith.science/pith/N4FANHGLY5CMNI5ME2DV76MHDE","download_json":"https://pith.science/pith/N4FANHGLY5CMNI5ME2DV76MHDE.json","view_paper":"https://pith.science/paper/N4FANHGL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.06302&json=true","fetch_graph":"https://pith.science/api/pith-number/N4FANHGLY5CMNI5ME2DV76MHDE/graph.json","fetch_events":"https://pith.science/api/pith-number/N4FANHGLY5CMNI5ME2DV76MHDE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N4FANHGLY5CMNI5ME2DV76MHDE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N4FANHGLY5CMNI5ME2DV76MHDE/action/storage_attestation","attest_author":"https://pith.science/pith/N4FANHGLY5CMNI5ME2DV76MHDE/action/author_attestation","sign_citation":"https://pith.science/pith/N4FANHGLY5CMNI5ME2DV76MHDE/action/citation_signature","submit_replication":"https://pith.science/pith/N4FANHGLY5CMNI5ME2DV76MHDE/action/replication_record"}},"created_at":"2026-07-05T02:58:03.225780+00:00","updated_at":"2026-07-05T02:58:03.225780+00:00"}