{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:JJ7E5EN5AWJNGAU67MVAG6MVIU","short_pith_number":"pith:JJ7E5EN5","canonical_record":{"source":{"id":"2109.09931","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-09-21T03:13:01Z","cross_cats_sorted":[],"title_canon_sha256":"a735fed6f6373a91252320a583bbed482bc6db252034ce0743d6a601eac2820a","abstract_canon_sha256":"5338c97657d2b63d40f57cd4baad525163f9cc61dc810fbe8bac211002d50e2e"},"schema_version":"1.0"},"canonical_sha256":"4a7e4e91bd0592d3029efb2a0379954528f63ae0afec91d4dcd5f20b9bb0fa66","source":{"kind":"arxiv","id":"2109.09931","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.09931","created_at":"2026-07-05T03:15:56Z"},{"alias_kind":"arxiv_version","alias_value":"2109.09931v1","created_at":"2026-07-05T03:15:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.09931","created_at":"2026-07-05T03:15:56Z"},{"alias_kind":"pith_short_12","alias_value":"JJ7E5EN5AWJN","created_at":"2026-07-05T03:15:56Z"},{"alias_kind":"pith_short_16","alias_value":"JJ7E5EN5AWJNGAU6","created_at":"2026-07-05T03:15:56Z"},{"alias_kind":"pith_short_8","alias_value":"JJ7E5EN5","created_at":"2026-07-05T03:15:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:JJ7E5EN5AWJNGAU67MVAG6MVIU","target":"record","payload":{"canonical_record":{"source":{"id":"2109.09931","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-09-21T03:13:01Z","cross_cats_sorted":[],"title_canon_sha256":"a735fed6f6373a91252320a583bbed482bc6db252034ce0743d6a601eac2820a","abstract_canon_sha256":"5338c97657d2b63d40f57cd4baad525163f9cc61dc810fbe8bac211002d50e2e"},"schema_version":"1.0"},"canonical_sha256":"4a7e4e91bd0592d3029efb2a0379954528f63ae0afec91d4dcd5f20b9bb0fa66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:15:56.073550Z","signature_b64":"5Eg13Nxk82LUuPrSrYMs5jn1Y0YUa/hAmZ4Vc+MTu5EVmJZYveiRL2twX7s12A+NW3aN24fezkKnCY7GS/6OCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a7e4e91bd0592d3029efb2a0379954528f63ae0afec91d4dcd5f20b9bb0fa66","last_reissued_at":"2026-07-05T03:15:56.073060Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:15:56.073060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2109.09931","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-07-05T03:15:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EB7NpppTNSnZbeXoKp/DD0W7GG+Gjlh9eCaSLtIF8PRvoTbU+eeO5Xeg7HC+nECrj7Rnsy+QVWCnWFv5MQRmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T09:00:21.940250Z"},"content_sha256":"2179918bf14e496d8604e9c6e2b85c7a3dbaa1d790123bf60b6f96bb94bde608","schema_version":"1.0","event_id":"sha256:2179918bf14e496d8604e9c6e2b85c7a3dbaa1d790123bf60b6f96bb94bde608"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:JJ7E5EN5AWJNGAU67MVAG6MVIU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Saturation Problems in Convex Geometric Hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jason O'Neill, Sam Spiro","submitted_at":"2021-09-21T03:13:01Z","abstract_excerpt":"A convex geometric hypergraph (abbreviated cgh) consists of a collection of subsets of a strictly convex set of points in the plane. Extremal problems for cgh's have been extensively studied in the literature, and in this paper we consider their corresponding saturation problems. We asymptotically determine the saturation number of two geometrically disjoint $r$-tuples. Further, amongst the eight nonisomorphic $3$-uniform cgh's on two edges, we determine the saturation number for seven of these up to order of magnitude and the eighth up to a log factor."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.09931","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.09931/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:15:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"54nQObjFEzW/4zDX85R76TYRAPCRsqWZ45RSGcagIQsEfaCfHs8WPJbVIMEamjR68aw4xyZ3yEtJ5kUitzpoAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T09:00:21.940776Z"},"content_sha256":"003a8d4b77f3289b692ec70009b94755ab25f315a500c1ba483d589b54ac81d3","schema_version":"1.0","event_id":"sha256:003a8d4b77f3289b692ec70009b94755ab25f315a500c1ba483d589b54ac81d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JJ7E5EN5AWJNGAU67MVAG6MVIU/bundle.json","state_url":"https://pith.science/pith/JJ7E5EN5AWJNGAU67MVAG6MVIU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JJ7E5EN5AWJNGAU67MVAG6MVIU/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-08-19T09:00:21Z","links":{"resolver":"https://pith.science/pith/JJ7E5EN5AWJNGAU67MVAG6MVIU","bundle":"https://pith.science/pith/JJ7E5EN5AWJNGAU67MVAG6MVIU/bundle.json","state":"https://pith.science/pith/JJ7E5EN5AWJNGAU67MVAG6MVIU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JJ7E5EN5AWJNGAU67MVAG6MVIU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:JJ7E5EN5AWJNGAU67MVAG6MVIU","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":"5338c97657d2b63d40f57cd4baad525163f9cc61dc810fbe8bac211002d50e2e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-09-21T03:13:01Z","title_canon_sha256":"a735fed6f6373a91252320a583bbed482bc6db252034ce0743d6a601eac2820a"},"schema_version":"1.0","source":{"id":"2109.09931","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.09931","created_at":"2026-07-05T03:15:56Z"},{"alias_kind":"arxiv_version","alias_value":"2109.09931v1","created_at":"2026-07-05T03:15:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.09931","created_at":"2026-07-05T03:15:56Z"},{"alias_kind":"pith_short_12","alias_value":"JJ7E5EN5AWJN","created_at":"2026-07-05T03:15:56Z"},{"alias_kind":"pith_short_16","alias_value":"JJ7E5EN5AWJNGAU6","created_at":"2026-07-05T03:15:56Z"},{"alias_kind":"pith_short_8","alias_value":"JJ7E5EN5","created_at":"2026-07-05T03:15:56Z"}],"graph_snapshots":[{"event_id":"sha256:003a8d4b77f3289b692ec70009b94755ab25f315a500c1ba483d589b54ac81d3","target":"graph","created_at":"2026-07-05T03:15:56Z","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/2109.09931/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A convex geometric hypergraph (abbreviated cgh) consists of a collection of subsets of a strictly convex set of points in the plane. Extremal problems for cgh's have been extensively studied in the literature, and in this paper we consider their corresponding saturation problems. We asymptotically determine the saturation number of two geometrically disjoint $r$-tuples. Further, amongst the eight nonisomorphic $3$-uniform cgh's on two edges, we determine the saturation number for seven of these up to order of magnitude and the eighth up to a log factor.","authors_text":"Jason O'Neill, Sam Spiro","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-09-21T03:13:01Z","title":"Saturation Problems in Convex Geometric Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.09931","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:2179918bf14e496d8604e9c6e2b85c7a3dbaa1d790123bf60b6f96bb94bde608","target":"record","created_at":"2026-07-05T03:15:56Z","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":"5338c97657d2b63d40f57cd4baad525163f9cc61dc810fbe8bac211002d50e2e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-09-21T03:13:01Z","title_canon_sha256":"a735fed6f6373a91252320a583bbed482bc6db252034ce0743d6a601eac2820a"},"schema_version":"1.0","source":{"id":"2109.09931","kind":"arxiv","version":1}},"canonical_sha256":"4a7e4e91bd0592d3029efb2a0379954528f63ae0afec91d4dcd5f20b9bb0fa66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a7e4e91bd0592d3029efb2a0379954528f63ae0afec91d4dcd5f20b9bb0fa66","first_computed_at":"2026-07-05T03:15:56.073060Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:15:56.073060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5Eg13Nxk82LUuPrSrYMs5jn1Y0YUa/hAmZ4Vc+MTu5EVmJZYveiRL2twX7s12A+NW3aN24fezkKnCY7GS/6OCg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:15:56.073550Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.09931","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2179918bf14e496d8604e9c6e2b85c7a3dbaa1d790123bf60b6f96bb94bde608","sha256:003a8d4b77f3289b692ec70009b94755ab25f315a500c1ba483d589b54ac81d3"],"state_sha256":"c3f33c56578b0b2c15ba6168a107660df3875887149f975698d5c58c84e0be98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QszqwbXQK/apgLTvJU2Ar7hJXiKo1S9GHmPFU2aqub0toLBaqR0/hCaBe9f46Ya77sj4fEeU590Qd0jhVqlgAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T09:00:21.946570Z","bundle_sha256":"7351b914d6ee7b17fbefc6860f2bd3bea20cfd061fe6a0d6ddb4549d2ff096b9"}}