{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4BCT5DPPDK3RS4QCDBEMAYWS2A","short_pith_number":"pith:4BCT5DPP","canonical_record":{"source":{"id":"1103.0067","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-01T02:18:36Z","cross_cats_sorted":[],"title_canon_sha256":"c0db6eedee6c24f98b615766e7b69b3402711028bfae23d9a96c90c7e912f40f","abstract_canon_sha256":"ff59a9d10daf73f523923b914db1a45d0c3b4e2105d998099fd8455eabfbe275"},"schema_version":"1.0"},"canonical_sha256":"e0453e8def1ab71972021848c062d2d02f219bf69f5006ecd451be47865823b8","source":{"kind":"arxiv","id":"1103.0067","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0067","created_at":"2026-05-18T04:27:37Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0067v1","created_at":"2026-05-18T04:27:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0067","created_at":"2026-05-18T04:27:37Z"},{"alias_kind":"pith_short_12","alias_value":"4BCT5DPPDK3R","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4BCT5DPPDK3RS4QC","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4BCT5DPP","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4BCT5DPPDK3RS4QCDBEMAYWS2A","target":"record","payload":{"canonical_record":{"source":{"id":"1103.0067","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-01T02:18:36Z","cross_cats_sorted":[],"title_canon_sha256":"c0db6eedee6c24f98b615766e7b69b3402711028bfae23d9a96c90c7e912f40f","abstract_canon_sha256":"ff59a9d10daf73f523923b914db1a45d0c3b4e2105d998099fd8455eabfbe275"},"schema_version":"1.0"},"canonical_sha256":"e0453e8def1ab71972021848c062d2d02f219bf69f5006ecd451be47865823b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:37.452854Z","signature_b64":"f0wVEwIGEyi7M3RBN3t4Y5AIUdT978rSQc5hf+2hWjXYaG+h+blAnx3M/zEvtMtu7vIu5L9RZyEXS/vmNiWdBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0453e8def1ab71972021848c062d2d02f219bf69f5006ecd451be47865823b8","last_reissued_at":"2026-05-18T04:27:37.452184Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:37.452184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.0067","source_version":1,"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-18T04:27:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/UlxH6CY4hpqHo2yX7yrMwlGDKiK3V4NIXPObuy5N681mTRvnjxENAFGJ1toMLOabL53qjp6KatZllJXF1ErAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:47:21.549840Z"},"content_sha256":"4a2f29d996929add3c3569b2e8f000070b88ba78be264a894b80f25c6e17d8c6","schema_version":"1.0","event_id":"sha256:4a2f29d996929add3c3569b2e8f000070b88ba78be264a894b80f25c6e17d8c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4BCT5DPPDK3RS4QCDBEMAYWS2A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cycle-saturated graphs with minimum number of edges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Younjin Kim, Zoltan Furedi","submitted_at":"2011-03-01T02:18:36Z","abstract_excerpt":"A graph $G$ is called $H$-saturated if it does not contain any copy of $H$, but for any edge $e$ in the complement of $G$ the graph $G+e$ contains some $H$. The minimum size of an $n$-vertex $H$-saturated graph is denoted by $\\sat(n,H)$. We prove $$\\sat(n,C_k) = n + n/k + O((n/k^2) + k^2)$$ holds for all $n\\geq k\\geq 3$, where $C_k$ is a cycle with length $k$. We have a similar result for semi-saturated graphs $$\\ssat(n,C_k) = n + n/(2k) + O((n/k^2) + k).$$ We conjecture that our three constructions are optimal."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0067","kind":"arxiv","version":1},"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-18T04:27:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kucZC6c9q1B68jhhQ89VC6MHjfopqjSGTDtIRvstTjVjXnigIWt4rSqwquYXiA8myqLSPPUjeiAGbGwxYLfaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:47:21.550509Z"},"content_sha256":"940c5797eb9627e5add02b3202641c23facc56e66545871b7e5d109e6ca547e6","schema_version":"1.0","event_id":"sha256:940c5797eb9627e5add02b3202641c23facc56e66545871b7e5d109e6ca547e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4BCT5DPPDK3RS4QCDBEMAYWS2A/bundle.json","state_url":"https://pith.science/pith/4BCT5DPPDK3RS4QCDBEMAYWS2A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4BCT5DPPDK3RS4QCDBEMAYWS2A/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-05-30T03:47:21Z","links":{"resolver":"https://pith.science/pith/4BCT5DPPDK3RS4QCDBEMAYWS2A","bundle":"https://pith.science/pith/4BCT5DPPDK3RS4QCDBEMAYWS2A/bundle.json","state":"https://pith.science/pith/4BCT5DPPDK3RS4QCDBEMAYWS2A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4BCT5DPPDK3RS4QCDBEMAYWS2A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4BCT5DPPDK3RS4QCDBEMAYWS2A","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":"ff59a9d10daf73f523923b914db1a45d0c3b4e2105d998099fd8455eabfbe275","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-01T02:18:36Z","title_canon_sha256":"c0db6eedee6c24f98b615766e7b69b3402711028bfae23d9a96c90c7e912f40f"},"schema_version":"1.0","source":{"id":"1103.0067","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.0067","created_at":"2026-05-18T04:27:37Z"},{"alias_kind":"arxiv_version","alias_value":"1103.0067v1","created_at":"2026-05-18T04:27:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.0067","created_at":"2026-05-18T04:27:37Z"},{"alias_kind":"pith_short_12","alias_value":"4BCT5DPPDK3R","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4BCT5DPPDK3RS4QC","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4BCT5DPP","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:940c5797eb9627e5add02b3202641c23facc56e66545871b7e5d109e6ca547e6","target":"graph","created_at":"2026-05-18T04:27:37Z","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":"A graph $G$ is called $H$-saturated if it does not contain any copy of $H$, but for any edge $e$ in the complement of $G$ the graph $G+e$ contains some $H$. The minimum size of an $n$-vertex $H$-saturated graph is denoted by $\\sat(n,H)$. We prove $$\\sat(n,C_k) = n + n/k + O((n/k^2) + k^2)$$ holds for all $n\\geq k\\geq 3$, where $C_k$ is a cycle with length $k$. We have a similar result for semi-saturated graphs $$\\ssat(n,C_k) = n + n/(2k) + O((n/k^2) + k).$$ We conjecture that our three constructions are optimal.","authors_text":"Younjin Kim, Zoltan Furedi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-01T02:18:36Z","title":"Cycle-saturated graphs with minimum number of edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.0067","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:4a2f29d996929add3c3569b2e8f000070b88ba78be264a894b80f25c6e17d8c6","target":"record","created_at":"2026-05-18T04:27:37Z","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":"ff59a9d10daf73f523923b914db1a45d0c3b4e2105d998099fd8455eabfbe275","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-01T02:18:36Z","title_canon_sha256":"c0db6eedee6c24f98b615766e7b69b3402711028bfae23d9a96c90c7e912f40f"},"schema_version":"1.0","source":{"id":"1103.0067","kind":"arxiv","version":1}},"canonical_sha256":"e0453e8def1ab71972021848c062d2d02f219bf69f5006ecd451be47865823b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0453e8def1ab71972021848c062d2d02f219bf69f5006ecd451be47865823b8","first_computed_at":"2026-05-18T04:27:37.452184Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:37.452184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f0wVEwIGEyi7M3RBN3t4Y5AIUdT978rSQc5hf+2hWjXYaG+h+blAnx3M/zEvtMtu7vIu5L9RZyEXS/vmNiWdBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:37.452854Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.0067","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a2f29d996929add3c3569b2e8f000070b88ba78be264a894b80f25c6e17d8c6","sha256:940c5797eb9627e5add02b3202641c23facc56e66545871b7e5d109e6ca547e6"],"state_sha256":"9289a4f198be819168687b881f4f929ae4af9f91e510a242d643d863b9c65b51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A0uOFbCmj0WSm6svHjhAreTq9LMcACXm343h19p82vBScAP0BygnOb9XR/JhBhgAYf6R+BNRdxmQyYUDwLFMBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T03:47:21.553815Z","bundle_sha256":"cc844d5d4444cd9b0cdac276a63a4fc3f48e9e580e1077d4d7a60f750ecdf0fa"}}