{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:6CMBPPXOPHXRUJWBSAK4TXG5QA","short_pith_number":"pith:6CMBPPXO","canonical_record":{"source":{"id":"0803.3406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-03-24T14:19:04Z","cross_cats_sorted":[],"title_canon_sha256":"b461c5e4963d9c0ea6e124c1d91ad4c901182971332deac2e28218d3e79aed8b","abstract_canon_sha256":"ee58b2aa1112d41d83b6942b38391ccb87b55ac863e04fea2a097de80a489755"},"schema_version":"1.0"},"canonical_sha256":"f09817beee79ef1a26c19015c9dcdd80310b0a39eaf0eeff27508a0671301973","source":{"kind":"arxiv","id":"0803.3406","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0803.3406","created_at":"2026-07-04T15:10:23Z"},{"alias_kind":"arxiv_version","alias_value":"0803.3406v1","created_at":"2026-07-04T15:10:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0803.3406","created_at":"2026-07-04T15:10:23Z"},{"alias_kind":"pith_short_12","alias_value":"6CMBPPXOPHXR","created_at":"2026-07-04T15:10:23Z"},{"alias_kind":"pith_short_16","alias_value":"6CMBPPXOPHXRUJWB","created_at":"2026-07-04T15:10:23Z"},{"alias_kind":"pith_short_8","alias_value":"6CMBPPXO","created_at":"2026-07-04T15:10:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:6CMBPPXOPHXRUJWBSAK4TXG5QA","target":"record","payload":{"canonical_record":{"source":{"id":"0803.3406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-03-24T14:19:04Z","cross_cats_sorted":[],"title_canon_sha256":"b461c5e4963d9c0ea6e124c1d91ad4c901182971332deac2e28218d3e79aed8b","abstract_canon_sha256":"ee58b2aa1112d41d83b6942b38391ccb87b55ac863e04fea2a097de80a489755"},"schema_version":"1.0"},"canonical_sha256":"f09817beee79ef1a26c19015c9dcdd80310b0a39eaf0eeff27508a0671301973","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:10:23.074260Z","signature_b64":"UwnyFku+B18GOrU8FvRiNbIa3ir2sUkBfp7u/XKIt0HAYyvDDvOskVE0JDJvhZcXVUHR9lzSmBeAL/hsVJ13CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f09817beee79ef1a26c19015c9dcdd80310b0a39eaf0eeff27508a0671301973","last_reissued_at":"2026-07-04T15:10:23.073914Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:10:23.073914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0803.3406","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-07-04T15:10:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VtFZqtvBKErOUaPRp0H1O/jgmvRJNmfOcbt+AZRhJIFtB2dC5lvb01fqNJhFlAS4GGHr9D/RsUO+SRytHbuTDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T00:12:44.585607Z"},"content_sha256":"f550eb440c4e7f87aa7ca298b8a371973cab7509200e1e108b96f017d6bfe4a3","schema_version":"1.0","event_id":"sha256:f550eb440c4e7f87aa7ca298b8a371973cab7509200e1e108b96f017d6bfe4a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:6CMBPPXOPHXRUJWBSAK4TXG5QA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Factors in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Johansson, J. Kahn, V. Vu","submitted_at":"2008-03-24T14:19:04Z","abstract_excerpt":"Let $H$ be a fixed graph on $v$ vertices. For an $n$-vertex graph $G$ with $n$ divisible by $v$, an $H$-{\\em factor} of $G$ is a collection of $n/v$ copies of $H$ whose vertex sets partition $V(G)$.\n  In this paper we consider the threshold $th_{H} (n)$ of the property that an Erd\\H{o}s-R\\'enyi random graph (on $n$ points) contains an $H$-factor. Our results determine $th_{H} (n)$ for all strictly balanced $H$.\n  The method here extends with no difficulty to hypergraphs. As a corollary, we obtain the threshold for a perfect matching in random $k$-uniform hypergraph, solving the well-known \"Sha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0803.3406","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0803.3406/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"},"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-07-04T15:10:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sfL7aSQx3QwEVzhfeb9nDSa1Ropfj8E31GI2uvGWuStujcwrRVmO9YXJhpiFhVpunCdVF2LOkoI3cgmtC0MrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T00:12:44.586096Z"},"content_sha256":"165c7bdbf2cf87351dac07c21393a1939e803e48da26b7ce779b755f34cebe37","schema_version":"1.0","event_id":"sha256:165c7bdbf2cf87351dac07c21393a1939e803e48da26b7ce779b755f34cebe37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6CMBPPXOPHXRUJWBSAK4TXG5QA/bundle.json","state_url":"https://pith.science/pith/6CMBPPXOPHXRUJWBSAK4TXG5QA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6CMBPPXOPHXRUJWBSAK4TXG5QA/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-08-09T00:12:44Z","links":{"resolver":"https://pith.science/pith/6CMBPPXOPHXRUJWBSAK4TXG5QA","bundle":"https://pith.science/pith/6CMBPPXOPHXRUJWBSAK4TXG5QA/bundle.json","state":"https://pith.science/pith/6CMBPPXOPHXRUJWBSAK4TXG5QA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6CMBPPXOPHXRUJWBSAK4TXG5QA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:6CMBPPXOPHXRUJWBSAK4TXG5QA","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":"ee58b2aa1112d41d83b6942b38391ccb87b55ac863e04fea2a097de80a489755","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-03-24T14:19:04Z","title_canon_sha256":"b461c5e4963d9c0ea6e124c1d91ad4c901182971332deac2e28218d3e79aed8b"},"schema_version":"1.0","source":{"id":"0803.3406","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0803.3406","created_at":"2026-07-04T15:10:23Z"},{"alias_kind":"arxiv_version","alias_value":"0803.3406v1","created_at":"2026-07-04T15:10:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0803.3406","created_at":"2026-07-04T15:10:23Z"},{"alias_kind":"pith_short_12","alias_value":"6CMBPPXOPHXR","created_at":"2026-07-04T15:10:23Z"},{"alias_kind":"pith_short_16","alias_value":"6CMBPPXOPHXRUJWB","created_at":"2026-07-04T15:10:23Z"},{"alias_kind":"pith_short_8","alias_value":"6CMBPPXO","created_at":"2026-07-04T15:10:23Z"}],"graph_snapshots":[{"event_id":"sha256:165c7bdbf2cf87351dac07c21393a1939e803e48da26b7ce779b755f34cebe37","target":"graph","created_at":"2026-07-04T15:10:23Z","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/0803.3406/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $H$ be a fixed graph on $v$ vertices. For an $n$-vertex graph $G$ with $n$ divisible by $v$, an $H$-{\\em factor} of $G$ is a collection of $n/v$ copies of $H$ whose vertex sets partition $V(G)$.\n  In this paper we consider the threshold $th_{H} (n)$ of the property that an Erd\\H{o}s-R\\'enyi random graph (on $n$ points) contains an $H$-factor. Our results determine $th_{H} (n)$ for all strictly balanced $H$.\n  The method here extends with no difficulty to hypergraphs. As a corollary, we obtain the threshold for a perfect matching in random $k$-uniform hypergraph, solving the well-known \"Sha","authors_text":"A. Johansson, J. Kahn, V. Vu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-03-24T14:19:04Z","title":"Factors in random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0803.3406","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:f550eb440c4e7f87aa7ca298b8a371973cab7509200e1e108b96f017d6bfe4a3","target":"record","created_at":"2026-07-04T15:10:23Z","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":"ee58b2aa1112d41d83b6942b38391ccb87b55ac863e04fea2a097de80a489755","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-03-24T14:19:04Z","title_canon_sha256":"b461c5e4963d9c0ea6e124c1d91ad4c901182971332deac2e28218d3e79aed8b"},"schema_version":"1.0","source":{"id":"0803.3406","kind":"arxiv","version":1}},"canonical_sha256":"f09817beee79ef1a26c19015c9dcdd80310b0a39eaf0eeff27508a0671301973","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f09817beee79ef1a26c19015c9dcdd80310b0a39eaf0eeff27508a0671301973","first_computed_at":"2026-07-04T15:10:23.073914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:10:23.073914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UwnyFku+B18GOrU8FvRiNbIa3ir2sUkBfp7u/XKIt0HAYyvDDvOskVE0JDJvhZcXVUHR9lzSmBeAL/hsVJ13CQ==","signature_status":"signed_v1","signed_at":"2026-07-04T15:10:23.074260Z","signed_message":"canonical_sha256_bytes"},"source_id":"0803.3406","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f550eb440c4e7f87aa7ca298b8a371973cab7509200e1e108b96f017d6bfe4a3","sha256:165c7bdbf2cf87351dac07c21393a1939e803e48da26b7ce779b755f34cebe37"],"state_sha256":"4dbda714bce80f104bbbc64292fc1c27f3ff0e4d864f9220d9f015fb4b4f4f7c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PT0+iEQXlBIyN3oMRIINLNAEcmHMZrs9XSi6NxwHbA3PCh9hSswqa2ni1nDhkRsCwgOLE2F+/BRG86cRx0skBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T00:12:44.590891Z","bundle_sha256":"14639a9c357ad1cf170fdfc3525699aef4a106214dbc6fdf0de980a2b71d702b"}}