{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:N3FPTL5D4SSHCT42DKS7AZ6TZ3","short_pith_number":"pith:N3FPTL5D","schema_version":"1.0","canonical_sha256":"6ecaf9afa3e4a4714f9a1aa5f067d3ceecf70c8ae49328bd89e3e193449d40a6","source":{"kind":"arxiv","id":"2502.12291","version":1},"attestation_state":"computed","paper":{"title":"A framework for the generalised Erd\\H{o}s-Rothschild problem and a resolution of the dichromatic triangle case","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emil Powierski, Katherine Staden, Pranshu Gupta, Yani Pehova","submitted_at":"2025-02-17T20:00:21Z","abstract_excerpt":"The Erd\\H{o}s-Rothschild problem from 1974 asks for the maximum number of $s$-edge colourings in an $n$-vertex graph which avoid a monochromatic copy of $K_k$, given positive integers $n,s,k$. In this paper, we systematically study the generalisation of this problem to a given forbidden family of colourings of $K_k$. This problem typically exhibits a dichotomy whereby for some values of $s$, the extremal graph is the `trivial' one, namely the Tur\\'an graph on $k-1$ parts, with no copies of $K_k$; while for others, this graph is no longer extremal and determining the extremal graph becomes much"},"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":"2502.12291","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-17T20:00:21Z","cross_cats_sorted":[],"title_canon_sha256":"c0a7d2fe5b223b05032c828ccf2f780f9ce606702acc4f37952a3ba517850b6c","abstract_canon_sha256":"dc9837d2f93c4086710992bfedb7ec4fe8e4c78078b43bc924c53fb24feea799"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:15:53.062373Z","signature_b64":"R4zmfxARkQUjAAZjYiI98j7TNU/igjBA5q/ltzrpG58JzHt9TSpCyKCtlZGZ42vKHLXuvGn5dcH4kZToAXA3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ecaf9afa3e4a4714f9a1aa5f067d3ceecf70c8ae49328bd89e3e193449d40a6","last_reissued_at":"2026-07-05T10:15:53.061865Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:15:53.061865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A framework for the generalised Erd\\H{o}s-Rothschild problem and a resolution of the dichromatic triangle case","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Emil Powierski, Katherine Staden, Pranshu Gupta, Yani Pehova","submitted_at":"2025-02-17T20:00:21Z","abstract_excerpt":"The Erd\\H{o}s-Rothschild problem from 1974 asks for the maximum number of $s$-edge colourings in an $n$-vertex graph which avoid a monochromatic copy of $K_k$, given positive integers $n,s,k$. In this paper, we systematically study the generalisation of this problem to a given forbidden family of colourings of $K_k$. This problem typically exhibits a dichotomy whereby for some values of $s$, the extremal graph is the `trivial' one, namely the Tur\\'an graph on $k-1$ parts, with no copies of $K_k$; while for others, this graph is no longer extremal and determining the extremal graph becomes much"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.12291","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.12291/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":"2502.12291","created_at":"2026-07-05T10:15:53.061924+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.12291v1","created_at":"2026-07-05T10:15:53.061924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.12291","created_at":"2026-07-05T10:15:53.061924+00:00"},{"alias_kind":"pith_short_12","alias_value":"N3FPTL5D4SSH","created_at":"2026-07-05T10:15:53.061924+00:00"},{"alias_kind":"pith_short_16","alias_value":"N3FPTL5D4SSHCT42","created_at":"2026-07-05T10:15:53.061924+00:00"},{"alias_kind":"pith_short_8","alias_value":"N3FPTL5D","created_at":"2026-07-05T10:15:53.061924+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.04845","citing_title":"Entropy Transference for Rainbow-$H$-Free Colourings of Random Graphs","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N3FPTL5D4SSHCT42DKS7AZ6TZ3","json":"https://pith.science/pith/N3FPTL5D4SSHCT42DKS7AZ6TZ3.json","graph_json":"https://pith.science/api/pith-number/N3FPTL5D4SSHCT42DKS7AZ6TZ3/graph.json","events_json":"https://pith.science/api/pith-number/N3FPTL5D4SSHCT42DKS7AZ6TZ3/events.json","paper":"https://pith.science/paper/N3FPTL5D"},"agent_actions":{"view_html":"https://pith.science/pith/N3FPTL5D4SSHCT42DKS7AZ6TZ3","download_json":"https://pith.science/pith/N3FPTL5D4SSHCT42DKS7AZ6TZ3.json","view_paper":"https://pith.science/paper/N3FPTL5D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.12291&json=true","fetch_graph":"https://pith.science/api/pith-number/N3FPTL5D4SSHCT42DKS7AZ6TZ3/graph.json","fetch_events":"https://pith.science/api/pith-number/N3FPTL5D4SSHCT42DKS7AZ6TZ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N3FPTL5D4SSHCT42DKS7AZ6TZ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N3FPTL5D4SSHCT42DKS7AZ6TZ3/action/storage_attestation","attest_author":"https://pith.science/pith/N3FPTL5D4SSHCT42DKS7AZ6TZ3/action/author_attestation","sign_citation":"https://pith.science/pith/N3FPTL5D4SSHCT42DKS7AZ6TZ3/action/citation_signature","submit_replication":"https://pith.science/pith/N3FPTL5D4SSHCT42DKS7AZ6TZ3/action/replication_record"}},"created_at":"2026-07-05T10:15:53.061924+00:00","updated_at":"2026-07-05T10:15:53.061924+00:00"}