{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:S2RRPTOSJAQCJKX5VUIIRUSAUF","short_pith_number":"pith:S2RRPTOS","schema_version":"1.0","canonical_sha256":"96a317cdd2482024aafdad1088d240a16573dc3ab8af092bf5704b464714f305","source":{"kind":"arxiv","id":"1810.05772","version":1},"attestation_state":"computed","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 $"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.05772","created_at":"2026-05-18T00:03:27.001591+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.05772v1","created_at":"2026-05-18T00:03:27.001591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05772","created_at":"2026-05-18T00:03:27.001591+00:00"},{"alias_kind":"pith_short_12","alias_value":"S2RRPTOSJAQC","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"S2RRPTOSJAQCJKX5","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"S2RRPTOS","created_at":"2026-05-18T12:32:50.500415+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/S2RRPTOSJAQCJKX5VUIIRUSAUF","json":"https://pith.science/pith/S2RRPTOSJAQCJKX5VUIIRUSAUF.json","graph_json":"https://pith.science/api/pith-number/S2RRPTOSJAQCJKX5VUIIRUSAUF/graph.json","events_json":"https://pith.science/api/pith-number/S2RRPTOSJAQCJKX5VUIIRUSAUF/events.json","paper":"https://pith.science/paper/S2RRPTOS"},"agent_actions":{"view_html":"https://pith.science/pith/S2RRPTOSJAQCJKX5VUIIRUSAUF","download_json":"https://pith.science/pith/S2RRPTOSJAQCJKX5VUIIRUSAUF.json","view_paper":"https://pith.science/paper/S2RRPTOS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.05772&json=true","fetch_graph":"https://pith.science/api/pith-number/S2RRPTOSJAQCJKX5VUIIRUSAUF/graph.json","fetch_events":"https://pith.science/api/pith-number/S2RRPTOSJAQCJKX5VUIIRUSAUF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S2RRPTOSJAQCJKX5VUIIRUSAUF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S2RRPTOSJAQCJKX5VUIIRUSAUF/action/storage_attestation","attest_author":"https://pith.science/pith/S2RRPTOSJAQCJKX5VUIIRUSAUF/action/author_attestation","sign_citation":"https://pith.science/pith/S2RRPTOSJAQCJKX5VUIIRUSAUF/action/citation_signature","submit_replication":"https://pith.science/pith/S2RRPTOSJAQCJKX5VUIIRUSAUF/action/replication_record"}},"created_at":"2026-05-18T00:03:27.001591+00:00","updated_at":"2026-05-18T00:03:27.001591+00:00"}