{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TQ762R3BCHY6PGGV5O7QOKMICN","short_pith_number":"pith:TQ762R3B","canonical_record":{"source":{"id":"1705.00990","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-02T14:18:23Z","cross_cats_sorted":[],"title_canon_sha256":"f43081d14f6574d704474a776e48dd421c6750b3c7860e29f4f1d506680e5558","abstract_canon_sha256":"7f9fa5d1cd408dc8a3cadce1cfdd355e78cd91043f8d637cd9a0b680268b9a44"},"schema_version":"1.0"},"canonical_sha256":"9c3fed476111f1e798d5ebbf07298813674c6bf15837ff592a71ff48f1a4682f","source":{"kind":"arxiv","id":"1705.00990","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00990","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00990v2","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00990","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"pith_short_12","alias_value":"TQ762R3BCHY6","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TQ762R3BCHY6PGGV","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TQ762R3B","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TQ762R3BCHY6PGGV5O7QOKMICN","target":"record","payload":{"canonical_record":{"source":{"id":"1705.00990","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-02T14:18:23Z","cross_cats_sorted":[],"title_canon_sha256":"f43081d14f6574d704474a776e48dd421c6750b3c7860e29f4f1d506680e5558","abstract_canon_sha256":"7f9fa5d1cd408dc8a3cadce1cfdd355e78cd91043f8d637cd9a0b680268b9a44"},"schema_version":"1.0"},"canonical_sha256":"9c3fed476111f1e798d5ebbf07298813674c6bf15837ff592a71ff48f1a4682f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:08.972856Z","signature_b64":"rU5jCAMvbOjOs3Mv1yCXFOm3TJgLfYf36TXXbPGpNQO2Yj95w7vJe+FpGIxcXlsS3suySlSimJfnWTel4oSPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c3fed476111f1e798d5ebbf07298813674c6bf15837ff592a71ff48f1a4682f","last_reissued_at":"2026-05-18T00:23:08.972202Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:08.972202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.00990","source_version":2,"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-18T00:23:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s9sl4GjBWa+gfKyJzabSELZkUw+AKOcj5k8wQ7R03+44415Z9/TQIZa5JDrIgr4+w5OZloC2Ufnc2JV6ZurDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:10:36.839640Z"},"content_sha256":"d35c7ee3994f92a720d00afe4e842c7ac24e82670ba3f763f7ff848b26b4c13b","schema_version":"1.0","event_id":"sha256:d35c7ee3994f92a720d00afe4e842c7ac24e82670ba3f763f7ff848b26b4c13b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TQ762R3BCHY6PGGV5O7QOKMICN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Perfect Matchings and tilings in uniform Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Han","submitted_at":"2017-05-02T14:18:23Z","abstract_excerpt":"In this paper we study some variants of Dirac-type problems in hypergraphs. First, we show that for $k\\ge 3$, if $H$ is a $k$-graph on $n\\in k\\mathbb N$ vertices with independence number at most $n/p$ and minimum codegree at least $(1/p+o(1))n$, where $p$ is the smallest prime factor of $k$, then $H$ contains a perfect matching. Second, we show that if $H$ is a $3$-graph on $n\\in 3\\mathbb N$ vertices which does not contain any induced copy of $K_4^-$ (the unique $3$-graph with $4$ vertices and $3$ edges) and has minimum codegree at least $(1/3+o(1)))n$, then $H$ contains a perfect matching. Mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00990","kind":"arxiv","version":2},"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-18T00:23:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xjc94CaxxyK+rV7ReZxS1aU9MZ6X0XkvK4OvCzNDTiXSJSyxKpoIKtSoep/q/UEkETxQ8H7OlqxqWtaRfP18Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:10:36.839992Z"},"content_sha256":"aa50a2ef669f5a3853c23596dec34e9c4e91cd3b18b41ff126879367a2af8bb3","schema_version":"1.0","event_id":"sha256:aa50a2ef669f5a3853c23596dec34e9c4e91cd3b18b41ff126879367a2af8bb3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TQ762R3BCHY6PGGV5O7QOKMICN/bundle.json","state_url":"https://pith.science/pith/TQ762R3BCHY6PGGV5O7QOKMICN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TQ762R3BCHY6PGGV5O7QOKMICN/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-06-04T21:10:36Z","links":{"resolver":"https://pith.science/pith/TQ762R3BCHY6PGGV5O7QOKMICN","bundle":"https://pith.science/pith/TQ762R3BCHY6PGGV5O7QOKMICN/bundle.json","state":"https://pith.science/pith/TQ762R3BCHY6PGGV5O7QOKMICN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TQ762R3BCHY6PGGV5O7QOKMICN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TQ762R3BCHY6PGGV5O7QOKMICN","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":"7f9fa5d1cd408dc8a3cadce1cfdd355e78cd91043f8d637cd9a0b680268b9a44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-02T14:18:23Z","title_canon_sha256":"f43081d14f6574d704474a776e48dd421c6750b3c7860e29f4f1d506680e5558"},"schema_version":"1.0","source":{"id":"1705.00990","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00990","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00990v2","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00990","created_at":"2026-05-18T00:23:08Z"},{"alias_kind":"pith_short_12","alias_value":"TQ762R3BCHY6","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TQ762R3BCHY6PGGV","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TQ762R3B","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:aa50a2ef669f5a3853c23596dec34e9c4e91cd3b18b41ff126879367a2af8bb3","target":"graph","created_at":"2026-05-18T00:23:08Z","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":"In this paper we study some variants of Dirac-type problems in hypergraphs. First, we show that for $k\\ge 3$, if $H$ is a $k$-graph on $n\\in k\\mathbb N$ vertices with independence number at most $n/p$ and minimum codegree at least $(1/p+o(1))n$, where $p$ is the smallest prime factor of $k$, then $H$ contains a perfect matching. Second, we show that if $H$ is a $3$-graph on $n\\in 3\\mathbb N$ vertices which does not contain any induced copy of $K_4^-$ (the unique $3$-graph with $4$ vertices and $3$ edges) and has minimum codegree at least $(1/3+o(1)))n$, then $H$ contains a perfect matching. Mo","authors_text":"Jie Han","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-02T14:18:23Z","title":"On Perfect Matchings and tilings in uniform Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00990","kind":"arxiv","version":2},"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:d35c7ee3994f92a720d00afe4e842c7ac24e82670ba3f763f7ff848b26b4c13b","target":"record","created_at":"2026-05-18T00:23:08Z","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":"7f9fa5d1cd408dc8a3cadce1cfdd355e78cd91043f8d637cd9a0b680268b9a44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-02T14:18:23Z","title_canon_sha256":"f43081d14f6574d704474a776e48dd421c6750b3c7860e29f4f1d506680e5558"},"schema_version":"1.0","source":{"id":"1705.00990","kind":"arxiv","version":2}},"canonical_sha256":"9c3fed476111f1e798d5ebbf07298813674c6bf15837ff592a71ff48f1a4682f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c3fed476111f1e798d5ebbf07298813674c6bf15837ff592a71ff48f1a4682f","first_computed_at":"2026-05-18T00:23:08.972202Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:08.972202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rU5jCAMvbOjOs3Mv1yCXFOm3TJgLfYf36TXXbPGpNQO2Yj95w7vJe+FpGIxcXlsS3suySlSimJfnWTel4oSPBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:08.972856Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.00990","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d35c7ee3994f92a720d00afe4e842c7ac24e82670ba3f763f7ff848b26b4c13b","sha256:aa50a2ef669f5a3853c23596dec34e9c4e91cd3b18b41ff126879367a2af8bb3"],"state_sha256":"c20ebea1d2ce2f6c17e4642dd9fcb7088660624095a558ad20e71cdb23670246"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PRm3SaAKuxkTHwuHpnuYlLJnpYTyG7c/9dQB5tREYLS/De/TknmqY85Yy6J8wIg/jrOPVd4YdRVRjD8sVTcPCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:10:36.841903Z","bundle_sha256":"4fb355b0249af901db9c773817f9ba31ca10e7314ca7927911fc12e4a43e3ea0"}}