{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:LBWBJ4DTLF3K3FSBL3XTAGD6R4","short_pith_number":"pith:LBWBJ4DT","canonical_record":{"source":{"id":"2210.11172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-20T11:20:16Z","cross_cats_sorted":[],"title_canon_sha256":"52667feb2a8ec03e584449fb8be09096031a64860f521d957ea44081c2e45256","abstract_canon_sha256":"50e58ee9652cc00f85d0aba5c110eba2843efb8c72f5c046b0d22215113e9579"},"schema_version":"1.0"},"canonical_sha256":"586c14f0735976ad96415eef30187e8f146ea57239b08429f7b981d0a92861e6","source":{"kind":"arxiv","id":"2210.11172","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.11172","created_at":"2026-07-05T05:08:45Z"},{"alias_kind":"arxiv_version","alias_value":"2210.11172v1","created_at":"2026-07-05T05:08:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.11172","created_at":"2026-07-05T05:08:45Z"},{"alias_kind":"pith_short_12","alias_value":"LBWBJ4DTLF3K","created_at":"2026-07-05T05:08:45Z"},{"alias_kind":"pith_short_16","alias_value":"LBWBJ4DTLF3K3FSB","created_at":"2026-07-05T05:08:45Z"},{"alias_kind":"pith_short_8","alias_value":"LBWBJ4DT","created_at":"2026-07-05T05:08:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:LBWBJ4DTLF3K3FSBL3XTAGD6R4","target":"record","payload":{"canonical_record":{"source":{"id":"2210.11172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-20T11:20:16Z","cross_cats_sorted":[],"title_canon_sha256":"52667feb2a8ec03e584449fb8be09096031a64860f521d957ea44081c2e45256","abstract_canon_sha256":"50e58ee9652cc00f85d0aba5c110eba2843efb8c72f5c046b0d22215113e9579"},"schema_version":"1.0"},"canonical_sha256":"586c14f0735976ad96415eef30187e8f146ea57239b08429f7b981d0a92861e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:08:45.275384Z","signature_b64":"xC1WvQmSHkSL/r2IQQgGYYQ9ATWMnNcmThFFRGNXF67tZXXgmVMW11ktEf6BaJGNGwqdjr5MjQv2EWF/Itt/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"586c14f0735976ad96415eef30187e8f146ea57239b08429f7b981d0a92861e6","last_reissued_at":"2026-07-05T05:08:45.274991Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:08:45.274991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.11172","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-05T05:08:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GsRE4i1bHZb43DHmWtl30Iz3znXtsKJwwyoJL7KU6Q+i1s9/SeWVQv2dvRk3ciPlknefh4hpBKcS9/0Pm3GYAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T09:44:53.022143Z"},"content_sha256":"43e0f10b68becf221f0e7d72e1cefc74038cacf99a6812c13fe5e96e948aba77","schema_version":"1.0","event_id":"sha256:43e0f10b68becf221f0e7d72e1cefc74038cacf99a6812c13fe5e96e948aba77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:LBWBJ4DTLF3K3FSBL3XTAGD6R4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved bounds concerning the maximum degree of intersecting hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jian Wang, Peter Frankl","submitted_at":"2022-10-20T11:20:16Z","abstract_excerpt":"For positive integers $n>k>t$ let $\\binom{[n]}{k}$ denote the collection of all $k$-subsets of the standard $n$-element set $[n]=\\{1,\\ldots,n\\}$. Subsets of $\\binom{[n]}{k}$ are called $k$-graphs. A $k$-graph $\\mathcal{F}$ is called $t$-intersecting if $|F\\cap F'|\\geq t$ for all $F,F'\\in \\mathcal{F}$. One of the central results of extremal set theory is the Erd\\H{o}s-Ko-Rado Theorem which states that for $n\\geq (k-t+1)(t+1)$ no $t$-intersecting $k$-graph has more than $\\binom{n-t}{k-t}$ edges. For $n$ greater than this threshold the $t$-star (all $k$-sets containing a fixed $t$-set) is the onl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.11172","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/2210.11172/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-05T05:08:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4eyKAdsoXMxlvEZnc2JFYYQMJATvbKACU+rc5df/M1cvZDKDCVGKobjtj7SUsDx/lYZKzi+MOg9SHtNeduy5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T09:44:53.022516Z"},"content_sha256":"48f4c377e7536c9feaefed97cff7b3a6a2320037ed2bc8a57e4944086a1981dd","schema_version":"1.0","event_id":"sha256:48f4c377e7536c9feaefed97cff7b3a6a2320037ed2bc8a57e4944086a1981dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LBWBJ4DTLF3K3FSBL3XTAGD6R4/bundle.json","state_url":"https://pith.science/pith/LBWBJ4DTLF3K3FSBL3XTAGD6R4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LBWBJ4DTLF3K3FSBL3XTAGD6R4/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-10T09:44:53Z","links":{"resolver":"https://pith.science/pith/LBWBJ4DTLF3K3FSBL3XTAGD6R4","bundle":"https://pith.science/pith/LBWBJ4DTLF3K3FSBL3XTAGD6R4/bundle.json","state":"https://pith.science/pith/LBWBJ4DTLF3K3FSBL3XTAGD6R4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LBWBJ4DTLF3K3FSBL3XTAGD6R4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:LBWBJ4DTLF3K3FSBL3XTAGD6R4","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":"50e58ee9652cc00f85d0aba5c110eba2843efb8c72f5c046b0d22215113e9579","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-20T11:20:16Z","title_canon_sha256":"52667feb2a8ec03e584449fb8be09096031a64860f521d957ea44081c2e45256"},"schema_version":"1.0","source":{"id":"2210.11172","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.11172","created_at":"2026-07-05T05:08:45Z"},{"alias_kind":"arxiv_version","alias_value":"2210.11172v1","created_at":"2026-07-05T05:08:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.11172","created_at":"2026-07-05T05:08:45Z"},{"alias_kind":"pith_short_12","alias_value":"LBWBJ4DTLF3K","created_at":"2026-07-05T05:08:45Z"},{"alias_kind":"pith_short_16","alias_value":"LBWBJ4DTLF3K3FSB","created_at":"2026-07-05T05:08:45Z"},{"alias_kind":"pith_short_8","alias_value":"LBWBJ4DT","created_at":"2026-07-05T05:08:45Z"}],"graph_snapshots":[{"event_id":"sha256:48f4c377e7536c9feaefed97cff7b3a6a2320037ed2bc8a57e4944086a1981dd","target":"graph","created_at":"2026-07-05T05:08:45Z","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/2210.11172/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For positive integers $n>k>t$ let $\\binom{[n]}{k}$ denote the collection of all $k$-subsets of the standard $n$-element set $[n]=\\{1,\\ldots,n\\}$. Subsets of $\\binom{[n]}{k}$ are called $k$-graphs. A $k$-graph $\\mathcal{F}$ is called $t$-intersecting if $|F\\cap F'|\\geq t$ for all $F,F'\\in \\mathcal{F}$. One of the central results of extremal set theory is the Erd\\H{o}s-Ko-Rado Theorem which states that for $n\\geq (k-t+1)(t+1)$ no $t$-intersecting $k$-graph has more than $\\binom{n-t}{k-t}$ edges. For $n$ greater than this threshold the $t$-star (all $k$-sets containing a fixed $t$-set) is the onl","authors_text":"Jian Wang, Peter Frankl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-20T11:20:16Z","title":"Improved bounds concerning the maximum degree of intersecting hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.11172","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:43e0f10b68becf221f0e7d72e1cefc74038cacf99a6812c13fe5e96e948aba77","target":"record","created_at":"2026-07-05T05:08:45Z","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":"50e58ee9652cc00f85d0aba5c110eba2843efb8c72f5c046b0d22215113e9579","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-20T11:20:16Z","title_canon_sha256":"52667feb2a8ec03e584449fb8be09096031a64860f521d957ea44081c2e45256"},"schema_version":"1.0","source":{"id":"2210.11172","kind":"arxiv","version":1}},"canonical_sha256":"586c14f0735976ad96415eef30187e8f146ea57239b08429f7b981d0a92861e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"586c14f0735976ad96415eef30187e8f146ea57239b08429f7b981d0a92861e6","first_computed_at":"2026-07-05T05:08:45.274991Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:08:45.274991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xC1WvQmSHkSL/r2IQQgGYYQ9ATWMnNcmThFFRGNXF67tZXXgmVMW11ktEf6BaJGNGwqdjr5MjQv2EWF/Itt/Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:08:45.275384Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.11172","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43e0f10b68becf221f0e7d72e1cefc74038cacf99a6812c13fe5e96e948aba77","sha256:48f4c377e7536c9feaefed97cff7b3a6a2320037ed2bc8a57e4944086a1981dd"],"state_sha256":"e0e236792042370b8144992578e1a67c9ca1e8961c10af247e1486b66a6a24d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o/daA6RXV4DO6HbIaYxdrApU7sibMCyVrVNyeYQBUhO4BwqAMKrJPMDmufGpaQ8F/L/AibJnBzIDcsyt5V0EDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T09:44:53.024548Z","bundle_sha256":"15fef193ec9c938018b7a02aa80a529303d1721c0bab47cfbf0a3dd49c6fc9f2"}}