{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:V3VUK5IUZSLTTRTQ2DHS32Y4IM","short_pith_number":"pith:V3VUK5IU","canonical_record":{"source":{"id":"2607.27870","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-30T08:44:50Z","cross_cats_sorted":[],"title_canon_sha256":"e110356eeb648d4597494b0a4c197978399b63bd935ff47a6a6b429ecc312f97","abstract_canon_sha256":"4c89af6566522414e9e3908bf9e97e85f14d353f43f2797b5b81a27f7175dca4"},"schema_version":"1.0"},"canonical_sha256":"aeeb457514cc9739c670d0cf2deb1c431bed3caa9612e546c714477f5d2a1f7e","source":{"kind":"arxiv","id":"2607.27870","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27870","created_at":"2026-07-31T01:34:31Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27870v1","created_at":"2026-07-31T01:34:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27870","created_at":"2026-07-31T01:34:31Z"},{"alias_kind":"pith_short_12","alias_value":"V3VUK5IUZSLT","created_at":"2026-07-31T01:34:31Z"},{"alias_kind":"pith_short_16","alias_value":"V3VUK5IUZSLTTRTQ","created_at":"2026-07-31T01:34:31Z"},{"alias_kind":"pith_short_8","alias_value":"V3VUK5IU","created_at":"2026-07-31T01:34:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:V3VUK5IUZSLTTRTQ2DHS32Y4IM","target":"record","payload":{"canonical_record":{"source":{"id":"2607.27870","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-30T08:44:50Z","cross_cats_sorted":[],"title_canon_sha256":"e110356eeb648d4597494b0a4c197978399b63bd935ff47a6a6b429ecc312f97","abstract_canon_sha256":"4c89af6566522414e9e3908bf9e97e85f14d353f43f2797b5b81a27f7175dca4"},"schema_version":"1.0"},"canonical_sha256":"aeeb457514cc9739c670d0cf2deb1c431bed3caa9612e546c714477f5d2a1f7e","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aeeb457514cc9739c670d0cf2deb1c431bed3caa9612e546c714477f5d2a1f7e","last_reissued_at":"2026-07-31T01:34:31.680931Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:34:31.680931Z"},"source_kind":"arxiv","source_id":"2607.27870","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-31T01:34:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tyFNsJkRPJhE+rRQiUEZlex3d6ETC+qg61lBGbLWxI7VICzkAfK76HXy0X1Bs4kzLAxRgURwLEsmtyVj3iaQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:12:01.628310Z"},"content_sha256":"903ad560ac39c8a86e9a0fd014214bbeaa8eef0642328405d963b3aa5e5bf130","schema_version":"1.0","event_id":"sha256:903ad560ac39c8a86e9a0fd014214bbeaa8eef0642328405d963b3aa5e5bf130"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:V3VUK5IUZSLTTRTQ2DHS32Y4IM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the number of factorable induced subgraphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bin Wang, Jie Han, Jingwen Zhao","submitted_at":"2026-07-30T08:44:50Z","abstract_excerpt":"Let $F$ be an $r$-vertex graph. In this paper, we study the $F$-factor problem in random induced subgraphs of dense graphs. We show that for any $r$-vertex graph $F$ and $\\gamma>0$, if $H$ is an $n$-vertex graph with minimum degree at least $(1-1/\\chi_{cr}(F)+\\gamma)n$, then for every fixed $p \\in (0,1)$, the random induced subgraph $H[p]$ contains an $F$-factor with probability at least $1/(rq)-o_n(1)$, where $q\\in \\mathbb{N}$ is the order of certain coset group defined from $H$. The probability is asymptotically best possible for infinitely many $F$ and $H$ and yields that a $1/(rq)-o_n(1)$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27870","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/2607.27870/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-31T01:34:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HfepAUxWw8YOiYh4NvEz4sJ/pMInOkntfXOLsrks+z/xn5CropZIHzMpbiTjlBhlo2odbbpI9EgziPrOAf7PBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:12:01.628798Z"},"content_sha256":"e31709fa981235868b6b05aa600ab8ecd449c6ca1b4c7b5431d271a34dd681c5","schema_version":"1.0","event_id":"sha256:e31709fa981235868b6b05aa600ab8ecd449c6ca1b4c7b5431d271a34dd681c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V3VUK5IUZSLTTRTQ2DHS32Y4IM/bundle.json","state_url":"https://pith.science/pith/V3VUK5IUZSLTTRTQ2DHS32Y4IM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V3VUK5IUZSLTTRTQ2DHS32Y4IM/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-03T18:12:01Z","links":{"resolver":"https://pith.science/pith/V3VUK5IUZSLTTRTQ2DHS32Y4IM","bundle":"https://pith.science/pith/V3VUK5IUZSLTTRTQ2DHS32Y4IM/bundle.json","state":"https://pith.science/pith/V3VUK5IUZSLTTRTQ2DHS32Y4IM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V3VUK5IUZSLTTRTQ2DHS32Y4IM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:V3VUK5IUZSLTTRTQ2DHS32Y4IM","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":"4c89af6566522414e9e3908bf9e97e85f14d353f43f2797b5b81a27f7175dca4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-30T08:44:50Z","title_canon_sha256":"e110356eeb648d4597494b0a4c197978399b63bd935ff47a6a6b429ecc312f97"},"schema_version":"1.0","source":{"id":"2607.27870","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27870","created_at":"2026-07-31T01:34:31Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27870v1","created_at":"2026-07-31T01:34:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27870","created_at":"2026-07-31T01:34:31Z"},{"alias_kind":"pith_short_12","alias_value":"V3VUK5IUZSLT","created_at":"2026-07-31T01:34:31Z"},{"alias_kind":"pith_short_16","alias_value":"V3VUK5IUZSLTTRTQ","created_at":"2026-07-31T01:34:31Z"},{"alias_kind":"pith_short_8","alias_value":"V3VUK5IU","created_at":"2026-07-31T01:34:31Z"}],"graph_snapshots":[{"event_id":"sha256:e31709fa981235868b6b05aa600ab8ecd449c6ca1b4c7b5431d271a34dd681c5","target":"graph","created_at":"2026-07-31T01:34:31Z","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/2607.27870/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $F$ be an $r$-vertex graph. In this paper, we study the $F$-factor problem in random induced subgraphs of dense graphs. We show that for any $r$-vertex graph $F$ and $\\gamma>0$, if $H$ is an $n$-vertex graph with minimum degree at least $(1-1/\\chi_{cr}(F)+\\gamma)n$, then for every fixed $p \\in (0,1)$, the random induced subgraph $H[p]$ contains an $F$-factor with probability at least $1/(rq)-o_n(1)$, where $q\\in \\mathbb{N}$ is the order of certain coset group defined from $H$. The probability is asymptotically best possible for infinitely many $F$ and $H$ and yields that a $1/(rq)-o_n(1)$ ","authors_text":"Bin Wang, Jie Han, Jingwen Zhao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-30T08:44:50Z","title":"On the number of factorable induced subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27870","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:903ad560ac39c8a86e9a0fd014214bbeaa8eef0642328405d963b3aa5e5bf130","target":"record","created_at":"2026-07-31T01:34:31Z","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":"4c89af6566522414e9e3908bf9e97e85f14d353f43f2797b5b81a27f7175dca4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-30T08:44:50Z","title_canon_sha256":"e110356eeb648d4597494b0a4c197978399b63bd935ff47a6a6b429ecc312f97"},"schema_version":"1.0","source":{"id":"2607.27870","kind":"arxiv","version":1}},"canonical_sha256":"aeeb457514cc9739c670d0cf2deb1c431bed3caa9612e546c714477f5d2a1f7e","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aeeb457514cc9739c670d0cf2deb1c431bed3caa9612e546c714477f5d2a1f7e","first_computed_at":"2026-07-31T01:34:31.680931Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:34:31.680931Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.27870","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:903ad560ac39c8a86e9a0fd014214bbeaa8eef0642328405d963b3aa5e5bf130","sha256:e31709fa981235868b6b05aa600ab8ecd449c6ca1b4c7b5431d271a34dd681c5"],"state_sha256":"ba4b7df6a998b4dc3daa4c8e53b722518ebf9f5a64be944cd90a202aef86bbcb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DPnHC5hq/n76+pE1vitmvuq6j/sfjw/zO9rp06dxavyy7tBstDFwYY5IBjLeuXOLBbu9aEtb2gK9ojjAMIkADg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T18:12:01.632119Z","bundle_sha256":"c5581045a8b9fe3831ce01f67cff13a4d84cad4d16dc6165e3cd62bbce823728"}}