{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZQNK5IGMWTLAFMJ3AEXRO2GXX7","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":"692fc2394504c89a6810a93fc1f70ae51dce9d00d77a6db1f181273b81670446","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-15T15:18:22Z","title_canon_sha256":"a26e98e86d13c0fbd9a171eacfd0b5b65fb31938c6bc433da7a42ca37f034fb9"},"schema_version":"1.0","source":{"id":"1803.05799","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05799","created_at":"2026-07-05T01:30:47Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05799v1","created_at":"2026-07-05T01:30:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05799","created_at":"2026-07-05T01:30:47Z"},{"alias_kind":"pith_short_12","alias_value":"ZQNK5IGMWTLA","created_at":"2026-07-05T01:30:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZQNK5IGMWTLAFMJ3","created_at":"2026-07-05T01:30:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZQNK5IGM","created_at":"2026-07-05T01:30:47Z"}],"graph_snapshots":[{"event_id":"sha256:83cb36b66ab66af3674de30ae113ad119de68edf59e98efa0161268720e6ead6","target":"graph","created_at":"2026-07-05T01:30:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1803.05799/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $\\mathcal{F}$ be a family of $r$-graphs. An $r$-graph $G$ is called $\\mathcal{F}$-saturated if it does not contain any members of $\\mathcal{F}$ but adding any edge creates a copy of some $r$-graph in $\\mathcal{F}$. The saturation number $\\operatorname{sat}(\\mathcal{F},n)$ is the minimum number of edges in an $\\mathcal{F}$-saturated graph on $n$ vertices. We prove that there exists a finite family $\\mathcal{F}$ such that $\\operatorname{sat}(\\mathcal{F},n) / n^{r-1}$ does not tend to a limit. This settles a question of Pikhurko.","authors_text":"Natalie C. Behague","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-15T15:18:22Z","title":"Hypergraph Saturation Irregularities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05799","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:9096a621804cd321cb0a1e773ac76c27522298e621892cf8726756a604b504b1","target":"record","created_at":"2026-07-05T01:30:47Z","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":"692fc2394504c89a6810a93fc1f70ae51dce9d00d77a6db1f181273b81670446","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-15T15:18:22Z","title_canon_sha256":"a26e98e86d13c0fbd9a171eacfd0b5b65fb31938c6bc433da7a42ca37f034fb9"},"schema_version":"1.0","source":{"id":"1803.05799","kind":"arxiv","version":1}},"canonical_sha256":"cc1aaea0ccb4d602b13b012f1768d7bfdbf2fa0ee655df1a18f906ae711c2b1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc1aaea0ccb4d602b13b012f1768d7bfdbf2fa0ee655df1a18f906ae711c2b1e","first_computed_at":"2026-07-05T01:30:47.899131Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:30:47.899131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PNglw0FwSu84/10JP0MDi9K/+sNjE+Uo1cNCbafbfhpoLawnralkq7wTkpelUcx/DGJQnCSRd8HAxJxQ+7SaDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:30:47.899623Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.05799","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9096a621804cd321cb0a1e773ac76c27522298e621892cf8726756a604b504b1","sha256:83cb36b66ab66af3674de30ae113ad119de68edf59e98efa0161268720e6ead6"],"state_sha256":"384195a170daa8683439b4a2f289f3525369ec7f30ecce9f393feaeb8afd682e"}