{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VSUDMH4R3MZ3DSDVXEVFX75627","short_pith_number":"pith:VSUDMH4R","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"},"canonical_sha256":"aca8361f91db33b1c875b92a5bffbed7cbf010dc32b158bed84a8c945d938989","source":{"kind":"arxiv","id":"1801.04250","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04250","created_at":"2026-05-17T23:45:46Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04250v2","created_at":"2026-05-17T23:45:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04250","created_at":"2026-05-17T23:45:46Z"},{"alias_kind":"pith_short_12","alias_value":"VSUDMH4R3MZ3","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VSUDMH4R3MZ3DSDV","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VSUDMH4R","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VSUDMH4R3MZ3DSDVXEVFX75627","target":"record","payload":{"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"},"canonical_sha256":"aca8361f91db33b1c875b92a5bffbed7cbf010dc32b158bed84a8c945d938989","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"},"source_kind":"arxiv","source_id":"1801.04250","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8PTZXYuP6+XRNtXdBLLvmNc6bAFzvscpUy4X9zJa6pfO6zz/8O+oj2fN999FiP0hXEzeWeSBtdwcD3EnignQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T19:19:12.401421Z"},"content_sha256":"071c9edeb5f69d54ee18ac755403c3839d7c5b42159383f1161e29e517ff7acd","schema_version":"1.0","event_id":"sha256:071c9edeb5f69d54ee18ac755403c3839d7c5b42159383f1161e29e517ff7acd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VSUDMH4R3MZ3DSDVXEVFX75627","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"468NoXlIWPOapISg1pPwq/mIJsqjLmHggGdWVqUlJJbPL9jjYtGLLY8gZp2Z+DhgqaHW2rG3AlkFs8wmQrQ2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T19:19:12.401773Z"},"content_sha256":"ff4b41df580017352d3830608997cd3115e096d88f7467e77e823865eb6eaa2b","schema_version":"1.0","event_id":"sha256:ff4b41df580017352d3830608997cd3115e096d88f7467e77e823865eb6eaa2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VSUDMH4R3MZ3DSDVXEVFX75627/bundle.json","state_url":"https://pith.science/pith/VSUDMH4R3MZ3DSDVXEVFX75627/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VSUDMH4R3MZ3DSDVXEVFX75627/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-21T19:19:12Z","links":{"resolver":"https://pith.science/pith/VSUDMH4R3MZ3DSDVXEVFX75627","bundle":"https://pith.science/pith/VSUDMH4R3MZ3DSDVXEVFX75627/bundle.json","state":"https://pith.science/pith/VSUDMH4R3MZ3DSDVXEVFX75627/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VSUDMH4R3MZ3DSDVXEVFX75627/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VSUDMH4R3MZ3DSDVXEVFX75627","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":"54b5f345e78bf4cf5b0840d1e1cdae387821a89655c498f4c79a17c94518e4f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-12T17:55:38Z","title_canon_sha256":"f2a44111c4813640cb0ec7adce153865f3d3cf7f4ebae88ab14f7b7e84433ae6"},"schema_version":"1.0","source":{"id":"1801.04250","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04250","created_at":"2026-05-17T23:45:46Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04250v2","created_at":"2026-05-17T23:45:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04250","created_at":"2026-05-17T23:45:46Z"},{"alias_kind":"pith_short_12","alias_value":"VSUDMH4R3MZ3","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VSUDMH4R3MZ3DSDV","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VSUDMH4R","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:ff4b41df580017352d3830608997cd3115e096d88f7467e77e823865eb6eaa2b","target":"graph","created_at":"2026-05-17T23:45:46Z","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":"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","authors_text":"Danny Rorabaugh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-12T17:55:38Z","title":"Graph cover-saturation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04250","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:071c9edeb5f69d54ee18ac755403c3839d7c5b42159383f1161e29e517ff7acd","target":"record","created_at":"2026-05-17T23:45:46Z","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":"54b5f345e78bf4cf5b0840d1e1cdae387821a89655c498f4c79a17c94518e4f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-01-12T17:55:38Z","title_canon_sha256":"f2a44111c4813640cb0ec7adce153865f3d3cf7f4ebae88ab14f7b7e84433ae6"},"schema_version":"1.0","source":{"id":"1801.04250","kind":"arxiv","version":2}},"canonical_sha256":"aca8361f91db33b1c875b92a5bffbed7cbf010dc32b158bed84a8c945d938989","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aca8361f91db33b1c875b92a5bffbed7cbf010dc32b158bed84a8c945d938989","first_computed_at":"2026-05-17T23:45:46.952651Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:46.952651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Iha40chH0wsdziJXsIssDvcmeVw4KBSz1qh9Mh7XTFN18Q7GMQp/20QvEzj2InD3dIzqX7hOaZ9qFhxKxP93Cg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:46.953231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04250","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:071c9edeb5f69d54ee18ac755403c3839d7c5b42159383f1161e29e517ff7acd","sha256:ff4b41df580017352d3830608997cd3115e096d88f7467e77e823865eb6eaa2b"],"state_sha256":"a6b0bf4436be5d6e2bbfe8d1203f80f2da359e842ee14afde09c07760c7ed3d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sMPylMg/WV3CzomqUZcbCJXRP+eL+6Y+Zn4rpn4Slm4UQsltINCzqch/3Ku2ebmoTEnCaZ4BeQjvO6NVJB0yDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T19:19:12.403726Z","bundle_sha256":"65e7eb970ae06966ceaf5db2cdd4edd7650f4fa339e2a6c944ed1caf5adef0a7"}}