{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:263BY2AJK6A2AOS77MXC6HCYOV","short_pith_number":"pith:263BY2AJ","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"},"canonical_sha256":"d7b61c68095781a03a5ffb2e2f1c58756b7049965591083f02cbb94fa5f9583f","source":{"kind":"arxiv","id":"1306.2012","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2012","created_at":"2026-05-18T01:37:05Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2012v3","created_at":"2026-05-18T01:37:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2012","created_at":"2026-05-18T01:37:05Z"},{"alias_kind":"pith_short_12","alias_value":"263BY2AJK6A2","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"263BY2AJK6A2AOS7","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"263BY2AJ","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:263BY2AJK6A2AOS77MXC6HCYOV","target":"record","payload":{"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"},"canonical_sha256":"d7b61c68095781a03a5ffb2e2f1c58756b7049965591083f02cbb94fa5f9583f","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"},"source_kind":"arxiv","source_id":"1306.2012","source_version":3,"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:37:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dyF/IjkxERQMKwy0utKKjVAXlMZ4weum7h+gxvDqDA13dsGDOdGhCShAZBUSVXbpLj2op0rYj5QYUFYGtBpDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:57:52.168288Z"},"content_sha256":"9d05606df72dbecc34c48385d4134f03bf3ba951a177e7146b98f2f60a901c4f","schema_version":"1.0","event_id":"sha256:9d05606df72dbecc34c48385d4134f03bf3ba951a177e7146b98f2f60a901c4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:263BY2AJK6A2AOS77MXC6HCYOV","target":"graph","payload":{"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"},"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:37:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jq8k6Pd0fbnjXwdMd9tu828hqVmJey0C21NZdR+S4Nr/19gxW8KRgmAwsYuQcEh9/PI6V3tw1/fMSn26as5SAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:57:52.169022Z"},"content_sha256":"b2e96f4c366f03c6d5439f17234c3a1520c04991ab7e894e1dd4e25bd82f5859","schema_version":"1.0","event_id":"sha256:b2e96f4c366f03c6d5439f17234c3a1520c04991ab7e894e1dd4e25bd82f5859"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/263BY2AJK6A2AOS77MXC6HCYOV/bundle.json","state_url":"https://pith.science/pith/263BY2AJK6A2AOS77MXC6HCYOV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/263BY2AJK6A2AOS77MXC6HCYOV/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-08T20:57:52Z","links":{"resolver":"https://pith.science/pith/263BY2AJK6A2AOS77MXC6HCYOV","bundle":"https://pith.science/pith/263BY2AJK6A2AOS77MXC6HCYOV/bundle.json","state":"https://pith.science/pith/263BY2AJK6A2AOS77MXC6HCYOV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/263BY2AJK6A2AOS77MXC6HCYOV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:263BY2AJK6A2AOS77MXC6HCYOV","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":"72969ca9f8459498708b814b3bbd7b400c213e6b06c97b817183e773221e7c2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-09T12:33:03Z","title_canon_sha256":"e7d2360328e39dd2a188a27a86edb758a5ea60cd2ea52a3af5419b5468da72f0"},"schema_version":"1.0","source":{"id":"1306.2012","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2012","created_at":"2026-05-18T01:37:05Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2012v3","created_at":"2026-05-18T01:37:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2012","created_at":"2026-05-18T01:37:05Z"},{"alias_kind":"pith_short_12","alias_value":"263BY2AJK6A2","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"263BY2AJK6A2AOS7","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"263BY2AJ","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:b2e96f4c366f03c6d5439f17234c3a1520c04991ab7e894e1dd4e25bd82f5859","target":"graph","created_at":"2026-05-18T01:37:05Z","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":"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)$.","authors_text":"Catherine Greenhill, Vladimir Blinovsky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-09T12:33:03Z","title":"Asymptotic enumeration of sparse uniform hypergraphs with given degrees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2012","kind":"arxiv","version":3},"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:9d05606df72dbecc34c48385d4134f03bf3ba951a177e7146b98f2f60a901c4f","target":"record","created_at":"2026-05-18T01:37:05Z","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":"72969ca9f8459498708b814b3bbd7b400c213e6b06c97b817183e773221e7c2b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-09T12:33:03Z","title_canon_sha256":"e7d2360328e39dd2a188a27a86edb758a5ea60cd2ea52a3af5419b5468da72f0"},"schema_version":"1.0","source":{"id":"1306.2012","kind":"arxiv","version":3}},"canonical_sha256":"d7b61c68095781a03a5ffb2e2f1c58756b7049965591083f02cbb94fa5f9583f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7b61c68095781a03a5ffb2e2f1c58756b7049965591083f02cbb94fa5f9583f","first_computed_at":"2026-05-18T01:37:05.951027Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:05.951027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u5Axf0rR4MW6pmjze+BM7X/9W31nOravUJBHN7Ed99GKVGtwiMnxNHZT8cdgIypaYov1Y0NNn6/M0+xiWuFFDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:05.951568Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.2012","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d05606df72dbecc34c48385d4134f03bf3ba951a177e7146b98f2f60a901c4f","sha256:b2e96f4c366f03c6d5439f17234c3a1520c04991ab7e894e1dd4e25bd82f5859"],"state_sha256":"ee9ed7d76a2fce77096dc9f2d408b39e422df44b017b389b5a0e1b0faafc63a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"78Urxstli5rwE2xkr8duqb5Wwsit5qSKHjlQxorLtH3kv7IZXOoP1FlRAqg+N8bzk+E2PPTbP7N18oWbymVICA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:57:52.173369Z","bundle_sha256":"ec1fec07e4a1c7cb958d8a8963ab4e39c894a3afafe8a82c009b514681cfea0b"}}