{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:263BY2AJK6A2AOS77MXC6HCYOV","short_pith_number":"pith:263BY2AJ","schema_version":"1.0","canonical_sha256":"d7b61c68095781a03a5ffb2e2f1c58756b7049965591083f02cbb94fa5f9583f","source":{"kind":"arxiv","id":"1306.2012","version":3},"attestation_state":"computed","paper":{"title":"Asymptotic enumeration of sparse uniform hypergraphs with given degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Catherine Greenhill, Vladimir Blinovsky","submitted_at":"2013-06-09T12:33:03Z","abstract_excerpt":"Let $r \\geq 2$ be a fixed integer. For infinitely many $n$, let $\\boldsymbol{k} = (k_1,..., k_n)$ be a vector of nonnegative integers such that their sum $M$ is divisible by $r$. We present an asymptotic enumeration formula for simple $r$-uniform hypergraphs with degree sequence $k$. (Here \"simple\" means that all edges are distinct and no edge contains a repeated vertex.) Our formula holds whenever the maximum degree $k_{\\mathrm{max}}$ satisfies $k_{\\mathrm{max}}^3 = o(M)$."},"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":"1306.2012","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-09T12:33:03Z","cross_cats_sorted":[],"title_canon_sha256":"e7d2360328e39dd2a188a27a86edb758a5ea60cd2ea52a3af5419b5468da72f0","abstract_canon_sha256":"72969ca9f8459498708b814b3bbd7b400c213e6b06c97b817183e773221e7c2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:05.951568Z","signature_b64":"u5Axf0rR4MW6pmjze+BM7X/9W31nOravUJBHN7Ed99GKVGtwiMnxNHZT8cdgIypaYov1Y0NNn6/M0+xiWuFFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7b61c68095781a03a5ffb2e2f1c58756b7049965591083f02cbb94fa5f9583f","last_reissued_at":"2026-05-18T01:37:05.951027Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:05.951027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic enumeration of sparse uniform hypergraphs with given degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Catherine Greenhill, Vladimir Blinovsky","submitted_at":"2013-06-09T12:33:03Z","abstract_excerpt":"Let $r \\geq 2$ be a fixed integer. For infinitely many $n$, let $\\boldsymbol{k} = (k_1,..., k_n)$ be a vector of nonnegative integers such that their sum $M$ is divisible by $r$. We present an asymptotic enumeration formula for simple $r$-uniform hypergraphs with degree sequence $k$. (Here \"simple\" means that all edges are distinct and no edge contains a repeated vertex.) Our formula holds whenever the maximum degree $k_{\\mathrm{max}}$ satisfies $k_{\\mathrm{max}}^3 = o(M)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2012","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.2012","created_at":"2026-05-18T01:37:05.951098+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.2012v3","created_at":"2026-05-18T01:37:05.951098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2012","created_at":"2026-05-18T01:37:05.951098+00:00"},{"alias_kind":"pith_short_12","alias_value":"263BY2AJK6A2","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"263BY2AJK6A2AOS7","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"263BY2AJ","created_at":"2026-05-18T12:27:30.460161+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/263BY2AJK6A2AOS77MXC6HCYOV","json":"https://pith.science/pith/263BY2AJK6A2AOS77MXC6HCYOV.json","graph_json":"https://pith.science/api/pith-number/263BY2AJK6A2AOS77MXC6HCYOV/graph.json","events_json":"https://pith.science/api/pith-number/263BY2AJK6A2AOS77MXC6HCYOV/events.json","paper":"https://pith.science/paper/263BY2AJ"},"agent_actions":{"view_html":"https://pith.science/pith/263BY2AJK6A2AOS77MXC6HCYOV","download_json":"https://pith.science/pith/263BY2AJK6A2AOS77MXC6HCYOV.json","view_paper":"https://pith.science/paper/263BY2AJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.2012&json=true","fetch_graph":"https://pith.science/api/pith-number/263BY2AJK6A2AOS77MXC6HCYOV/graph.json","fetch_events":"https://pith.science/api/pith-number/263BY2AJK6A2AOS77MXC6HCYOV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/263BY2AJK6A2AOS77MXC6HCYOV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/263BY2AJK6A2AOS77MXC6HCYOV/action/storage_attestation","attest_author":"https://pith.science/pith/263BY2AJK6A2AOS77MXC6HCYOV/action/author_attestation","sign_citation":"https://pith.science/pith/263BY2AJK6A2AOS77MXC6HCYOV/action/citation_signature","submit_replication":"https://pith.science/pith/263BY2AJK6A2AOS77MXC6HCYOV/action/replication_record"}},"created_at":"2026-05-18T01:37:05.951098+00:00","updated_at":"2026-05-18T01:37:05.951098+00:00"}