{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:KFLAT5N5YIKAUNTWIHKQZ452NI","short_pith_number":"pith:KFLAT5N5","canonical_record":{"source":{"id":"2411.14138","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-21T14:02:22Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"cf2407333bc4200bcf36677922d9f207636f2bb70b234fe2db27d643cb167c7d","abstract_canon_sha256":"89174340ba19f27651e44b0389001d027d356bfe684cefdf061eb463e549192a"},"schema_version":"1.0"},"canonical_sha256":"515609f5bdc2140a367641d50cf3ba6a300daeb25b74adc52d49804c6a514184","source":{"kind":"arxiv","id":"2411.14138","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.14138","created_at":"2026-07-05T11:52:16Z"},{"alias_kind":"arxiv_version","alias_value":"2411.14138v2","created_at":"2026-07-05T11:52:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14138","created_at":"2026-07-05T11:52:16Z"},{"alias_kind":"pith_short_12","alias_value":"KFLAT5N5YIKA","created_at":"2026-07-05T11:52:16Z"},{"alias_kind":"pith_short_16","alias_value":"KFLAT5N5YIKAUNTW","created_at":"2026-07-05T11:52:16Z"},{"alias_kind":"pith_short_8","alias_value":"KFLAT5N5","created_at":"2026-07-05T11:52:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:KFLAT5N5YIKAUNTWIHKQZ452NI","target":"record","payload":{"canonical_record":{"source":{"id":"2411.14138","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-21T14:02:22Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"cf2407333bc4200bcf36677922d9f207636f2bb70b234fe2db27d643cb167c7d","abstract_canon_sha256":"89174340ba19f27651e44b0389001d027d356bfe684cefdf061eb463e549192a"},"schema_version":"1.0"},"canonical_sha256":"515609f5bdc2140a367641d50cf3ba6a300daeb25b74adc52d49804c6a514184","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:52:16.090518Z","signature_b64":"HZSbVZWTPtfuFB2WKufwfoliVW8xpIcmFJU0g0DU82mVslw1eTEAU9Ol9OHZyPCgqb4IVIOHdWjz/I0fRJ1IDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"515609f5bdc2140a367641d50cf3ba6a300daeb25b74adc52d49804c6a514184","last_reissued_at":"2026-07-05T11:52:16.090038Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:52:16.090038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.14138","source_version":2,"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-05T11:52:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5GJpFJu5nmYaDPa6nKW7Coo/Zb3NGPz8yjldyweYwu31MHgoUz9/OnXGjAFmFCsrmLVEVpQBH/po8Fj6mDv6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T05:01:43.550573Z"},"content_sha256":"15b5e0d234cccf3f8b778b423aa4937fb335d58070ab92d07c04cdbf6ea40f59","schema_version":"1.0","event_id":"sha256:15b5e0d234cccf3f8b778b423aa4937fb335d58070ab92d07c04cdbf6ea40f59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:KFLAT5N5YIKAUNTWIHKQZ452NI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sharp Thresholds for Factors in Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Annika Heckel, Fabian Burghart, Marc Kaufmann, Matija Pasch, Noela M\\\"uller","submitted_at":"2024-11-21T14:02:22Z","abstract_excerpt":"Let $F$ be a graph on $r$ vertices and let $G$ be a graph on $n$ vertices. Then an $F$-factor in $G$ is a subgraph of $G$ composed of $n/r$ vertex-disjoint copies of $F$, if $r$ divides $n$. In other words, an $F$-factor yields a partition of the $n$ vertices of $G$. The study of such $F$-factors in the Erd\\H{o}s-R\\'enyi random graph dates back to Erd\\H{o}s himself. Decades later, in 2008, Johansson, Kahn and Vu established the thresholds for the existence of an $F$-factor for strictly 1-balanced $F$ -- up to the leading constant. The sharp thresholds, meaning the leading constants, were obtai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14138","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/2411.14138/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-05T11:52:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZsUv2HvYTtIj5I+cstiaoqlotOqG5RBdFJ/8B7un8FPiQQ22kEcO7EwjhdlTekExy+SzKDb12FsvAtwJhpP+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T05:01:43.550954Z"},"content_sha256":"80871495681caf1de421bb70cc3a9bc0d3ecf98d0dc3affa296961710a12da09","schema_version":"1.0","event_id":"sha256:80871495681caf1de421bb70cc3a9bc0d3ecf98d0dc3affa296961710a12da09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KFLAT5N5YIKAUNTWIHKQZ452NI/bundle.json","state_url":"https://pith.science/pith/KFLAT5N5YIKAUNTWIHKQZ452NI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KFLAT5N5YIKAUNTWIHKQZ452NI/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-07-08T05:01:43Z","links":{"resolver":"https://pith.science/pith/KFLAT5N5YIKAUNTWIHKQZ452NI","bundle":"https://pith.science/pith/KFLAT5N5YIKAUNTWIHKQZ452NI/bundle.json","state":"https://pith.science/pith/KFLAT5N5YIKAUNTWIHKQZ452NI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KFLAT5N5YIKAUNTWIHKQZ452NI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:KFLAT5N5YIKAUNTWIHKQZ452NI","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":"89174340ba19f27651e44b0389001d027d356bfe684cefdf061eb463e549192a","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-21T14:02:22Z","title_canon_sha256":"cf2407333bc4200bcf36677922d9f207636f2bb70b234fe2db27d643cb167c7d"},"schema_version":"1.0","source":{"id":"2411.14138","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.14138","created_at":"2026-07-05T11:52:16Z"},{"alias_kind":"arxiv_version","alias_value":"2411.14138v2","created_at":"2026-07-05T11:52:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14138","created_at":"2026-07-05T11:52:16Z"},{"alias_kind":"pith_short_12","alias_value":"KFLAT5N5YIKA","created_at":"2026-07-05T11:52:16Z"},{"alias_kind":"pith_short_16","alias_value":"KFLAT5N5YIKAUNTW","created_at":"2026-07-05T11:52:16Z"},{"alias_kind":"pith_short_8","alias_value":"KFLAT5N5","created_at":"2026-07-05T11:52:16Z"}],"graph_snapshots":[{"event_id":"sha256:80871495681caf1de421bb70cc3a9bc0d3ecf98d0dc3affa296961710a12da09","target":"graph","created_at":"2026-07-05T11:52:16Z","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/2411.14138/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $F$ be a graph on $r$ vertices and let $G$ be a graph on $n$ vertices. Then an $F$-factor in $G$ is a subgraph of $G$ composed of $n/r$ vertex-disjoint copies of $F$, if $r$ divides $n$. In other words, an $F$-factor yields a partition of the $n$ vertices of $G$. The study of such $F$-factors in the Erd\\H{o}s-R\\'enyi random graph dates back to Erd\\H{o}s himself. Decades later, in 2008, Johansson, Kahn and Vu established the thresholds for the existence of an $F$-factor for strictly 1-balanced $F$ -- up to the leading constant. The sharp thresholds, meaning the leading constants, were obtai","authors_text":"Annika Heckel, Fabian Burghart, Marc Kaufmann, Matija Pasch, Noela M\\\"uller","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-21T14:02:22Z","title":"Sharp Thresholds for Factors in Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14138","kind":"arxiv","version":2},"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:15b5e0d234cccf3f8b778b423aa4937fb335d58070ab92d07c04cdbf6ea40f59","target":"record","created_at":"2026-07-05T11:52:16Z","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":"89174340ba19f27651e44b0389001d027d356bfe684cefdf061eb463e549192a","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-21T14:02:22Z","title_canon_sha256":"cf2407333bc4200bcf36677922d9f207636f2bb70b234fe2db27d643cb167c7d"},"schema_version":"1.0","source":{"id":"2411.14138","kind":"arxiv","version":2}},"canonical_sha256":"515609f5bdc2140a367641d50cf3ba6a300daeb25b74adc52d49804c6a514184","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"515609f5bdc2140a367641d50cf3ba6a300daeb25b74adc52d49804c6a514184","first_computed_at":"2026-07-05T11:52:16.090038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:52:16.090038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HZSbVZWTPtfuFB2WKufwfoliVW8xpIcmFJU0g0DU82mVslw1eTEAU9Ol9OHZyPCgqb4IVIOHdWjz/I0fRJ1IDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:52:16.090518Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.14138","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15b5e0d234cccf3f8b778b423aa4937fb335d58070ab92d07c04cdbf6ea40f59","sha256:80871495681caf1de421bb70cc3a9bc0d3ecf98d0dc3affa296961710a12da09"],"state_sha256":"39e0b345df2dbbaef388c8848a9e9aab3f237907e6db2735763dade986bc6d21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LGiVtot84XqV+flYdGuMGGQa2gduqDPb1PiRDkyICqfd27e/HvpTvaORciEgDulFRsgtjnluV4es6GtaXFKtDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T05:01:43.553020Z","bundle_sha256":"d97d793e75092ecf38648dab40d19395365450407e394bf8174059cd08bb8ded"}}