{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2EHORM5XKT7QGYV5D3KRWUPQJM","short_pith_number":"pith:2EHORM5X","schema_version":"1.0","canonical_sha256":"d10ee8b3b754ff0362bd1ed51b51f04b25cf6f4035646df0420e440062e44749","source":{"kind":"arxiv","id":"2303.01997","version":2},"attestation_state":"computed","paper":{"title":"Domination inequalities and dominating graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Conlon, Joonkyung Lee","submitted_at":"2023-03-03T15:09:18Z","abstract_excerpt":"We say that a graph $H$ dominates another graph $H'$ if the number of homomorphisms from $H'$ to any graph $G$ is dominated, in an appropriate sense, by the number of homomorphisms from $H$ to $G$. We study the family of dominating graphs, those graphs with the property that they dominate all of their subgraphs. It has long been known that even-length paths are dominating in this sense and a result of Hatami implies that all weakly norming graphs are dominating. In a previous paper, we showed that every finite reflection group gives rise to a family of weakly norming, and hence dominating, gra"},"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":"2303.01997","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-03-03T15:09:18Z","cross_cats_sorted":[],"title_canon_sha256":"700934ef7851de0e67b45b93264c0ee5cdd6cb3f8ad1bb059c6979d7d11e37cd","abstract_canon_sha256":"68a50e9f4ade909b357ee9beb233bd8911cda208c849735e44e2adbb0e9aff78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:36.144469Z","signature_b64":"phMJ6zUJrgHUPK4TpPJ0NcF44VXn94jGzuiZGSdXGHUhr56GOfhFP3b88M0NtBMAvRiNOOAWX++S42+5t9nFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d10ee8b3b754ff0362bd1ed51b51f04b25cf6f4035646df0420e440062e44749","last_reissued_at":"2026-07-05T09:40:36.144048Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:36.144048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Domination inequalities and dominating graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David Conlon, Joonkyung Lee","submitted_at":"2023-03-03T15:09:18Z","abstract_excerpt":"We say that a graph $H$ dominates another graph $H'$ if the number of homomorphisms from $H'$ to any graph $G$ is dominated, in an appropriate sense, by the number of homomorphisms from $H$ to $G$. We study the family of dominating graphs, those graphs with the property that they dominate all of their subgraphs. It has long been known that even-length paths are dominating in this sense and a result of Hatami implies that all weakly norming graphs are dominating. In a previous paper, we showed that every finite reflection group gives rise to a family of weakly norming, and hence dominating, gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.01997","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.01997/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":"2303.01997","created_at":"2026-07-05T09:40:36.144108+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.01997v2","created_at":"2026-07-05T09:40:36.144108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.01997","created_at":"2026-07-05T09:40:36.144108+00:00"},{"alias_kind":"pith_short_12","alias_value":"2EHORM5XKT7Q","created_at":"2026-07-05T09:40:36.144108+00:00"},{"alias_kind":"pith_short_16","alias_value":"2EHORM5XKT7QGYV5","created_at":"2026-07-05T09:40:36.144108+00:00"},{"alias_kind":"pith_short_8","alias_value":"2EHORM5X","created_at":"2026-07-05T09:40:36.144108+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":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2EHORM5XKT7QGYV5D3KRWUPQJM","json":"https://pith.science/pith/2EHORM5XKT7QGYV5D3KRWUPQJM.json","graph_json":"https://pith.science/api/pith-number/2EHORM5XKT7QGYV5D3KRWUPQJM/graph.json","events_json":"https://pith.science/api/pith-number/2EHORM5XKT7QGYV5D3KRWUPQJM/events.json","paper":"https://pith.science/paper/2EHORM5X"},"agent_actions":{"view_html":"https://pith.science/pith/2EHORM5XKT7QGYV5D3KRWUPQJM","download_json":"https://pith.science/pith/2EHORM5XKT7QGYV5D3KRWUPQJM.json","view_paper":"https://pith.science/paper/2EHORM5X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.01997&json=true","fetch_graph":"https://pith.science/api/pith-number/2EHORM5XKT7QGYV5D3KRWUPQJM/graph.json","fetch_events":"https://pith.science/api/pith-number/2EHORM5XKT7QGYV5D3KRWUPQJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2EHORM5XKT7QGYV5D3KRWUPQJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2EHORM5XKT7QGYV5D3KRWUPQJM/action/storage_attestation","attest_author":"https://pith.science/pith/2EHORM5XKT7QGYV5D3KRWUPQJM/action/author_attestation","sign_citation":"https://pith.science/pith/2EHORM5XKT7QGYV5D3KRWUPQJM/action/citation_signature","submit_replication":"https://pith.science/pith/2EHORM5XKT7QGYV5D3KRWUPQJM/action/replication_record"}},"created_at":"2026-07-05T09:40:36.144108+00:00","updated_at":"2026-07-05T09:40:36.144108+00:00"}