{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ASL5RG4KYVG2RHEQ2D3QZ2H3ZK","short_pith_number":"pith:ASL5RG4K","schema_version":"1.0","canonical_sha256":"0497d89b8ac54da89c90d0f70ce8fbca82461b17b4692dcfe56e1ee5ab6c37c5","source":{"kind":"arxiv","id":"2308.07195","version":2},"attestation_state":"computed","paper":{"title":"Counting spanning subgraphs in dense hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mat\\'ias Pavez-Sign\\'e, Richard Montgomery","submitted_at":"2023-08-14T15:05:02Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2308.07195","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-14T15:05:02Z","cross_cats_sorted":[],"title_canon_sha256":"d7dd37eb72a81297b3c7d2a6b868cf4dd27e4d8546e31f9323a08793565a491f","abstract_canon_sha256":"6a3f38e0bec697255d8ab6bdfd86d08d769f342e9216eb5bb54993c04f0e9a8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:37:32.433079Z","signature_b64":"8DMT43od10EYjIVcTx+RGvKLML1/E6hF07aDRvQAg14YBg9CKzV8sBcmB3Br11HUpjndGuTLs/rDyF9tJXo5CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0497d89b8ac54da89c90d0f70ce8fbca82461b17b4692dcfe56e1ee5ab6c37c5","last_reissued_at":"2026-07-05T09:37:32.432589Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:37:32.432589Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting spanning subgraphs in dense hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mat\\'ias Pavez-Sign\\'e, Richard Montgomery","submitted_at":"2023-08-14T15:05:02Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.07195","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.07195/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2308.07195","created_at":"2026-07-05T09:37:32.432657+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.07195v2","created_at":"2026-07-05T09:37:32.432657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.07195","created_at":"2026-07-05T09:37:32.432657+00:00"},{"alias_kind":"pith_short_12","alias_value":"ASL5RG4KYVG2","created_at":"2026-07-05T09:37:32.432657+00:00"},{"alias_kind":"pith_short_16","alias_value":"ASL5RG4KYVG2RHEQ","created_at":"2026-07-05T09:37:32.432657+00:00"},{"alias_kind":"pith_short_8","alias_value":"ASL5RG4K","created_at":"2026-07-05T09:37:32.432657+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2309.12607","citing_title":"Robust Hamiltonicity in families of Dirac graphs","ref_index":42,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ASL5RG4KYVG2RHEQ2D3QZ2H3ZK","json":"https://pith.science/pith/ASL5RG4KYVG2RHEQ2D3QZ2H3ZK.json","graph_json":"https://pith.science/api/pith-number/ASL5RG4KYVG2RHEQ2D3QZ2H3ZK/graph.json","events_json":"https://pith.science/api/pith-number/ASL5RG4KYVG2RHEQ2D3QZ2H3ZK/events.json","paper":"https://pith.science/paper/ASL5RG4K"},"agent_actions":{"view_html":"https://pith.science/pith/ASL5RG4KYVG2RHEQ2D3QZ2H3ZK","download_json":"https://pith.science/pith/ASL5RG4KYVG2RHEQ2D3QZ2H3ZK.json","view_paper":"https://pith.science/paper/ASL5RG4K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.07195&json=true","fetch_graph":"https://pith.science/api/pith-number/ASL5RG4KYVG2RHEQ2D3QZ2H3ZK/graph.json","fetch_events":"https://pith.science/api/pith-number/ASL5RG4KYVG2RHEQ2D3QZ2H3ZK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ASL5RG4KYVG2RHEQ2D3QZ2H3ZK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ASL5RG4KYVG2RHEQ2D3QZ2H3ZK/action/storage_attestation","attest_author":"https://pith.science/pith/ASL5RG4KYVG2RHEQ2D3QZ2H3ZK/action/author_attestation","sign_citation":"https://pith.science/pith/ASL5RG4KYVG2RHEQ2D3QZ2H3ZK/action/citation_signature","submit_replication":"https://pith.science/pith/ASL5RG4KYVG2RHEQ2D3QZ2H3ZK/action/replication_record"}},"created_at":"2026-07-05T09:37:32.432657+00:00","updated_at":"2026-07-05T09:37:32.432657+00:00"}