{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7GQB2WIK5FUEKOVDJX6GHCMPJQ","short_pith_number":"pith:7GQB2WIK","canonical_record":{"source":{"id":"1507.02362","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-09T03:41:18Z","cross_cats_sorted":[],"title_canon_sha256":"d761939832e6ce2db8c0e0a07be956c4c53eb26a9b2e40fd0f6cb93febd9110a","abstract_canon_sha256":"a9ae997b9dad4e58d68cfbc5fb25dc8abef1e2f7c8879f2bf379566d7d3f7fe7"},"schema_version":"1.0"},"canonical_sha256":"f9a01d590ae968453aa34dfc63898f4c15b76422345abed6484bf66ccfd7b4f1","source":{"kind":"arxiv","id":"1507.02362","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02362","created_at":"2026-05-18T01:00:46Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02362v2","created_at":"2026-05-18T01:00:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02362","created_at":"2026-05-18T01:00:46Z"},{"alias_kind":"pith_short_12","alias_value":"7GQB2WIK5FUE","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7GQB2WIK5FUEKOVD","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7GQB2WIK","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7GQB2WIK5FUEKOVDJX6GHCMPJQ","target":"record","payload":{"canonical_record":{"source":{"id":"1507.02362","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-09T03:41:18Z","cross_cats_sorted":[],"title_canon_sha256":"d761939832e6ce2db8c0e0a07be956c4c53eb26a9b2e40fd0f6cb93febd9110a","abstract_canon_sha256":"a9ae997b9dad4e58d68cfbc5fb25dc8abef1e2f7c8879f2bf379566d7d3f7fe7"},"schema_version":"1.0"},"canonical_sha256":"f9a01d590ae968453aa34dfc63898f4c15b76422345abed6484bf66ccfd7b4f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:46.247682Z","signature_b64":"PTdiALZ1DRnYMc5nn9NucCMHI1QGAkVUWLgixniACLPgXUn3jOmvODvZuSif+dL3bconvobT1jQsgQm1sRUwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9a01d590ae968453aa34dfc63898f4c15b76422345abed6484bf66ccfd7b4f1","last_reissued_at":"2026-05-18T01:00:46.247243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:46.247243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.02362","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-18T01:00:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yBATm2Z+EKZVOu3AiYQDhpuxqdyDniJ0Vf5K4DQOkr56D3ru/G7fOgDzZow9x/ilKWVFg8FD/oGNXQQ+9KCMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:32:56.529795Z"},"content_sha256":"1635490de728cfe48cb65b0007d3770266f794ba9e278605c3db99171efe8dc6","schema_version":"1.0","event_id":"sha256:1635490de728cfe48cb65b0007d3770266f794ba9e278605c3db99171efe8dc6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7GQB2WIK5FUEKOVDJX6GHCMPJQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near Perfect Matchings in $k$-uniform Hypergraphs II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Han","submitted_at":"2015-07-09T03:41:18Z","abstract_excerpt":"Suppose $k\\nmid n$ and $H$ is an $n$-vertex $k$-uniform hypergraph. A near perfect matching in $H$ is a matching of size $\\lfloor n/k\\rfloor$. We give a divisibility barrier construction that prevents the existence of near perfect matchings in $H$. This generalizes the divisibility barrier for perfect matchings. We give a conjecture on the minimum $d$-degree threshold forcing a (near) perfect matching in $H$ which generalizes a well-known conjecture on perfect matchings. We also verify our conjecture in various cases. Our proof makes use of the lattice-based absorbing method that the author us"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02362","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-18T01:00:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cghf5HWrGi7zHp2W91gTF3v+/jVngWiBSrAqdfMgTRJx17DZeVjL2rgnUlHdwyMqIotGwJQPZ+ZgLo74Q3ELDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:32:56.530151Z"},"content_sha256":"a07cdee2ef8b448e0dcb4098a38b1093bdba1a0812979d551468052715950ca7","schema_version":"1.0","event_id":"sha256:a07cdee2ef8b448e0dcb4098a38b1093bdba1a0812979d551468052715950ca7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7GQB2WIK5FUEKOVDJX6GHCMPJQ/bundle.json","state_url":"https://pith.science/pith/7GQB2WIK5FUEKOVDJX6GHCMPJQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7GQB2WIK5FUEKOVDJX6GHCMPJQ/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-04T15:32:56Z","links":{"resolver":"https://pith.science/pith/7GQB2WIK5FUEKOVDJX6GHCMPJQ","bundle":"https://pith.science/pith/7GQB2WIK5FUEKOVDJX6GHCMPJQ/bundle.json","state":"https://pith.science/pith/7GQB2WIK5FUEKOVDJX6GHCMPJQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7GQB2WIK5FUEKOVDJX6GHCMPJQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7GQB2WIK5FUEKOVDJX6GHCMPJQ","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":"a9ae997b9dad4e58d68cfbc5fb25dc8abef1e2f7c8879f2bf379566d7d3f7fe7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-09T03:41:18Z","title_canon_sha256":"d761939832e6ce2db8c0e0a07be956c4c53eb26a9b2e40fd0f6cb93febd9110a"},"schema_version":"1.0","source":{"id":"1507.02362","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02362","created_at":"2026-05-18T01:00:46Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02362v2","created_at":"2026-05-18T01:00:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02362","created_at":"2026-05-18T01:00:46Z"},{"alias_kind":"pith_short_12","alias_value":"7GQB2WIK5FUE","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7GQB2WIK5FUEKOVD","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7GQB2WIK","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:a07cdee2ef8b448e0dcb4098a38b1093bdba1a0812979d551468052715950ca7","target":"graph","created_at":"2026-05-18T01:00:46Z","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":"Suppose $k\\nmid n$ and $H$ is an $n$-vertex $k$-uniform hypergraph. A near perfect matching in $H$ is a matching of size $\\lfloor n/k\\rfloor$. We give a divisibility barrier construction that prevents the existence of near perfect matchings in $H$. This generalizes the divisibility barrier for perfect matchings. We give a conjecture on the minimum $d$-degree threshold forcing a (near) perfect matching in $H$ which generalizes a well-known conjecture on perfect matchings. We also verify our conjecture in various cases. Our proof makes use of the lattice-based absorbing method that the author us","authors_text":"Jie Han","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-09T03:41:18Z","title":"Near Perfect Matchings in $k$-uniform Hypergraphs II"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02362","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:1635490de728cfe48cb65b0007d3770266f794ba9e278605c3db99171efe8dc6","target":"record","created_at":"2026-05-18T01:00:46Z","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":"a9ae997b9dad4e58d68cfbc5fb25dc8abef1e2f7c8879f2bf379566d7d3f7fe7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-09T03:41:18Z","title_canon_sha256":"d761939832e6ce2db8c0e0a07be956c4c53eb26a9b2e40fd0f6cb93febd9110a"},"schema_version":"1.0","source":{"id":"1507.02362","kind":"arxiv","version":2}},"canonical_sha256":"f9a01d590ae968453aa34dfc63898f4c15b76422345abed6484bf66ccfd7b4f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9a01d590ae968453aa34dfc63898f4c15b76422345abed6484bf66ccfd7b4f1","first_computed_at":"2026-05-18T01:00:46.247243Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:46.247243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PTdiALZ1DRnYMc5nn9NucCMHI1QGAkVUWLgixniACLPgXUn3jOmvODvZuSif+dL3bconvobT1jQsgQm1sRUwCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:46.247682Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02362","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1635490de728cfe48cb65b0007d3770266f794ba9e278605c3db99171efe8dc6","sha256:a07cdee2ef8b448e0dcb4098a38b1093bdba1a0812979d551468052715950ca7"],"state_sha256":"39a371142599612d7acfee9355c86266ea888860b82d775016e2aae06dadadbd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OnIwbqHWOQg62TnSn999k8vNp6sitvI2sPJnRrUJe9zjeoWCo2qzTcBb/swaZk1JobrgUyngrZMbkPz0iScmCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:32:56.532546Z","bundle_sha256":"5c815e2a1f177155c3f1329fd4c2adb2d113bacd908a43a59f9b580b35dd6ca7"}}