{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VSUDMH4R3MZ3DSDVXEVFX75627","short_pith_number":"pith:VSUDMH4R","schema_version":"1.0","canonical_sha256":"aca8361f91db33b1c875b92a5bffbed7cbf010dc32b158bed84a8c945d938989","source":{"kind":"arxiv","id":"1801.04250","version":2},"attestation_state":"computed","paper":{"title":"Graph cover-saturation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Danny Rorabaugh","submitted_at":"2018-01-12T17:55:38Z","abstract_excerpt":"Graph $G$ is $F$-saturated if $G$ contains no copy of graph $F$ but any edge added to $G$ produces at least one copy of $F$. One common variant of saturation is to remove the former restriction: $G$ is $F$-semi-saturated if any edge added to $G$ produces at least one new copy of $F$. In this paper we take this idea one step further. Rather than just allowing edges of $G$ to be in a copy of $F$, we require it: $G$ is $F$-covered if every edge of $G$ is in a copy of $F$. It turns out that there is smooth interaction between coverage and semi-saturation, which opens for investigation a natural an"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1801.04250","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-12T17:55:38Z","cross_cats_sorted":[],"title_canon_sha256":"f2a44111c4813640cb0ec7adce153865f3d3cf7f4ebae88ab14f7b7e84433ae6","abstract_canon_sha256":"54b5f345e78bf4cf5b0840d1e1cdae387821a89655c498f4c79a17c94518e4f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:46.953231Z","signature_b64":"Iha40chH0wsdziJXsIssDvcmeVw4KBSz1qh9Mh7XTFN18Q7GMQp/20QvEzj2InD3dIzqX7hOaZ9qFhxKxP93Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aca8361f91db33b1c875b92a5bffbed7cbf010dc32b158bed84a8c945d938989","last_reissued_at":"2026-05-17T23:45:46.952651Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:46.952651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph cover-saturation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Danny Rorabaugh","submitted_at":"2018-01-12T17:55:38Z","abstract_excerpt":"Graph $G$ is $F$-saturated if $G$ contains no copy of graph $F$ but any edge added to $G$ produces at least one copy of $F$. One common variant of saturation is to remove the former restriction: $G$ is $F$-semi-saturated if any edge added to $G$ produces at least one new copy of $F$. In this paper we take this idea one step further. Rather than just allowing edges of $G$ to be in a copy of $F$, we require it: $G$ is $F$-covered if every edge of $G$ is in a copy of $F$. It turns out that there is smooth interaction between coverage and semi-saturation, which opens for investigation a natural an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04250","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.04250","created_at":"2026-05-17T23:45:46.952736+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.04250v2","created_at":"2026-05-17T23:45:46.952736+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04250","created_at":"2026-05-17T23:45:46.952736+00:00"},{"alias_kind":"pith_short_12","alias_value":"VSUDMH4R3MZ3","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VSUDMH4R3MZ3DSDV","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VSUDMH4R","created_at":"2026-05-18T12:32:59.047623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VSUDMH4R3MZ3DSDVXEVFX75627","json":"https://pith.science/pith/VSUDMH4R3MZ3DSDVXEVFX75627.json","graph_json":"https://pith.science/api/pith-number/VSUDMH4R3MZ3DSDVXEVFX75627/graph.json","events_json":"https://pith.science/api/pith-number/VSUDMH4R3MZ3DSDVXEVFX75627/events.json","paper":"https://pith.science/paper/VSUDMH4R"},"agent_actions":{"view_html":"https://pith.science/pith/VSUDMH4R3MZ3DSDVXEVFX75627","download_json":"https://pith.science/pith/VSUDMH4R3MZ3DSDVXEVFX75627.json","view_paper":"https://pith.science/paper/VSUDMH4R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.04250&json=true","fetch_graph":"https://pith.science/api/pith-number/VSUDMH4R3MZ3DSDVXEVFX75627/graph.json","fetch_events":"https://pith.science/api/pith-number/VSUDMH4R3MZ3DSDVXEVFX75627/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VSUDMH4R3MZ3DSDVXEVFX75627/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VSUDMH4R3MZ3DSDVXEVFX75627/action/storage_attestation","attest_author":"https://pith.science/pith/VSUDMH4R3MZ3DSDVXEVFX75627/action/author_attestation","sign_citation":"https://pith.science/pith/VSUDMH4R3MZ3DSDVXEVFX75627/action/citation_signature","submit_replication":"https://pith.science/pith/VSUDMH4R3MZ3DSDVXEVFX75627/action/replication_record"}},"created_at":"2026-05-17T23:45:46.952736+00:00","updated_at":"2026-05-17T23:45:46.952736+00:00"}