{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ASL5RG4KYVG2RHEQ2D3QZ2H3ZK","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":"6a3f38e0bec697255d8ab6bdfd86d08d769f342e9216eb5bb54993c04f0e9a8f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-14T15:05:02Z","title_canon_sha256":"d7dd37eb72a81297b3c7d2a6b868cf4dd27e4d8546e31f9323a08793565a491f"},"schema_version":"1.0","source":{"id":"2308.07195","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.07195","created_at":"2026-07-05T09:37:32Z"},{"alias_kind":"arxiv_version","alias_value":"2308.07195v2","created_at":"2026-07-05T09:37:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.07195","created_at":"2026-07-05T09:37:32Z"},{"alias_kind":"pith_short_12","alias_value":"ASL5RG4KYVG2","created_at":"2026-07-05T09:37:32Z"},{"alias_kind":"pith_short_16","alias_value":"ASL5RG4KYVG2RHEQ","created_at":"2026-07-05T09:37:32Z"},{"alias_kind":"pith_short_8","alias_value":"ASL5RG4K","created_at":"2026-07-05T09:37:32Z"}],"graph_snapshots":[{"event_id":"sha256:6c639ae9cd328b9d589b8118025e329ac95a8a1c3cd7ce8456938706b07c1399","target":"graph","created_at":"2026-07-05T09:37:32Z","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/2308.07195/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give a simple method to estimate the number of distinct copies of some classes of spanning subgraphs in hypergraphs with high minimum degree. In particular, for each $k\\geq 2$ and $1\\leq \\ell\\leq k-1$, we show that every $k$-graph on $n$ vertices with minimum codegree at least\n  $$\\cases{\\left(\\dfrac{1}{2}+o(1)\\right)n & if $(k-\\ell)\\mid k$,\\\\ & \\\\ \\left(\\dfrac{1}{\\lceil \\frac{k}{k-\\ell}\\rceil(k-\\ell)}+o(1)\\right)n & if $(k-\\ell)\\nmid k$,}$$\n  contains $\\exp(n\\log n-\\Theta(n))$ Hamilton $\\ell$-cycles as long as $(k-\\ell)\\mid n$. When $(k-\\ell)\\mid k$ this gives a simple proof of a result of","authors_text":"Mat\\'ias Pavez-Sign\\'e, Richard Montgomery","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-14T15:05:02Z","title":"Counting spanning subgraphs in dense hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.07195","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:0012efbdd1139f19922820bc70338fcca45d31b2f428df7d893ff4130797b20e","target":"record","created_at":"2026-07-05T09:37:32Z","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":"6a3f38e0bec697255d8ab6bdfd86d08d769f342e9216eb5bb54993c04f0e9a8f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-14T15:05:02Z","title_canon_sha256":"d7dd37eb72a81297b3c7d2a6b868cf4dd27e4d8546e31f9323a08793565a491f"},"schema_version":"1.0","source":{"id":"2308.07195","kind":"arxiv","version":2}},"canonical_sha256":"0497d89b8ac54da89c90d0f70ce8fbca82461b17b4692dcfe56e1ee5ab6c37c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0497d89b8ac54da89c90d0f70ce8fbca82461b17b4692dcfe56e1ee5ab6c37c5","first_computed_at":"2026-07-05T09:37:32.432589Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:37:32.432589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8DMT43od10EYjIVcTx+RGvKLML1/E6hF07aDRvQAg14YBg9CKzV8sBcmB3Br11HUpjndGuTLs/rDyF9tJXo5CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:37:32.433079Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.07195","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0012efbdd1139f19922820bc70338fcca45d31b2f428df7d893ff4130797b20e","sha256:6c639ae9cd328b9d589b8118025e329ac95a8a1c3cd7ce8456938706b07c1399"],"state_sha256":"8fa6ebf53c8bc8f68bb6535e40a19bedaea89e8a003e4ba8b641fff8c6a1523e"}