{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:ZNBGXZBQO5YV3XPTMS33FID3ZU","short_pith_number":"pith:ZNBGXZBQ","schema_version":"1.0","canonical_sha256":"cb426be43077715dddf364b7b2a07bcd1c5dd73b2d70697de6ed0622b8f6539b","source":{"kind":"arxiv","id":"2211.09870","version":1},"attestation_state":"computed","paper":{"title":"The Graph Density Domination Exponent","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cynthia Stoner","submitted_at":"2022-11-17T20:20:47Z","abstract_excerpt":"For graphs $G$ and $H$, what relations can be determined between $t(G,W)$ and $t(H,W)$ for a general graph $W$? We study this problem through the framework of the density domination exponent, which is defined to be the smallest constant $c$ such that $t(G,W)\\ge t(H,W)^c$ for every graph $W$. This broad generalization encompasses the Sidorenko conjecture, the Erd\\H{o}s-Simonovits Theorem on paths, and a variety of other statements relating graph homomorphism densities. We introduce some general tools for estimating the density domination exponent, and extend previous results to new graph regime"},"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":"2211.09870","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-11-17T20:20:47Z","cross_cats_sorted":[],"title_canon_sha256":"68031f341b94383a8d2056829d0e6200cbc2ca97582f1fa21da461dca1353f1d","abstract_canon_sha256":"d76af58e21fddf51e00204baf857e10a489815afc4867b92efc29472fd20ded5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:17:14.973522Z","signature_b64":"bSxL08TfuCwc0MH+j345ENH0BQNiz6T1pplhzam4noGwYjoSyAW7V1QX7GeNUb1T7f2Wh0VUuGFuwJpR1mj0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb426be43077715dddf364b7b2a07bcd1c5dd73b2d70697de6ed0622b8f6539b","last_reissued_at":"2026-07-05T05:17:14.973109Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:17:14.973109Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Graph Density Domination Exponent","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cynthia Stoner","submitted_at":"2022-11-17T20:20:47Z","abstract_excerpt":"For graphs $G$ and $H$, what relations can be determined between $t(G,W)$ and $t(H,W)$ for a general graph $W$? We study this problem through the framework of the density domination exponent, which is defined to be the smallest constant $c$ such that $t(G,W)\\ge t(H,W)^c$ for every graph $W$. This broad generalization encompasses the Sidorenko conjecture, the Erd\\H{o}s-Simonovits Theorem on paths, and a variety of other statements relating graph homomorphism densities. We introduce some general tools for estimating the density domination exponent, and extend previous results to new graph regime"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.09870","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/2211.09870/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":"2211.09870","created_at":"2026-07-05T05:17:14.973166+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.09870v1","created_at":"2026-07-05T05:17:14.973166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.09870","created_at":"2026-07-05T05:17:14.973166+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZNBGXZBQO5YV","created_at":"2026-07-05T05:17:14.973166+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZNBGXZBQO5YV3XPT","created_at":"2026-07-05T05:17:14.973166+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZNBGXZBQ","created_at":"2026-07-05T05:17:14.973166+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.12151","citing_title":"On Domination Exponents for Pairs of Graphs","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZNBGXZBQO5YV3XPTMS33FID3ZU","json":"https://pith.science/pith/ZNBGXZBQO5YV3XPTMS33FID3ZU.json","graph_json":"https://pith.science/api/pith-number/ZNBGXZBQO5YV3XPTMS33FID3ZU/graph.json","events_json":"https://pith.science/api/pith-number/ZNBGXZBQO5YV3XPTMS33FID3ZU/events.json","paper":"https://pith.science/paper/ZNBGXZBQ"},"agent_actions":{"view_html":"https://pith.science/pith/ZNBGXZBQO5YV3XPTMS33FID3ZU","download_json":"https://pith.science/pith/ZNBGXZBQO5YV3XPTMS33FID3ZU.json","view_paper":"https://pith.science/paper/ZNBGXZBQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.09870&json=true","fetch_graph":"https://pith.science/api/pith-number/ZNBGXZBQO5YV3XPTMS33FID3ZU/graph.json","fetch_events":"https://pith.science/api/pith-number/ZNBGXZBQO5YV3XPTMS33FID3ZU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZNBGXZBQO5YV3XPTMS33FID3ZU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZNBGXZBQO5YV3XPTMS33FID3ZU/action/storage_attestation","attest_author":"https://pith.science/pith/ZNBGXZBQO5YV3XPTMS33FID3ZU/action/author_attestation","sign_citation":"https://pith.science/pith/ZNBGXZBQO5YV3XPTMS33FID3ZU/action/citation_signature","submit_replication":"https://pith.science/pith/ZNBGXZBQO5YV3XPTMS33FID3ZU/action/replication_record"}},"created_at":"2026-07-05T05:17:14.973166+00:00","updated_at":"2026-07-05T05:17:14.973166+00:00"}