{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VO2JSW62QJ5PTOFFWP3ITBVMWU","short_pith_number":"pith:VO2JSW62","schema_version":"1.0","canonical_sha256":"abb4995bda827af9b8a5b3f68986acb53bf959695e0544618d6cf13e0528342c","source":{"kind":"arxiv","id":"1605.08013","version":2},"attestation_state":"computed","paper":{"title":"Edge-colorings of graphs avoiding complete graphs with a prescribed coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carlos Hoppen, Fabricio S. Benevides, Rudini Menezes Sampaio","submitted_at":"2016-05-25T19:20:09Z","abstract_excerpt":"Given a graph $F$ and an integer $r \\ge 2$, a partition $\\widehat{F}$ of the edge set of $F$ into at most $r$ classes, and a graph $G$, define $c_{r, \\widehat{F}}(G)$ as the number of $r$-colorings of the edges of $G$ that do not contain a copy of $F$ such that the edge partition induced by the coloring is isomorphic to the one of $F$. We think of $\\widehat{F}$ as the pattern of coloring that should be avoided. The main question is, for a large enough $n$, to find the (extremal) graph $G$ on $n$ vertices which maximizes $c_{r, \\widehat{F}}(G)$. This problem generalizes a question of Erd{\\H o}s"},"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":"1605.08013","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-25T19:20:09Z","cross_cats_sorted":[],"title_canon_sha256":"cddc00032068f7a468836be4fb0b31bd76509eebf2a63281e938f83d0f5d7c2a","abstract_canon_sha256":"fd5b89a3087555d0e04736a061e14e32c26943e652bed05745548ae50a11b22b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:30.112832Z","signature_b64":"Iy7MA32M7gRaTbVZH6F49Nw8fFEBRwbbmugBz79G/O2oVuGzrmUpTFqnS6XULKQGtNbr8JhLDp/ZVTAXwkeRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abb4995bda827af9b8a5b3f68986acb53bf959695e0544618d6cf13e0528342c","last_reissued_at":"2026-05-18T01:13:30.112046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:30.112046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge-colorings of graphs avoiding complete graphs with a prescribed coloring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carlos Hoppen, Fabricio S. Benevides, Rudini Menezes Sampaio","submitted_at":"2016-05-25T19:20:09Z","abstract_excerpt":"Given a graph $F$ and an integer $r \\ge 2$, a partition $\\widehat{F}$ of the edge set of $F$ into at most $r$ classes, and a graph $G$, define $c_{r, \\widehat{F}}(G)$ as the number of $r$-colorings of the edges of $G$ that do not contain a copy of $F$ such that the edge partition induced by the coloring is isomorphic to the one of $F$. We think of $\\widehat{F}$ as the pattern of coloring that should be avoided. The main question is, for a large enough $n$, to find the (extremal) graph $G$ on $n$ vertices which maximizes $c_{r, \\widehat{F}}(G)$. This problem generalizes a question of Erd{\\H o}s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08013","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.08013","created_at":"2026-05-18T01:13:30.112161+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.08013v2","created_at":"2026-05-18T01:13:30.112161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08013","created_at":"2026-05-18T01:13:30.112161+00:00"},{"alias_kind":"pith_short_12","alias_value":"VO2JSW62QJ5P","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VO2JSW62QJ5PTOFF","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VO2JSW62","created_at":"2026-05-18T12:30:48.956258+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/VO2JSW62QJ5PTOFFWP3ITBVMWU","json":"https://pith.science/pith/VO2JSW62QJ5PTOFFWP3ITBVMWU.json","graph_json":"https://pith.science/api/pith-number/VO2JSW62QJ5PTOFFWP3ITBVMWU/graph.json","events_json":"https://pith.science/api/pith-number/VO2JSW62QJ5PTOFFWP3ITBVMWU/events.json","paper":"https://pith.science/paper/VO2JSW62"},"agent_actions":{"view_html":"https://pith.science/pith/VO2JSW62QJ5PTOFFWP3ITBVMWU","download_json":"https://pith.science/pith/VO2JSW62QJ5PTOFFWP3ITBVMWU.json","view_paper":"https://pith.science/paper/VO2JSW62","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.08013&json=true","fetch_graph":"https://pith.science/api/pith-number/VO2JSW62QJ5PTOFFWP3ITBVMWU/graph.json","fetch_events":"https://pith.science/api/pith-number/VO2JSW62QJ5PTOFFWP3ITBVMWU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VO2JSW62QJ5PTOFFWP3ITBVMWU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VO2JSW62QJ5PTOFFWP3ITBVMWU/action/storage_attestation","attest_author":"https://pith.science/pith/VO2JSW62QJ5PTOFFWP3ITBVMWU/action/author_attestation","sign_citation":"https://pith.science/pith/VO2JSW62QJ5PTOFFWP3ITBVMWU/action/citation_signature","submit_replication":"https://pith.science/pith/VO2JSW62QJ5PTOFFWP3ITBVMWU/action/replication_record"}},"created_at":"2026-05-18T01:13:30.112161+00:00","updated_at":"2026-05-18T01:13:30.112161+00:00"}