{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KPKWVBKXHSPL5TR542BSIFGITJ","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":"4b60d863f06cfe0adb3abc62433ed37d552b6391c0525f81102917fda28bba88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-01T02:28:29Z","title_canon_sha256":"c21dd79304ddf5452acaa5fcc0e5db7997cc0110a9f21ae09275fd9242c0258b"},"schema_version":"1.0","source":{"id":"1712.00163","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.00163","created_at":"2026-05-18T00:29:07Z"},{"alias_kind":"arxiv_version","alias_value":"1712.00163v1","created_at":"2026-05-18T00:29:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.00163","created_at":"2026-05-18T00:29:07Z"},{"alias_kind":"pith_short_12","alias_value":"KPKWVBKXHSPL","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KPKWVBKXHSPL5TR5","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KPKWVBKX","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:b8f9b2b62f0bee22c7ffafcda5a587a1b486dfb015c4a3793051eb0e6fb70d42","target":"graph","created_at":"2026-05-18T00:29:07Z","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"},"paper":{"abstract_excerpt":"Let $\\mathcal{C}$ be a family of edge-colored graphs. A $t$-edge colored graph $G$ is $(\\mathcal{C}, t)$-saturated if $G$ does not contain any graph in $\\mathcal{C}$ but the addition of any edge in any color in $[t]$ creates a copy of some graph in $\\mathcal{C}$. Similarly to classical saturation functions, define $\\mathrm{sat}_t(n, \\mathcal{C})$ to be the minimum number of edges in a $(\\mathcal{C},t)$ saturated graph. Let $\\mathcal{C}_r(H)$ be the family consisting of every edge-colored copy of $H$ which uses exactly $r$ colors.\n  In this paper we consider a variety of colored saturation prob","authors_text":"Alex Schulte, Casey Tompkins, Daniel Johnston, Eric Sullivan, Florian Pfender, Heather C. Smith, Michael Ferrara, Michael Tait, Sarah Loeb","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-01T02:28:29Z","title":"On Edge-Colored Saturation Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.00163","kind":"arxiv","version":1},"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:11d986edf07aebf8af99699d02fceac4e225caa69266b3b4cb304dc53f3ec6b2","target":"record","created_at":"2026-05-18T00:29:07Z","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":"4b60d863f06cfe0adb3abc62433ed37d552b6391c0525f81102917fda28bba88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-01T02:28:29Z","title_canon_sha256":"c21dd79304ddf5452acaa5fcc0e5db7997cc0110a9f21ae09275fd9242c0258b"},"schema_version":"1.0","source":{"id":"1712.00163","kind":"arxiv","version":1}},"canonical_sha256":"53d56a85573c9ebece3de6832414c89a5d35af7ac389912ee4acab5a30b1b58d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53d56a85573c9ebece3de6832414c89a5d35af7ac389912ee4acab5a30b1b58d","first_computed_at":"2026-05-18T00:29:07.121196Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:07.121196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zIHeANimPxB8sZ6K2O0UpNXCdt2Bm4KUHSilc0yGHCiNxdZycMSLNIhgR3LW7+gRzPptI4uFMTUdw6vBvG2PCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:07.121857Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.00163","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11d986edf07aebf8af99699d02fceac4e225caa69266b3b4cb304dc53f3ec6b2","sha256:b8f9b2b62f0bee22c7ffafcda5a587a1b486dfb015c4a3793051eb0e6fb70d42"],"state_sha256":"ae973963ee8f08fb699b44d6345ef82ac620b7b1cc78ad37f753c874caf5279a"}