{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:JTQXMANIPFS5TJVMGPTSRAMQ7X","short_pith_number":"pith:JTQXMANI","canonical_record":{"source":{"id":"2305.01193","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-02T04:01:15Z","cross_cats_sorted":[],"title_canon_sha256":"b4bfc5a9983a51cb978a0a33bb096586a0977a133ef2488f5205583834f40f2a","abstract_canon_sha256":"917863e05e2c7bc4cd14bfe1f0ef762fe3fadd4397b632b379268d7c968d961b"},"schema_version":"1.0"},"canonical_sha256":"4ce17601a87965d9a6ac33e7288190fdf248dc771f36440f1fea0660d839cb07","source":{"kind":"arxiv","id":"2305.01193","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.01193","created_at":"2026-07-05T06:06:22Z"},{"alias_kind":"arxiv_version","alias_value":"2305.01193v1","created_at":"2026-07-05T06:06:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.01193","created_at":"2026-07-05T06:06:22Z"},{"alias_kind":"pith_short_12","alias_value":"JTQXMANIPFS5","created_at":"2026-07-05T06:06:22Z"},{"alias_kind":"pith_short_16","alias_value":"JTQXMANIPFS5TJVM","created_at":"2026-07-05T06:06:22Z"},{"alias_kind":"pith_short_8","alias_value":"JTQXMANI","created_at":"2026-07-05T06:06:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:JTQXMANIPFS5TJVMGPTSRAMQ7X","target":"record","payload":{"canonical_record":{"source":{"id":"2305.01193","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-02T04:01:15Z","cross_cats_sorted":[],"title_canon_sha256":"b4bfc5a9983a51cb978a0a33bb096586a0977a133ef2488f5205583834f40f2a","abstract_canon_sha256":"917863e05e2c7bc4cd14bfe1f0ef762fe3fadd4397b632b379268d7c968d961b"},"schema_version":"1.0"},"canonical_sha256":"4ce17601a87965d9a6ac33e7288190fdf248dc771f36440f1fea0660d839cb07","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:06:22.679447Z","signature_b64":"pyqTNipyd7jWoDAX8v5uz3AAUisQqT1RdzStY88F6qbBZtpE0V88MVuMZ0OHnPQgmRrz8tZmtJL5FscI1MlCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ce17601a87965d9a6ac33e7288190fdf248dc771f36440f1fea0660d839cb07","last_reissued_at":"2026-07-05T06:06:22.678987Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:06:22.678987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.01193","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-05T06:06:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pluABf8xFfFb4c624bfuTcaWs2no4hqCeFH57mEzkyF78pOy2OMvgk5vUuLYBx0L00ilwNgY9ujwrOtUeCa6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T04:45:53.803272Z"},"content_sha256":"59583e5cf1a618cecc922f184f9338d82e4b2f9dfc49ee7dded8172cae431c45","schema_version":"1.0","event_id":"sha256:59583e5cf1a618cecc922f184f9338d82e4b2f9dfc49ee7dded8172cae431c45"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:JTQXMANIPFS5TJVMGPTSRAMQ7X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Wickets in 3-uniform Hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jozsef Solymosi","submitted_at":"2023-05-02T04:01:15Z","abstract_excerpt":"In these notes, we consider a Tur\\'an-type problem in hypergraphs. What is the maximum number of edges if we forbid a subgraph? Let $H_n^{(3)}$ be a 3-uniform linear hypergraph, i.e. any two edges have at most one vertex common. A special hypergraph, called {\\em wicket}, is formed by three rows and two columns of a $3 \\times 3$ point matrix. We describe two linear hypergraphs -- both containing a wicket -- that if we forbid either of them in $H_n^{(3)}$, then the hypergraph is sparse, and the number of its edges is $o(n^2)$. This proves a conjecture of Gy\\'arf\\'as and S\\'ark\\\"ozy."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.01193","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/2305.01193/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-05T06:06:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8OCgdj+uqDA1aMXYVBaOhVuXO96XPe8cSfa67pOCwga+QiNnrQm/6/U66eumnKuB1i8Y5d09rg5NLCIaedpZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T04:45:53.803672Z"},"content_sha256":"e32fc5b20bed2890d1b8260c512ab9494fcdd411f3f95c62ffe3ab8401c45aa4","schema_version":"1.0","event_id":"sha256:e32fc5b20bed2890d1b8260c512ab9494fcdd411f3f95c62ffe3ab8401c45aa4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JTQXMANIPFS5TJVMGPTSRAMQ7X/bundle.json","state_url":"https://pith.science/pith/JTQXMANIPFS5TJVMGPTSRAMQ7X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JTQXMANIPFS5TJVMGPTSRAMQ7X/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-07-09T04:45:53Z","links":{"resolver":"https://pith.science/pith/JTQXMANIPFS5TJVMGPTSRAMQ7X","bundle":"https://pith.science/pith/JTQXMANIPFS5TJVMGPTSRAMQ7X/bundle.json","state":"https://pith.science/pith/JTQXMANIPFS5TJVMGPTSRAMQ7X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JTQXMANIPFS5TJVMGPTSRAMQ7X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:JTQXMANIPFS5TJVMGPTSRAMQ7X","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":"917863e05e2c7bc4cd14bfe1f0ef762fe3fadd4397b632b379268d7c968d961b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-02T04:01:15Z","title_canon_sha256":"b4bfc5a9983a51cb978a0a33bb096586a0977a133ef2488f5205583834f40f2a"},"schema_version":"1.0","source":{"id":"2305.01193","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.01193","created_at":"2026-07-05T06:06:22Z"},{"alias_kind":"arxiv_version","alias_value":"2305.01193v1","created_at":"2026-07-05T06:06:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.01193","created_at":"2026-07-05T06:06:22Z"},{"alias_kind":"pith_short_12","alias_value":"JTQXMANIPFS5","created_at":"2026-07-05T06:06:22Z"},{"alias_kind":"pith_short_16","alias_value":"JTQXMANIPFS5TJVM","created_at":"2026-07-05T06:06:22Z"},{"alias_kind":"pith_short_8","alias_value":"JTQXMANI","created_at":"2026-07-05T06:06:22Z"}],"graph_snapshots":[{"event_id":"sha256:e32fc5b20bed2890d1b8260c512ab9494fcdd411f3f95c62ffe3ab8401c45aa4","target":"graph","created_at":"2026-07-05T06:06:22Z","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/2305.01193/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In these notes, we consider a Tur\\'an-type problem in hypergraphs. What is the maximum number of edges if we forbid a subgraph? Let $H_n^{(3)}$ be a 3-uniform linear hypergraph, i.e. any two edges have at most one vertex common. A special hypergraph, called {\\em wicket}, is formed by three rows and two columns of a $3 \\times 3$ point matrix. We describe two linear hypergraphs -- both containing a wicket -- that if we forbid either of them in $H_n^{(3)}$, then the hypergraph is sparse, and the number of its edges is $o(n^2)$. This proves a conjecture of Gy\\'arf\\'as and S\\'ark\\\"ozy.","authors_text":"Jozsef Solymosi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-02T04:01:15Z","title":"Wickets in 3-uniform Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.01193","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:59583e5cf1a618cecc922f184f9338d82e4b2f9dfc49ee7dded8172cae431c45","target":"record","created_at":"2026-07-05T06:06:22Z","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":"917863e05e2c7bc4cd14bfe1f0ef762fe3fadd4397b632b379268d7c968d961b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-02T04:01:15Z","title_canon_sha256":"b4bfc5a9983a51cb978a0a33bb096586a0977a133ef2488f5205583834f40f2a"},"schema_version":"1.0","source":{"id":"2305.01193","kind":"arxiv","version":1}},"canonical_sha256":"4ce17601a87965d9a6ac33e7288190fdf248dc771f36440f1fea0660d839cb07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ce17601a87965d9a6ac33e7288190fdf248dc771f36440f1fea0660d839cb07","first_computed_at":"2026-07-05T06:06:22.678987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:06:22.678987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pyqTNipyd7jWoDAX8v5uz3AAUisQqT1RdzStY88F6qbBZtpE0V88MVuMZ0OHnPQgmRrz8tZmtJL5FscI1MlCDg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:06:22.679447Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.01193","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59583e5cf1a618cecc922f184f9338d82e4b2f9dfc49ee7dded8172cae431c45","sha256:e32fc5b20bed2890d1b8260c512ab9494fcdd411f3f95c62ffe3ab8401c45aa4"],"state_sha256":"6669604dcffb6df7a371baddcb60c961799c01515c414ec5df30dd1d60a1ce0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eaI0Rxkd0GpWD6vcsRK7H+bH5BaXntoO4pM1y+jHRypGtSZ87fSpA3PMjXJDXfo9Rf9Cf5yms/c9WXPpxi7AAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T04:45:53.806135Z","bundle_sha256":"ef0aeda22a9a48e25139f301e80612ec580477aeca4e2c50860aa62a0fc3aa48"}}