{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:2XRCUZV5Z7LRFGHVVZUOGA2W5S","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":"3e541a9f5ac4b9b1986cc1dcb39c59873da3a6956c3e978d4c031d1a75742ec6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-03T19:40:31Z","title_canon_sha256":"b9cb3dfde5c709a0df61a9c6cf92692ca3bfb7560b514d1cc72efe95b1c34cc1"},"schema_version":"1.0","source":{"id":"2307.01314","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.01314","created_at":"2026-07-05T06:43:03Z"},{"alias_kind":"arxiv_version","alias_value":"2307.01314v3","created_at":"2026-07-05T06:43:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.01314","created_at":"2026-07-05T06:43:03Z"},{"alias_kind":"pith_short_12","alias_value":"2XRCUZV5Z7LR","created_at":"2026-07-05T06:43:03Z"},{"alias_kind":"pith_short_16","alias_value":"2XRCUZV5Z7LRFGHV","created_at":"2026-07-05T06:43:03Z"},{"alias_kind":"pith_short_8","alias_value":"2XRCUZV5","created_at":"2026-07-05T06:43:03Z"}],"graph_snapshots":[{"event_id":"sha256:3104c29d27416234bf4c98dbb0354b56da0dc39681254dff185c1b9e82403b3a","target":"graph","created_at":"2026-07-05T06:43:03Z","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/2307.01314/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recently, Alon introduced the notion of an $H$-code for a graph $H$: a collection of graphs on vertex set $[n]$ is an $H$-code if it contains no two members whose symmetric difference is isomorphic to $H$. Let $D_{H}(n)$ denote the maximum possible cardinality of an $H$-code, and let $d_{H}(n)=D_{H}(n)/2^{n \\choose 2}$. Alon observed that a lower bound on $d_{H}(n)$ can be obtained by attaining an upper bound on the number of colors needed to edge-color $K_n$ so that every copy of $H$ has an odd color class.\n  Motivated by this observation, we define $g(G,H)$ to be the minimum number of colors","authors_text":"Emily Heath, Patrick Bennett, Shira Zerbib","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-03T19:40:31Z","title":"Edge-coloring a graph $G$ so that every copy of a graph $H$ has an odd color class"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.01314","kind":"arxiv","version":3},"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:335e0231d9e3e3ea8fe8b086a0c60383723b42fd097a4f0d4eae80a61d76d3d6","target":"record","created_at":"2026-07-05T06:43:03Z","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":"3e541a9f5ac4b9b1986cc1dcb39c59873da3a6956c3e978d4c031d1a75742ec6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-03T19:40:31Z","title_canon_sha256":"b9cb3dfde5c709a0df61a9c6cf92692ca3bfb7560b514d1cc72efe95b1c34cc1"},"schema_version":"1.0","source":{"id":"2307.01314","kind":"arxiv","version":3}},"canonical_sha256":"d5e22a66bdcfd71298f5ae68e30356ecb55f843f9733b39e14b1371b19d415d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5e22a66bdcfd71298f5ae68e30356ecb55f843f9733b39e14b1371b19d415d0","first_computed_at":"2026-07-05T06:43:03.708659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:43:03.708659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8jZEEnT762SXyyTsPEe6cVNxRuUlM1zbTkdMbs4R72Vt/zxfmcof343ZIQBb7G7JDiQl5quDhAT32Uw8y0/pAw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:43:03.709159Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.01314","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:335e0231d9e3e3ea8fe8b086a0c60383723b42fd097a4f0d4eae80a61d76d3d6","sha256:3104c29d27416234bf4c98dbb0354b56da0dc39681254dff185c1b9e82403b3a"],"state_sha256":"c3e40408330d6541f07608cf95de5a99c8e10ff022aefd8a7d4c2e5ce2c71dfc"}