{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3RD32UAQBJXH3IE5ANCLDBZBTD","short_pith_number":"pith:3RD32UAQ","schema_version":"1.0","canonical_sha256":"dc47bd50100a6e7da09d0344b1872198f54066b76f6e92655ae37507f4b08ea7","source":{"kind":"arxiv","id":"2607.28241","version":1},"attestation_state":"computed","paper":{"title":"Exact Homomorphism Thresholds Beyond Cliques","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chong Shangguan, Mingyuan Rong, Xinqi Huang","submitted_at":"2026-07-30T14:06:22Z","abstract_excerpt":"The chromatic threshold, originating in a question of Erd\\H{o}s and Simonovits, asks when a linear minimum-degree condition forces bounded chromatic number in H-free graphs. Motivated by a question of Thomassen, the homomorphism threshold asks for the stronger conclusion that every such graph admits a homomorphism to an H-free graph of bounded order. Since the work of Goddard and Lyle determined the clique case, exact homomorphism thresholds for individual non-complete forbidden graphs have remained unknown. In this paper, we extend the clique case to a larger family of forbidden graphs, deter"},"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":"2607.28241","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-30T14:06:22Z","cross_cats_sorted":[],"title_canon_sha256":"d15a0dcd5aad3969a14d18d0ff3454171de3d1b07daeea80bb2a13afeefe2b7b","abstract_canon_sha256":"82c56a02f875c0bfcf83f63c045b02f970a9484f507c8c19e768ad69397c7feb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc47bd50100a6e7da09d0344b1872198f54066b76f6e92655ae37507f4b08ea7","last_reissued_at":"2026-07-31T01:36:53.819320Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:36:53.819320Z"},"graph_snapshot":{"paper":{"title":"Exact Homomorphism Thresholds Beyond Cliques","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chong Shangguan, Mingyuan Rong, Xinqi Huang","submitted_at":"2026-07-30T14:06:22Z","abstract_excerpt":"The chromatic threshold, originating in a question of Erd\\H{o}s and Simonovits, asks when a linear minimum-degree condition forces bounded chromatic number in H-free graphs. Motivated by a question of Thomassen, the homomorphism threshold asks for the stronger conclusion that every such graph admits a homomorphism to an H-free graph of bounded order. Since the work of Goddard and Lyle determined the clique case, exact homomorphism thresholds for individual non-complete forbidden graphs have remained unknown. In this paper, we extend the clique case to a larger family of forbidden graphs, deter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28241","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/2607.28241/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":"2607.28241","created_at":"2026-07-31T01:36:53.822480+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.28241v1","created_at":"2026-07-31T01:36:53.822480+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28241","created_at":"2026-07-31T01:36:53.822480+00:00"},{"alias_kind":"pith_short_12","alias_value":"3RD32UAQBJXH","created_at":"2026-07-31T01:36:53.822480+00:00"},{"alias_kind":"pith_short_16","alias_value":"3RD32UAQBJXH3IE5","created_at":"2026-07-31T01:36:53.822480+00:00"},{"alias_kind":"pith_short_8","alias_value":"3RD32UAQ","created_at":"2026-07-31T01:36:53.822480+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/3RD32UAQBJXH3IE5ANCLDBZBTD","json":"https://pith.science/pith/3RD32UAQBJXH3IE5ANCLDBZBTD.json","graph_json":"https://pith.science/api/pith-number/3RD32UAQBJXH3IE5ANCLDBZBTD/graph.json","events_json":"https://pith.science/api/pith-number/3RD32UAQBJXH3IE5ANCLDBZBTD/events.json","paper":"https://pith.science/paper/3RD32UAQ"},"agent_actions":{"view_html":"https://pith.science/pith/3RD32UAQBJXH3IE5ANCLDBZBTD","download_json":"https://pith.science/pith/3RD32UAQBJXH3IE5ANCLDBZBTD.json","view_paper":"https://pith.science/paper/3RD32UAQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.28241&json=true","fetch_graph":"https://pith.science/api/pith-number/3RD32UAQBJXH3IE5ANCLDBZBTD/graph.json","fetch_events":"https://pith.science/api/pith-number/3RD32UAQBJXH3IE5ANCLDBZBTD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3RD32UAQBJXH3IE5ANCLDBZBTD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3RD32UAQBJXH3IE5ANCLDBZBTD/action/storage_attestation","attest_author":"https://pith.science/pith/3RD32UAQBJXH3IE5ANCLDBZBTD/action/author_attestation","sign_citation":"https://pith.science/pith/3RD32UAQBJXH3IE5ANCLDBZBTD/action/citation_signature","submit_replication":"https://pith.science/pith/3RD32UAQBJXH3IE5ANCLDBZBTD/action/replication_record"}},"created_at":"2026-07-31T01:36:53.822480+00:00","updated_at":"2026-07-31T01:36:53.822480+00:00"}