{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:AIQSDWK5WXXZZDQD6QZAFFPKEA","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":"b87c10902aa43feb411238512ec693f6e6a2e387ad1c8f842f330d0b13d521f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-13T20:31:10Z","title_canon_sha256":"436d19802bdc7afc6e1124a342315f9630c7b614dfe1b302ccaf477639509168"},"schema_version":"1.0","source":{"id":"1408.3137","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.3137","created_at":"2026-05-18T02:45:13Z"},{"alias_kind":"arxiv_version","alias_value":"1408.3137v1","created_at":"2026-05-18T02:45:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3137","created_at":"2026-05-18T02:45:13Z"},{"alias_kind":"pith_short_12","alias_value":"AIQSDWK5WXXZ","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"AIQSDWK5WXXZZDQD","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"AIQSDWK5","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:638b769b3cd6545c6ae9c48a0b4f2e3eacd475482c8958d870c08e85b207d8ad","target":"graph","created_at":"2026-05-18T02:45:13Z","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 $G$ be a fixed graph and let ${\\mathcal F}$ be a family of graphs. A subgraph $J$ of $G$ is ${\\mathcal F}$-saturated if no member of ${\\mathcal F}$ is a subgraph of $J$, but for any edge $e$ in $E(G)-E(J)$, some element of ${\\mathcal F}$ is a subgraph of $J+e$. We let $\\text{ex}({\\mathcal F},G)$ and $\\text{sat}({\\mathcal F},G)$ denote the maximum and minimum size of an ${\\mathcal F}$-saturated subgraph of $G$, respectively. If no element of ${\\mathcal F}$ is a subgraph of $G$, then $\\text{sat}({\\mathcal F},G) = \\text{ex}({\\mathcal F}, G) = |E(G)|$.\n  In this paper, for $k\\ge 3$ and $n\\ge 1","authors_text":"Florian Pfender, Michael Ferrara, Michael S. Jacobson, Paul S. Wenger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-13T20:31:10Z","title":"Graph Saturation in Multipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3137","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:529dc3145f753b6977334384c1901817dcbd00a88a4cead0e7fca41ec25b48ff","target":"record","created_at":"2026-05-18T02:45:13Z","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":"b87c10902aa43feb411238512ec693f6e6a2e387ad1c8f842f330d0b13d521f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-13T20:31:10Z","title_canon_sha256":"436d19802bdc7afc6e1124a342315f9630c7b614dfe1b302ccaf477639509168"},"schema_version":"1.0","source":{"id":"1408.3137","kind":"arxiv","version":1}},"canonical_sha256":"022121d95db5ef9c8e03f4320295ea202039af2194370007e93498caf6c076e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"022121d95db5ef9c8e03f4320295ea202039af2194370007e93498caf6c076e0","first_computed_at":"2026-05-18T02:45:13.717864Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:13.717864Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bfwyY6Db6TsJ2VRUceqyEBDXBiOSNFWKCTmx+BCicAh/LS+sUfzVM5t4uHovvwTh5MI/5/Bfb2mHsbqX7AfHAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:13.718520Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.3137","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:529dc3145f753b6977334384c1901817dcbd00a88a4cead0e7fca41ec25b48ff","sha256:638b769b3cd6545c6ae9c48a0b4f2e3eacd475482c8958d870c08e85b207d8ad"],"state_sha256":"c35fe79601a3d27b29d17f6668e5b9e0e8bdd0118af54b33d9797c27d5109bcf"}