{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:V6L34CVZGGRHFYUCP7N6T67CUI","short_pith_number":"pith:V6L34CVZ","schema_version":"1.0","canonical_sha256":"af97be0ab931a272e2827fdbe9fbe2a2260fe913e2db1a8e41910e0a4f8e6b06","source":{"kind":"arxiv","id":"1603.05888","version":4},"attestation_state":"computed","paper":{"title":"Sidorenko's conjecture, colorings and independent sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"P\\'eter Csikv\\'ari, Zhicong Lin","submitted_at":"2016-03-18T14:50:42Z","abstract_excerpt":"Let $\\hom(H,G)$ denote the number of homomorphisms from a graph $H$ to a graph $G$. Sidorenko's conjecture asserts that for any bipartite graph $H$, and a graph $G$ we have $$\\hom(H,G)\\geq v(G)^{v(H)}\\left(\\frac{\\hom(K_2,G)}{v(G)^2}\\right)^{e(H)},$$ where $v(H),v(G)$ and $e(H),e(G)$ denote the number of vertices and edges of the graph $H$ and $G$, respectively. In this paper we prove Sidorenko's conjecture for certain special graphs $G$: for the complete graph $K_q$ on $q$ vertices, for a $K_2$ with a loop added at one of the end vertices, and for a path on $3$ vertices with a loop added at ea"},"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":"1603.05888","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-18T14:50:42Z","cross_cats_sorted":[],"title_canon_sha256":"b013de0bb20dbc37de4b4d918eeeb737e7ecbd96951011a8bd397bf2a14da7b5","abstract_canon_sha256":"9554cc697c68ddc776e200b59b0ec0bd7b03a7b1a22fb9fd7d11db41b6983018"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:34.157023Z","signature_b64":"IEuainK52/0OiFumaAAhxpFLNzluk516UoAQSWB6FZOGZWJEw3jprLSKIU3oUNFKo9bN963F9+9x1xfHd3rnBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af97be0ab931a272e2827fdbe9fbe2a2260fe913e2db1a8e41910e0a4f8e6b06","last_reissued_at":"2026-05-18T00:51:34.156514Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:34.156514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sidorenko's conjecture, colorings and independent sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"P\\'eter Csikv\\'ari, Zhicong Lin","submitted_at":"2016-03-18T14:50:42Z","abstract_excerpt":"Let $\\hom(H,G)$ denote the number of homomorphisms from a graph $H$ to a graph $G$. Sidorenko's conjecture asserts that for any bipartite graph $H$, and a graph $G$ we have $$\\hom(H,G)\\geq v(G)^{v(H)}\\left(\\frac{\\hom(K_2,G)}{v(G)^2}\\right)^{e(H)},$$ where $v(H),v(G)$ and $e(H),e(G)$ denote the number of vertices and edges of the graph $H$ and $G$, respectively. In this paper we prove Sidorenko's conjecture for certain special graphs $G$: for the complete graph $K_q$ on $q$ vertices, for a $K_2$ with a loop added at one of the end vertices, and for a path on $3$ vertices with a loop added at ea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05888","kind":"arxiv","version":4},"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":"1603.05888","created_at":"2026-05-18T00:51:34.156584+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.05888v4","created_at":"2026-05-18T00:51:34.156584+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05888","created_at":"2026-05-18T00:51:34.156584+00:00"},{"alias_kind":"pith_short_12","alias_value":"V6L34CVZGGRH","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"V6L34CVZGGRHFYUC","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"V6L34CVZ","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/V6L34CVZGGRHFYUCP7N6T67CUI","json":"https://pith.science/pith/V6L34CVZGGRHFYUCP7N6T67CUI.json","graph_json":"https://pith.science/api/pith-number/V6L34CVZGGRHFYUCP7N6T67CUI/graph.json","events_json":"https://pith.science/api/pith-number/V6L34CVZGGRHFYUCP7N6T67CUI/events.json","paper":"https://pith.science/paper/V6L34CVZ"},"agent_actions":{"view_html":"https://pith.science/pith/V6L34CVZGGRHFYUCP7N6T67CUI","download_json":"https://pith.science/pith/V6L34CVZGGRHFYUCP7N6T67CUI.json","view_paper":"https://pith.science/paper/V6L34CVZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.05888&json=true","fetch_graph":"https://pith.science/api/pith-number/V6L34CVZGGRHFYUCP7N6T67CUI/graph.json","fetch_events":"https://pith.science/api/pith-number/V6L34CVZGGRHFYUCP7N6T67CUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V6L34CVZGGRHFYUCP7N6T67CUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V6L34CVZGGRHFYUCP7N6T67CUI/action/storage_attestation","attest_author":"https://pith.science/pith/V6L34CVZGGRHFYUCP7N6T67CUI/action/author_attestation","sign_citation":"https://pith.science/pith/V6L34CVZGGRHFYUCP7N6T67CUI/action/citation_signature","submit_replication":"https://pith.science/pith/V6L34CVZGGRHFYUCP7N6T67CUI/action/replication_record"}},"created_at":"2026-05-18T00:51:34.156584+00:00","updated_at":"2026-05-18T00:51:34.156584+00:00"}