{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:O3ANUYWQUR4KSGA3XQVMDPIJ6W","short_pith_number":"pith:O3ANUYWQ","canonical_record":{"source":{"id":"1304.6901","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-25T13:15:22Z","cross_cats_sorted":[],"title_canon_sha256":"830d1fe528e4ee855a9a237d33d0d6bb437f29c886a51f7f890d573eee43cb66","abstract_canon_sha256":"11a6866eb59227d3c429daf61003d7900ef1fdea6e910467296fb4277d8d94fa"},"schema_version":"1.0"},"canonical_sha256":"76c0da62d0a478a9181bbc2ac1bd09f5b9e70824d973db74f9e797e1ef586962","source":{"kind":"arxiv","id":"1304.6901","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6901","created_at":"2026-05-18T03:05:54Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6901v3","created_at":"2026-05-18T03:05:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6901","created_at":"2026-05-18T03:05:54Z"},{"alias_kind":"pith_short_12","alias_value":"O3ANUYWQUR4K","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"O3ANUYWQUR4KSGA3","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"O3ANUYWQ","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:O3ANUYWQUR4KSGA3XQVMDPIJ6W","target":"record","payload":{"canonical_record":{"source":{"id":"1304.6901","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-25T13:15:22Z","cross_cats_sorted":[],"title_canon_sha256":"830d1fe528e4ee855a9a237d33d0d6bb437f29c886a51f7f890d573eee43cb66","abstract_canon_sha256":"11a6866eb59227d3c429daf61003d7900ef1fdea6e910467296fb4277d8d94fa"},"schema_version":"1.0"},"canonical_sha256":"76c0da62d0a478a9181bbc2ac1bd09f5b9e70824d973db74f9e797e1ef586962","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:54.649445Z","signature_b64":"1kMTUXj93/g1gJFBNBfvlySgvFRPi71DMsLdRFQxhh1+sDeV7MhlbROXxaElxyMyIHMaDBp2vbG7cH0Fvf6SDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76c0da62d0a478a9181bbc2ac1bd09f5b9e70824d973db74f9e797e1ef586962","last_reissued_at":"2026-05-18T03:05:54.648670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:54.648670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.6901","source_version":3,"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-18T03:05:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MK5ddtcNS7Ma2ygxmIVsBI7fjDlX//BPs1JyTTayqJvNlvLbPvsjnTmSl11qgCkaj3xKzroYLwg4u5sTa+0JAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:42:26.222092Z"},"content_sha256":"436509da637667553d388ac0da5cbed6d15f5fb0c54120aab71a964cbd40ce2b","schema_version":"1.0","event_id":"sha256:436509da637667553d388ac0da5cbed6d15f5fb0c54120aab71a964cbd40ce2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:O3ANUYWQUR4KSGA3XQVMDPIJ6W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fractional and integer matchings in uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniela K\\\"uhn, Deryk Osthus, Timothy Townsend","submitted_at":"2013-04-25T13:15:22Z","abstract_excerpt":"Our main result improves bounds of Markstrom and Rucinski on the minimum d-degree which forces a perfect matching in a k-uniform hypergraph on n vertices. We also extend bounds of Bollobas, Daykin and Erdos by asymptotically determining the minimum vertex degree which forces a matching of size t < n/2(k-1) in a k-uniform hypergraph on n vertices. Further asymptotically tight results on d-degrees which force large matchings are also obtained. Our approach is to prove fractional versions of the above results and then translate these into integer versions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6901","kind":"arxiv","version":3},"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-18T03:05:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NIDtaCCnpMfsN5xAIu8/kh3Y0nScDHGYkYkKmiQlr21ugFmek3yCo8oZlYwifsKDTRBVGVNnbk8rT7j9XO5bCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:42:26.222494Z"},"content_sha256":"c2a067c9be174011fd59da81ba78767f08d8c25792299ca3e55aac78a2f6005e","schema_version":"1.0","event_id":"sha256:c2a067c9be174011fd59da81ba78767f08d8c25792299ca3e55aac78a2f6005e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O3ANUYWQUR4KSGA3XQVMDPIJ6W/bundle.json","state_url":"https://pith.science/pith/O3ANUYWQUR4KSGA3XQVMDPIJ6W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O3ANUYWQUR4KSGA3XQVMDPIJ6W/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-30T12:42:26Z","links":{"resolver":"https://pith.science/pith/O3ANUYWQUR4KSGA3XQVMDPIJ6W","bundle":"https://pith.science/pith/O3ANUYWQUR4KSGA3XQVMDPIJ6W/bundle.json","state":"https://pith.science/pith/O3ANUYWQUR4KSGA3XQVMDPIJ6W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O3ANUYWQUR4KSGA3XQVMDPIJ6W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:O3ANUYWQUR4KSGA3XQVMDPIJ6W","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":"11a6866eb59227d3c429daf61003d7900ef1fdea6e910467296fb4277d8d94fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-25T13:15:22Z","title_canon_sha256":"830d1fe528e4ee855a9a237d33d0d6bb437f29c886a51f7f890d573eee43cb66"},"schema_version":"1.0","source":{"id":"1304.6901","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.6901","created_at":"2026-05-18T03:05:54Z"},{"alias_kind":"arxiv_version","alias_value":"1304.6901v3","created_at":"2026-05-18T03:05:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6901","created_at":"2026-05-18T03:05:54Z"},{"alias_kind":"pith_short_12","alias_value":"O3ANUYWQUR4K","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"O3ANUYWQUR4KSGA3","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"O3ANUYWQ","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:c2a067c9be174011fd59da81ba78767f08d8c25792299ca3e55aac78a2f6005e","target":"graph","created_at":"2026-05-18T03:05:54Z","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":"Our main result improves bounds of Markstrom and Rucinski on the minimum d-degree which forces a perfect matching in a k-uniform hypergraph on n vertices. We also extend bounds of Bollobas, Daykin and Erdos by asymptotically determining the minimum vertex degree which forces a matching of size t < n/2(k-1) in a k-uniform hypergraph on n vertices. Further asymptotically tight results on d-degrees which force large matchings are also obtained. Our approach is to prove fractional versions of the above results and then translate these into integer versions.","authors_text":"Daniela K\\\"uhn, Deryk Osthus, Timothy Townsend","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-25T13:15:22Z","title":"Fractional and integer matchings in uniform hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6901","kind":"arxiv","version":3},"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:436509da637667553d388ac0da5cbed6d15f5fb0c54120aab71a964cbd40ce2b","target":"record","created_at":"2026-05-18T03:05:54Z","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":"11a6866eb59227d3c429daf61003d7900ef1fdea6e910467296fb4277d8d94fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-25T13:15:22Z","title_canon_sha256":"830d1fe528e4ee855a9a237d33d0d6bb437f29c886a51f7f890d573eee43cb66"},"schema_version":"1.0","source":{"id":"1304.6901","kind":"arxiv","version":3}},"canonical_sha256":"76c0da62d0a478a9181bbc2ac1bd09f5b9e70824d973db74f9e797e1ef586962","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76c0da62d0a478a9181bbc2ac1bd09f5b9e70824d973db74f9e797e1ef586962","first_computed_at":"2026-05-18T03:05:54.648670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:54.648670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1kMTUXj93/g1gJFBNBfvlySgvFRPi71DMsLdRFQxhh1+sDeV7MhlbROXxaElxyMyIHMaDBp2vbG7cH0Fvf6SDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:54.649445Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.6901","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:436509da637667553d388ac0da5cbed6d15f5fb0c54120aab71a964cbd40ce2b","sha256:c2a067c9be174011fd59da81ba78767f08d8c25792299ca3e55aac78a2f6005e"],"state_sha256":"4c4e0f49605de369f26df320e34650edac630c02fce0b373cd57313404144c3b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XlbkIjgVyY3o8pPueuHAXiZUPvuvdtDfUIzFUl5+x7L+J1vNPn/c1x3dmlvhkxdlyMk5vG+tUVH7ulGHhbc4DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:42:26.224778Z","bundle_sha256":"0db946e68ef33cfe30d9f020287d5b0f6d5a23f3e67302de79587568f7d9e5bd"}}