{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:S65QL5NDCEYTXSI2HW4EWJBMQW","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":"918daa4ffb427fa0e549f300a1e3edd2f295cc669271f9937a7ce2baed452544","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-13T18:10:33Z","title_canon_sha256":"cfe6df62e1370b2ce32c3363959bc06ddbe8e17846cf67666223a5297d03b87a"},"schema_version":"1.0","source":{"id":"2506.12151","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.12151","created_at":"2026-07-05T11:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"2506.12151v2","created_at":"2026-07-05T11:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.12151","created_at":"2026-07-05T11:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"S65QL5NDCEYT","created_at":"2026-07-05T11:58:31Z"},{"alias_kind":"pith_short_16","alias_value":"S65QL5NDCEYTXSI2","created_at":"2026-07-05T11:58:31Z"},{"alias_kind":"pith_short_8","alias_value":"S65QL5ND","created_at":"2026-07-05T11:58:31Z"}],"graph_snapshots":[{"event_id":"sha256:7ad0eceec76e21cc24e1cb59bc2ef3182b8c12241def99d68bc2974e0f34ac0a","target":"graph","created_at":"2026-07-05T11:58:31Z","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/2506.12151/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Understanding graph density profiles is notoriously challenging. Even for pairs of graphs, complete characterizations are known only in very limited cases, such as edges versus cliques. This paper explores a relaxation of the graph density profile problem by examining the homomorphism density domination exponent $C(H_1, H_2)$. This is the smallest real number $c \\geq 0$ such that $t(H_1, T) \\geq t(H_2, T)^c$ for all target graphs $T$ (if such a $c$ exists) where $t(H,T)$ is the homomorphism density from $H$ to $T$. We demonstrate that infinitely many families of graphs are required to realize ","authors_text":"Alexander Razborov, Annie Raymond, Fan Wei, Grigoriy Blekherman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.12151","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:b1cfef900f1c740df15fd9cc3521f9d57970588d5f9066fa081af76189dfdc52","target":"record","created_at":"2026-07-05T11:58:31Z","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":"918daa4ffb427fa0e549f300a1e3edd2f295cc669271f9937a7ce2baed452544","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-13T18:10:33Z","title_canon_sha256":"cfe6df62e1370b2ce32c3363959bc06ddbe8e17846cf67666223a5297d03b87a"},"schema_version":"1.0","source":{"id":"2506.12151","kind":"arxiv","version":2}},"canonical_sha256":"97bb05f5a311313bc91a3db84b242c85854c783fc6c4999fbf83e8f6c7a0c175","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97bb05f5a311313bc91a3db84b242c85854c783fc6c4999fbf83e8f6c7a0c175","first_computed_at":"2026-07-05T11:58:31.297006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:58:31.297006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hYmcnna7jaRuWRgtFwfZRnn1BEtbpiG69AOJuh6MgokCa22MMtWnebo7drT5LWRiQwk1tWa7ohmzbJkc6SRdCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:58:31.297457Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.12151","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1cfef900f1c740df15fd9cc3521f9d57970588d5f9066fa081af76189dfdc52","sha256:7ad0eceec76e21cc24e1cb59bc2ef3182b8c12241def99d68bc2974e0f34ac0a"],"state_sha256":"35e2d94885bcf1c79a9542b35487b71a449b33f1d19fa71adb4f932fccff9104"}