{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3IZFVOFYCIF22P3ULLDMOT5Z3X","short_pith_number":"pith:3IZFVOFY","canonical_record":{"source":{"id":"1309.6772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-26T09:36:19Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"260fb23d84c0a8fdf51dd8adedd63edb61d0f92e271b37fc92962f0a17bd655a","abstract_canon_sha256":"b91425d1e31ef9b358800930b6a3f84c8bbf447e4120a2a9190515dc1a8c3a7c"},"schema_version":"1.0"},"canonical_sha256":"da325ab8b8120bad3f745ac6c74fb9ddf909faac738c29ed683fd5eb45766c7e","source":{"kind":"arxiv","id":"1309.6772","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6772","created_at":"2026-05-17T23:53:15Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6772v1","created_at":"2026-05-17T23:53:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6772","created_at":"2026-05-17T23:53:15Z"},{"alias_kind":"pith_short_12","alias_value":"3IZFVOFYCIF2","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3IZFVOFYCIF22P3U","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3IZFVOFY","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3IZFVOFYCIF22P3ULLDMOT5Z3X","target":"record","payload":{"canonical_record":{"source":{"id":"1309.6772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-26T09:36:19Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"260fb23d84c0a8fdf51dd8adedd63edb61d0f92e271b37fc92962f0a17bd655a","abstract_canon_sha256":"b91425d1e31ef9b358800930b6a3f84c8bbf447e4120a2a9190515dc1a8c3a7c"},"schema_version":"1.0"},"canonical_sha256":"da325ab8b8120bad3f745ac6c74fb9ddf909faac738c29ed683fd5eb45766c7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:15.078359Z","signature_b64":"mfaN600d6CzAmY4I4sT6HjjkGQ4qmJchPvn63lEAKJ2xSIwUzWYrZ/Imi8VuuqV8ondJzYqSz4C4avJfDRgKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da325ab8b8120bad3f745ac6c74fb9ddf909faac738c29ed683fd5eb45766c7e","last_reissued_at":"2026-05-17T23:53:15.077811Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:15.077811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.6772","source_version":1,"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-17T23:53:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xoARlrdcyuMNsJiYe3GAzj0INgHmSKVvM7c/19V4ZmXdxRrzaji2YYVKhR9jl76p4REI84ie2AfIhbpboWU0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T16:11:30.210966Z"},"content_sha256":"36a238a50840520d895ba09b0543c580f0e4a8219b0fb01baf66b20c5fee59c5","schema_version":"1.0","event_id":"sha256:36a238a50840520d895ba09b0543c580f0e4a8219b0fb01baf66b20c5fee59c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3IZFVOFYCIF22P3ULLDMOT5Z3X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Multiple-orientability Thresholds for Random Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Konstantinos Panagiotou, Megha Khosla, Nikolaos Fountoulakis","submitted_at":"2013-09-26T09:36:19Z","abstract_excerpt":"A $k$-uniform hypergraph $H = (V, E)$ is called $\\ell$-orientable, if there is an assignment of each edge $e\\in E$ to one of its vertices $v\\in e$ such that no vertex is assigned more than $\\ell$ edges. Let $H_{n,m,k}$ be a hypergraph, drawn uniformly at random from the set of all $k$-uniform hypergraphs with $n$ vertices and $m$ edges. In this paper we establish the threshold for the $\\ell$-orientability of $H_{n,m,k}$ for all $k\\ge 3$ and $\\ell \\ge 2$, i.e., we determine a critical quantity $c_{k, \\ell}^*$ such that with probability $1-o(1)$ the graph $H_{n,cn,k}$ has an $\\ell$-orientation i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6772","kind":"arxiv","version":1},"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-17T23:53:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zCGGKFdEwoP2ISeDcmbp7H4QTKVjeXqMX/5bUowt6HKVTRNmQMrsUlzENzAjFWZOQk4deJIhsfZ+cLsf9tmfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T16:11:30.211327Z"},"content_sha256":"466bd20cbb672561def0d944a65674b741d5d362b2f90fa3e8fe6a779dbbf1e8","schema_version":"1.0","event_id":"sha256:466bd20cbb672561def0d944a65674b741d5d362b2f90fa3e8fe6a779dbbf1e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3IZFVOFYCIF22P3ULLDMOT5Z3X/bundle.json","state_url":"https://pith.science/pith/3IZFVOFYCIF22P3ULLDMOT5Z3X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3IZFVOFYCIF22P3ULLDMOT5Z3X/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-24T16:11:30Z","links":{"resolver":"https://pith.science/pith/3IZFVOFYCIF22P3ULLDMOT5Z3X","bundle":"https://pith.science/pith/3IZFVOFYCIF22P3ULLDMOT5Z3X/bundle.json","state":"https://pith.science/pith/3IZFVOFYCIF22P3ULLDMOT5Z3X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3IZFVOFYCIF22P3ULLDMOT5Z3X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3IZFVOFYCIF22P3ULLDMOT5Z3X","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":"b91425d1e31ef9b358800930b6a3f84c8bbf447e4120a2a9190515dc1a8c3a7c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-26T09:36:19Z","title_canon_sha256":"260fb23d84c0a8fdf51dd8adedd63edb61d0f92e271b37fc92962f0a17bd655a"},"schema_version":"1.0","source":{"id":"1309.6772","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6772","created_at":"2026-05-17T23:53:15Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6772v1","created_at":"2026-05-17T23:53:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6772","created_at":"2026-05-17T23:53:15Z"},{"alias_kind":"pith_short_12","alias_value":"3IZFVOFYCIF2","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3IZFVOFYCIF22P3U","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3IZFVOFY","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:466bd20cbb672561def0d944a65674b741d5d362b2f90fa3e8fe6a779dbbf1e8","target":"graph","created_at":"2026-05-17T23:53:15Z","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":"A $k$-uniform hypergraph $H = (V, E)$ is called $\\ell$-orientable, if there is an assignment of each edge $e\\in E$ to one of its vertices $v\\in e$ such that no vertex is assigned more than $\\ell$ edges. Let $H_{n,m,k}$ be a hypergraph, drawn uniformly at random from the set of all $k$-uniform hypergraphs with $n$ vertices and $m$ edges. In this paper we establish the threshold for the $\\ell$-orientability of $H_{n,m,k}$ for all $k\\ge 3$ and $\\ell \\ge 2$, i.e., we determine a critical quantity $c_{k, \\ell}^*$ such that with probability $1-o(1)$ the graph $H_{n,cn,k}$ has an $\\ell$-orientation i","authors_text":"Konstantinos Panagiotou, Megha Khosla, Nikolaos Fountoulakis","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-26T09:36:19Z","title":"The Multiple-orientability Thresholds for Random Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6772","kind":"arxiv","version":1},"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:36a238a50840520d895ba09b0543c580f0e4a8219b0fb01baf66b20c5fee59c5","target":"record","created_at":"2026-05-17T23:53:15Z","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":"b91425d1e31ef9b358800930b6a3f84c8bbf447e4120a2a9190515dc1a8c3a7c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-26T09:36:19Z","title_canon_sha256":"260fb23d84c0a8fdf51dd8adedd63edb61d0f92e271b37fc92962f0a17bd655a"},"schema_version":"1.0","source":{"id":"1309.6772","kind":"arxiv","version":1}},"canonical_sha256":"da325ab8b8120bad3f745ac6c74fb9ddf909faac738c29ed683fd5eb45766c7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da325ab8b8120bad3f745ac6c74fb9ddf909faac738c29ed683fd5eb45766c7e","first_computed_at":"2026-05-17T23:53:15.077811Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:15.077811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mfaN600d6CzAmY4I4sT6HjjkGQ4qmJchPvn63lEAKJ2xSIwUzWYrZ/Imi8VuuqV8ondJzYqSz4C4avJfDRgKBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:15.078359Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6772","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36a238a50840520d895ba09b0543c580f0e4a8219b0fb01baf66b20c5fee59c5","sha256:466bd20cbb672561def0d944a65674b741d5d362b2f90fa3e8fe6a779dbbf1e8"],"state_sha256":"f0fd90653b6139c05958b7bdb44e118949ecf2f9f46505f79732a8030eb048e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EuHli89NAE+QXGO6AwMqoLRsWil+loPT4gQFPqQF8okSEWTwz8O2TI8DJxGvy8KSP9V+38P36xE9mqxfqwUPCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T16:11:30.213268Z","bundle_sha256":"ec33eef74b6732c231d8c4ad2c33ca69ed2ca4b5263e49abba2d099daecc50d7"}}