{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:S2RRPTOSJAQCJKX5VUIIRUSAUF","short_pith_number":"pith:S2RRPTOS","canonical_record":{"source":{"id":"1810.05772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-13T00:45:26Z","cross_cats_sorted":[],"title_canon_sha256":"56d16f6ada83cd080ac8023b86fe2e5dcfcee72f002816f2182d1b4dd7ec0991","abstract_canon_sha256":"3a1aabd97223f2e742926a319fa8340d800daa276a2359ac172d974d6d1a67ed"},"schema_version":"1.0"},"canonical_sha256":"96a317cdd2482024aafdad1088d240a16573dc3ab8af092bf5704b464714f305","source":{"kind":"arxiv","id":"1810.05772","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05772","created_at":"2026-05-18T00:03:27Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05772v1","created_at":"2026-05-18T00:03:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05772","created_at":"2026-05-18T00:03:27Z"},{"alias_kind":"pith_short_12","alias_value":"S2RRPTOSJAQC","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S2RRPTOSJAQCJKX5","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S2RRPTOS","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:S2RRPTOSJAQCJKX5VUIIRUSAUF","target":"record","payload":{"canonical_record":{"source":{"id":"1810.05772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-13T00:45:26Z","cross_cats_sorted":[],"title_canon_sha256":"56d16f6ada83cd080ac8023b86fe2e5dcfcee72f002816f2182d1b4dd7ec0991","abstract_canon_sha256":"3a1aabd97223f2e742926a319fa8340d800daa276a2359ac172d974d6d1a67ed"},"schema_version":"1.0"},"canonical_sha256":"96a317cdd2482024aafdad1088d240a16573dc3ab8af092bf5704b464714f305","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:27.001931Z","signature_b64":"ZcDTTW/mQy/CYqaOOE8WKiRGltE5a4oBfs5quh3SsoNHIB1hKzg/5ByfU24IrF6gSKCuNof9RY1qHTOail8UBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96a317cdd2482024aafdad1088d240a16573dc3ab8af092bf5704b464714f305","last_reissued_at":"2026-05-18T00:03:27.001518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:27.001518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.05772","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-18T00:03:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hSmY0uDqnV5WgGhTHUaazPEnkuq1lc3RnYyqFVC9t37oa2HVKI7QOACfvhQOSQX2TbrRMVH4Eg1zwbaFFqocBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:48:15.427634Z"},"content_sha256":"88911e18ec25790527b32889591bb05075dae892b9d3960ce23e2423499971e8","schema_version":"1.0","event_id":"sha256:88911e18ec25790527b32889591bb05075dae892b9d3960ce23e2423499971e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:S2RRPTOSJAQCJKX5VUIIRUSAUF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$C_{2k}$-saturated graphs with no short odd cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Craig Timmons","submitted_at":"2018-10-13T00:45:26Z","abstract_excerpt":"The saturation number of a graph $F$, written $\\textup{sat}(n,F)$, is the minimum number of edges in an $n$-vertex $F$-saturated graph. One of the earliest results on saturation numbers is due to Erd\\H{o}s, Hajnal, and Moon who determined $\\textup{sat}(n,K_r)$ for all $r \\geq 3$. Since then, saturation numbers of various graphs and hypergraphs have been studied. Motivated by Alon and Shikhelman's generalized Tur\\'an function, Kritschgau et.\\ al.\\ defined $\\textup{sat}(n,H,F)$ to be the minimum number of copies of $H$ in an $n$-vertex $F$-saturated graph. They proved, among other things, that $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05772","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-18T00:03:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cg5J6Es6x7x1mDawm8uE5tN8Tf+uu+3KD+WOQEmX4II6IVQXbzgqEV7X0Klo5xFoVSK1EcBy7bvYuMb2qJq5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:48:15.427978Z"},"content_sha256":"0af8c205aebe1bde1bf131f1039e8cf6dd70bf623b95caeab7d2120b6ed34ee7","schema_version":"1.0","event_id":"sha256:0af8c205aebe1bde1bf131f1039e8cf6dd70bf623b95caeab7d2120b6ed34ee7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S2RRPTOSJAQCJKX5VUIIRUSAUF/bundle.json","state_url":"https://pith.science/pith/S2RRPTOSJAQCJKX5VUIIRUSAUF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S2RRPTOSJAQCJKX5VUIIRUSAUF/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-02T19:48:15Z","links":{"resolver":"https://pith.science/pith/S2RRPTOSJAQCJKX5VUIIRUSAUF","bundle":"https://pith.science/pith/S2RRPTOSJAQCJKX5VUIIRUSAUF/bundle.json","state":"https://pith.science/pith/S2RRPTOSJAQCJKX5VUIIRUSAUF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S2RRPTOSJAQCJKX5VUIIRUSAUF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:S2RRPTOSJAQCJKX5VUIIRUSAUF","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":"3a1aabd97223f2e742926a319fa8340d800daa276a2359ac172d974d6d1a67ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-13T00:45:26Z","title_canon_sha256":"56d16f6ada83cd080ac8023b86fe2e5dcfcee72f002816f2182d1b4dd7ec0991"},"schema_version":"1.0","source":{"id":"1810.05772","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05772","created_at":"2026-05-18T00:03:27Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05772v1","created_at":"2026-05-18T00:03:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05772","created_at":"2026-05-18T00:03:27Z"},{"alias_kind":"pith_short_12","alias_value":"S2RRPTOSJAQC","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"S2RRPTOSJAQCJKX5","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"S2RRPTOS","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:0af8c205aebe1bde1bf131f1039e8cf6dd70bf623b95caeab7d2120b6ed34ee7","target":"graph","created_at":"2026-05-18T00:03:27Z","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":"The saturation number of a graph $F$, written $\\textup{sat}(n,F)$, is the minimum number of edges in an $n$-vertex $F$-saturated graph. One of the earliest results on saturation numbers is due to Erd\\H{o}s, Hajnal, and Moon who determined $\\textup{sat}(n,K_r)$ for all $r \\geq 3$. Since then, saturation numbers of various graphs and hypergraphs have been studied. Motivated by Alon and Shikhelman's generalized Tur\\'an function, Kritschgau et.\\ al.\\ defined $\\textup{sat}(n,H,F)$ to be the minimum number of copies of $H$ in an $n$-vertex $F$-saturated graph. They proved, among other things, that $","authors_text":"Craig Timmons","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-13T00:45:26Z","title":"$C_{2k}$-saturated graphs with no short odd cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05772","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:88911e18ec25790527b32889591bb05075dae892b9d3960ce23e2423499971e8","target":"record","created_at":"2026-05-18T00:03:27Z","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":"3a1aabd97223f2e742926a319fa8340d800daa276a2359ac172d974d6d1a67ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-13T00:45:26Z","title_canon_sha256":"56d16f6ada83cd080ac8023b86fe2e5dcfcee72f002816f2182d1b4dd7ec0991"},"schema_version":"1.0","source":{"id":"1810.05772","kind":"arxiv","version":1}},"canonical_sha256":"96a317cdd2482024aafdad1088d240a16573dc3ab8af092bf5704b464714f305","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96a317cdd2482024aafdad1088d240a16573dc3ab8af092bf5704b464714f305","first_computed_at":"2026-05-18T00:03:27.001518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:27.001518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZcDTTW/mQy/CYqaOOE8WKiRGltE5a4oBfs5quh3SsoNHIB1hKzg/5ByfU24IrF6gSKCuNof9RY1qHTOail8UBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:27.001931Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.05772","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88911e18ec25790527b32889591bb05075dae892b9d3960ce23e2423499971e8","sha256:0af8c205aebe1bde1bf131f1039e8cf6dd70bf623b95caeab7d2120b6ed34ee7"],"state_sha256":"8d16027131d2b4ba5a9fe93b1aece9297586205d04ae8fb9a0f5c85166e1608d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tPovgt/emdn/phFyJumO7IiJ5w2s4IrR/ym5lgLujTt94adYCDR071ys/Top6+wVFLFZY1C5YoTkQzHfnjlFAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:48:15.429896Z","bundle_sha256":"ae798e2d6af7f62da5cb5b28566e40e4e86e8e7808c9263c0ab8488705e88ceb"}}