{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:V3VUK5IUZSLTTRTQ2DHS32Y4IM","short_pith_number":"pith:V3VUK5IU","schema_version":"1.0","canonical_sha256":"aeeb457514cc9739c670d0cf2deb1c431bed3caa9612e546c714477f5d2a1f7e","source":{"kind":"arxiv","id":"2607.27870","version":1},"attestation_state":"computed","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)$ "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.27870","created_at":"2026-07-31T01:34:31.684069+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.27870v1","created_at":"2026-07-31T01:34:31.684069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27870","created_at":"2026-07-31T01:34:31.684069+00:00"},{"alias_kind":"pith_short_12","alias_value":"V3VUK5IUZSLT","created_at":"2026-07-31T01:34:31.684069+00:00"},{"alias_kind":"pith_short_16","alias_value":"V3VUK5IUZSLTTRTQ","created_at":"2026-07-31T01:34:31.684069+00:00"},{"alias_kind":"pith_short_8","alias_value":"V3VUK5IU","created_at":"2026-07-31T01:34:31.684069+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V3VUK5IUZSLTTRTQ2DHS32Y4IM","json":"https://pith.science/pith/V3VUK5IUZSLTTRTQ2DHS32Y4IM.json","graph_json":"https://pith.science/api/pith-number/V3VUK5IUZSLTTRTQ2DHS32Y4IM/graph.json","events_json":"https://pith.science/api/pith-number/V3VUK5IUZSLTTRTQ2DHS32Y4IM/events.json","paper":"https://pith.science/paper/V3VUK5IU"},"agent_actions":{"view_html":"https://pith.science/pith/V3VUK5IUZSLTTRTQ2DHS32Y4IM","download_json":"https://pith.science/pith/V3VUK5IUZSLTTRTQ2DHS32Y4IM.json","view_paper":"https://pith.science/paper/V3VUK5IU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.27870&json=true","fetch_graph":"https://pith.science/api/pith-number/V3VUK5IUZSLTTRTQ2DHS32Y4IM/graph.json","fetch_events":"https://pith.science/api/pith-number/V3VUK5IUZSLTTRTQ2DHS32Y4IM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V3VUK5IUZSLTTRTQ2DHS32Y4IM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V3VUK5IUZSLTTRTQ2DHS32Y4IM/action/storage_attestation","attest_author":"https://pith.science/pith/V3VUK5IUZSLTTRTQ2DHS32Y4IM/action/author_attestation","sign_citation":"https://pith.science/pith/V3VUK5IUZSLTTRTQ2DHS32Y4IM/action/citation_signature","submit_replication":"https://pith.science/pith/V3VUK5IUZSLTTRTQ2DHS32Y4IM/action/replication_record"}},"created_at":"2026-07-31T01:34:31.684069+00:00","updated_at":"2026-07-31T01:34:31.684069+00:00"}