{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:2EHORM5XKT7QGYV5D3KRWUPQJM","short_pith_number":"pith:2EHORM5X","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"},"canonical_sha256":"d10ee8b3b754ff0362bd1ed51b51f04b25cf6f4035646df0420e440062e44749","source":{"kind":"arxiv","id":"2303.01997","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.01997","created_at":"2026-07-05T09:40:36Z"},{"alias_kind":"arxiv_version","alias_value":"2303.01997v2","created_at":"2026-07-05T09:40:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.01997","created_at":"2026-07-05T09:40:36Z"},{"alias_kind":"pith_short_12","alias_value":"2EHORM5XKT7Q","created_at":"2026-07-05T09:40:36Z"},{"alias_kind":"pith_short_16","alias_value":"2EHORM5XKT7QGYV5","created_at":"2026-07-05T09:40:36Z"},{"alias_kind":"pith_short_8","alias_value":"2EHORM5X","created_at":"2026-07-05T09:40:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:2EHORM5XKT7QGYV5D3KRWUPQJM","target":"record","payload":{"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"},"canonical_sha256":"d10ee8b3b754ff0362bd1ed51b51f04b25cf6f4035646df0420e440062e44749","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"},"source_kind":"arxiv","source_id":"2303.01997","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:40:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VNCwS/4BaPvqp3jGXLaT81qBVo1vy2J/u2GkvZQ1xzlyYfdU7vkST18T1wnabhpc61CnzQclMl+QKYjrvGXsBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T09:36:00.914435Z"},"content_sha256":"37094389774ee78ed91bc8d036520e8082f33aab94068365dd582426e4e3b0c2","schema_version":"1.0","event_id":"sha256:37094389774ee78ed91bc8d036520e8082f33aab94068365dd582426e4e3b0c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:2EHORM5XKT7QGYV5D3KRWUPQJM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:40:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XuA+Jk1dP16ZWbL8iMmwsQiWFLDYL/OImzaKcyYkuHZNyy8i1uJabPDX6XgJ7CGMLbMg2+5wqHd+Aga/TLvtDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T09:36:00.915383Z"},"content_sha256":"ab7283cbbab80bdeb029a678806a1122267af15ba62ef8bea2438244bb6cde8d","schema_version":"1.0","event_id":"sha256:ab7283cbbab80bdeb029a678806a1122267af15ba62ef8bea2438244bb6cde8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2EHORM5XKT7QGYV5D3KRWUPQJM/bundle.json","state_url":"https://pith.science/pith/2EHORM5XKT7QGYV5D3KRWUPQJM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2EHORM5XKT7QGYV5D3KRWUPQJM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-18T09:36:00Z","links":{"resolver":"https://pith.science/pith/2EHORM5XKT7QGYV5D3KRWUPQJM","bundle":"https://pith.science/pith/2EHORM5XKT7QGYV5D3KRWUPQJM/bundle.json","state":"https://pith.science/pith/2EHORM5XKT7QGYV5D3KRWUPQJM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2EHORM5XKT7QGYV5D3KRWUPQJM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:2EHORM5XKT7QGYV5D3KRWUPQJM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"68a50e9f4ade909b357ee9beb233bd8911cda208c849735e44e2adbb0e9aff78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-03-03T15:09:18Z","title_canon_sha256":"700934ef7851de0e67b45b93264c0ee5cdd6cb3f8ad1bb059c6979d7d11e37cd"},"schema_version":"1.0","source":{"id":"2303.01997","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.01997","created_at":"2026-07-05T09:40:36Z"},{"alias_kind":"arxiv_version","alias_value":"2303.01997v2","created_at":"2026-07-05T09:40:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.01997","created_at":"2026-07-05T09:40:36Z"},{"alias_kind":"pith_short_12","alias_value":"2EHORM5XKT7Q","created_at":"2026-07-05T09:40:36Z"},{"alias_kind":"pith_short_16","alias_value":"2EHORM5XKT7QGYV5","created_at":"2026-07-05T09:40:36Z"},{"alias_kind":"pith_short_8","alias_value":"2EHORM5X","created_at":"2026-07-05T09:40:36Z"}],"graph_snapshots":[{"event_id":"sha256:ab7283cbbab80bdeb029a678806a1122267af15ba62ef8bea2438244bb6cde8d","target":"graph","created_at":"2026-07-05T09:40:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2303.01997/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"David Conlon, Joonkyung Lee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-03-03T15:09:18Z","title":"Domination inequalities and dominating graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.01997","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:37094389774ee78ed91bc8d036520e8082f33aab94068365dd582426e4e3b0c2","target":"record","created_at":"2026-07-05T09:40:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"68a50e9f4ade909b357ee9beb233bd8911cda208c849735e44e2adbb0e9aff78","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-03-03T15:09:18Z","title_canon_sha256":"700934ef7851de0e67b45b93264c0ee5cdd6cb3f8ad1bb059c6979d7d11e37cd"},"schema_version":"1.0","source":{"id":"2303.01997","kind":"arxiv","version":2}},"canonical_sha256":"d10ee8b3b754ff0362bd1ed51b51f04b25cf6f4035646df0420e440062e44749","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d10ee8b3b754ff0362bd1ed51b51f04b25cf6f4035646df0420e440062e44749","first_computed_at":"2026-07-05T09:40:36.144048Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:40:36.144048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"phMJ6zUJrgHUPK4TpPJ0NcF44VXn94jGzuiZGSdXGHUhr56GOfhFP3b88M0NtBMAvRiNOOAWX++S42+5t9nFBg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:40:36.144469Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.01997","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37094389774ee78ed91bc8d036520e8082f33aab94068365dd582426e4e3b0c2","sha256:ab7283cbbab80bdeb029a678806a1122267af15ba62ef8bea2438244bb6cde8d"],"state_sha256":"61ae6edc99af5defe1db74868da4b46d5df41df76d321f284142bc3136562ca3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3z2REXEJ35BbEH3ketOl5yLalMw71vReZqEfou0ey/C09TrvnIYOoQVjWh+mnySwMsRxfp5xLCZM3aEgNi8DAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T09:36:00.921673Z","bundle_sha256":"68939ecdd0c7c2648fdcb1e0023996bcec24097839d235d5bd22688a88ab24f4"}}