{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:543K4UX5IPCTAIT7VR556PKD4U","short_pith_number":"pith:543K4UX5","canonical_record":{"source":{"id":"1605.07535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-24T16:32:09Z","cross_cats_sorted":[],"title_canon_sha256":"d522e29d3e41063e001eed0cf2cd5d0e7ab99b3822daa46a63b7d6448c1c4817","abstract_canon_sha256":"1dab055a9cb391807597be96d1d83b2948db2d84994a6b671dec15eaf6a18b72"},"schema_version":"1.0"},"canonical_sha256":"ef36ae52fd43c530227fac7bdf3d43e51d4f850cffa0fa9deed3274f70883add","source":{"kind":"arxiv","id":"1605.07535","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07535","created_at":"2026-05-18T01:13:45Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07535v1","created_at":"2026-05-18T01:13:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07535","created_at":"2026-05-18T01:13:45Z"},{"alias_kind":"pith_short_12","alias_value":"543K4UX5IPCT","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"543K4UX5IPCTAIT7","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"543K4UX5","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:543K4UX5IPCTAIT7VR556PKD4U","target":"record","payload":{"canonical_record":{"source":{"id":"1605.07535","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-24T16:32:09Z","cross_cats_sorted":[],"title_canon_sha256":"d522e29d3e41063e001eed0cf2cd5d0e7ab99b3822daa46a63b7d6448c1c4817","abstract_canon_sha256":"1dab055a9cb391807597be96d1d83b2948db2d84994a6b671dec15eaf6a18b72"},"schema_version":"1.0"},"canonical_sha256":"ef36ae52fd43c530227fac7bdf3d43e51d4f850cffa0fa9deed3274f70883add","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:45.797045Z","signature_b64":"qAoQFk4I8LrU1xrBoL6AaNdT+Cp7HFb1y90SmkyRqH6NZZPOhtWqoBAtTJcdZW/1gf/UmPCCbvKVw4p2pbEYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef36ae52fd43c530227fac7bdf3d43e51d4f850cffa0fa9deed3274f70883add","last_reissued_at":"2026-05-18T01:13:45.796456Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:45.796456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.07535","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-05-18T01:13:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QOSVVKQMCXN5zdkdT/F5DlzsOEChwCIqPXnxVJ3ZP/BSYF6FUOxXXiXXc6pfRfyA6lbyeOhOLQdLYS2CC6MyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:37:26.371805Z"},"content_sha256":"b617ece73303da3ca5bb983779835b72e98c0d76307d7e70ca2e0fbd068eff0a","schema_version":"1.0","event_id":"sha256:b617ece73303da3ca5bb983779835b72e98c0d76307d7e70ca2e0fbd068eff0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:543K4UX5IPCTAIT7VR556PKD4U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Degree versions of the Erdos-Ko-Rado Theorem and Erdos hypergraph matching conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hao Huang, Yi Zhao","submitted_at":"2016-05-24T16:32:09Z","abstract_excerpt":"We use an algebraic method to prove a degree version of the celebrated Erd\\H os-Ko-Rado theorem: given $n>2k$, every intersecting $k$-uniform hypergraph $H$ on $n$ vertices contains a vertex that lies on at most $\\binom{n-2}{k-2}$ edges. This result can be viewed as a special case of the degree version of a well-known conjecture of Erd\\H{o}s on hypergraph matchings. Improving the work of Bollob\\'as, Daykin, and Erd\\H os from 1976, we show that given integers $n, k, s$ with $n\\ge 3k^2 s$, every $k$-uniform hypergraph $H$ on $n$ vertices with minimum vertex degree greater than $\\binom{n-1}{k-1}-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07535","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"},"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-05-18T01:13:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cnGS63F9lkWti19d5OPoUjF38vdM31qCrKPHUEOy6C1gp3AApkjXCdLxTk1ob+6Do/DKV4VkwR8d2rxIJs8yAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:37:26.372600Z"},"content_sha256":"4098bd8a3a2ac09b1547e2d5363bc817952dbf6ebb4ab5883d2c42df2d065a93","schema_version":"1.0","event_id":"sha256:4098bd8a3a2ac09b1547e2d5363bc817952dbf6ebb4ab5883d2c42df2d065a93"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/543K4UX5IPCTAIT7VR556PKD4U/bundle.json","state_url":"https://pith.science/pith/543K4UX5IPCTAIT7VR556PKD4U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/543K4UX5IPCTAIT7VR556PKD4U/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-05-31T12:37:26Z","links":{"resolver":"https://pith.science/pith/543K4UX5IPCTAIT7VR556PKD4U","bundle":"https://pith.science/pith/543K4UX5IPCTAIT7VR556PKD4U/bundle.json","state":"https://pith.science/pith/543K4UX5IPCTAIT7VR556PKD4U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/543K4UX5IPCTAIT7VR556PKD4U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:543K4UX5IPCTAIT7VR556PKD4U","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":"1dab055a9cb391807597be96d1d83b2948db2d84994a6b671dec15eaf6a18b72","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-24T16:32:09Z","title_canon_sha256":"d522e29d3e41063e001eed0cf2cd5d0e7ab99b3822daa46a63b7d6448c1c4817"},"schema_version":"1.0","source":{"id":"1605.07535","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07535","created_at":"2026-05-18T01:13:45Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07535v1","created_at":"2026-05-18T01:13:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07535","created_at":"2026-05-18T01:13:45Z"},{"alias_kind":"pith_short_12","alias_value":"543K4UX5IPCT","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"543K4UX5IPCTAIT7","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"543K4UX5","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:4098bd8a3a2ac09b1547e2d5363bc817952dbf6ebb4ab5883d2c42df2d065a93","target":"graph","created_at":"2026-05-18T01:13: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"},"paper":{"abstract_excerpt":"We use an algebraic method to prove a degree version of the celebrated Erd\\H os-Ko-Rado theorem: given $n>2k$, every intersecting $k$-uniform hypergraph $H$ on $n$ vertices contains a vertex that lies on at most $\\binom{n-2}{k-2}$ edges. This result can be viewed as a special case of the degree version of a well-known conjecture of Erd\\H{o}s on hypergraph matchings. Improving the work of Bollob\\'as, Daykin, and Erd\\H os from 1976, we show that given integers $n, k, s$ with $n\\ge 3k^2 s$, every $k$-uniform hypergraph $H$ on $n$ vertices with minimum vertex degree greater than $\\binom{n-1}{k-1}-","authors_text":"Hao Huang, Yi Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-24T16:32:09Z","title":"Degree versions of the Erdos-Ko-Rado Theorem and Erdos hypergraph matching conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07535","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:b617ece73303da3ca5bb983779835b72e98c0d76307d7e70ca2e0fbd068eff0a","target":"record","created_at":"2026-05-18T01:13: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":"1dab055a9cb391807597be96d1d83b2948db2d84994a6b671dec15eaf6a18b72","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-24T16:32:09Z","title_canon_sha256":"d522e29d3e41063e001eed0cf2cd5d0e7ab99b3822daa46a63b7d6448c1c4817"},"schema_version":"1.0","source":{"id":"1605.07535","kind":"arxiv","version":1}},"canonical_sha256":"ef36ae52fd43c530227fac7bdf3d43e51d4f850cffa0fa9deed3274f70883add","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef36ae52fd43c530227fac7bdf3d43e51d4f850cffa0fa9deed3274f70883add","first_computed_at":"2026-05-18T01:13:45.796456Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:45.796456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qAoQFk4I8LrU1xrBoL6AaNdT+Cp7HFb1y90SmkyRqH6NZZPOhtWqoBAtTJcdZW/1gf/UmPCCbvKVw4p2pbEYCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:45.797045Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.07535","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b617ece73303da3ca5bb983779835b72e98c0d76307d7e70ca2e0fbd068eff0a","sha256:4098bd8a3a2ac09b1547e2d5363bc817952dbf6ebb4ab5883d2c42df2d065a93"],"state_sha256":"afda3f83e24487def1b51b701ff6299d1ee516901783953f8fd6b77d8d8ac951"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vdq30tgVBMLG1V/w6Rg+X55Xo35kY43TqrBsa3w+6vLW+FJpWmHm5CutmSGkXPLmm3miaVmVZFMZ266UgLhDAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:37:26.376995Z","bundle_sha256":"c80ff5b3b68efd135325057c7c055723e5e985296ee402634014f6a2c172d587"}}