{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FLOFSEN4IFKM7OWXUHLOKWUTVF","short_pith_number":"pith:FLOFSEN4","schema_version":"1.0","canonical_sha256":"2adc5911bc4154cfbad7a1d6e55a93a955c93118bef45b347912688139ece903","source":{"kind":"arxiv","id":"2302.13780","version":1},"attestation_state":"computed","paper":{"title":"Minimum Degree Threshold for $H$-factors with High Discrepancy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Domagoj Brada\\v{c}, Lior Gishboliner, Micha Christoph","submitted_at":"2023-02-27T13:57:41Z","abstract_excerpt":"Given a graph $H$, a perfect $H$-factor in a graph $G$ is a collection of vertex-disjoint copies of $H$ spanning $G$. K\\\"uhn and Osthus showed that the minimum degree threshold for a graph $G$ to contain a perfect $H$-factor is either given by $1-1/\\chi(H)$ or by $1-1/\\chi_{cr}(H)$ depending on certain natural divisibility considerations. Given a graph $G$ of order $n$, a $2$-edge-coloring of $G$ and a subgraph $G'$ of $G$, we say that $G'$ has high discrepancy if it contains significantly (linear in $n$) more edges of one color than the other. Balogh, Csaba, Pluh\\'ar and Treglown asked for th"},"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":"2302.13780","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-02-27T13:57:41Z","cross_cats_sorted":[],"title_canon_sha256":"6a8ad65a97d256b0b11b1879201bdcbc746b3dc8c67972bee43aa3fbb84f89b2","abstract_canon_sha256":"c1c520dccff5ffeb184e6e79b20646970ac3543046c253dd62ac0a021d9852b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:45:50.835848Z","signature_b64":"vmqDDuY0w+yvgg1se6bPuGJkRveZyBdmgJpn+4a/Hw6WHTvvPVH6svvjbxn/KPl+aFefzS4yG8eqQY+INXy6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2adc5911bc4154cfbad7a1d6e55a93a955c93118bef45b347912688139ece903","last_reissued_at":"2026-07-05T05:45:50.835393Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:45:50.835393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Degree Threshold for $H$-factors with High Discrepancy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Domagoj Brada\\v{c}, Lior Gishboliner, Micha Christoph","submitted_at":"2023-02-27T13:57:41Z","abstract_excerpt":"Given a graph $H$, a perfect $H$-factor in a graph $G$ is a collection of vertex-disjoint copies of $H$ spanning $G$. K\\\"uhn and Osthus showed that the minimum degree threshold for a graph $G$ to contain a perfect $H$-factor is either given by $1-1/\\chi(H)$ or by $1-1/\\chi_{cr}(H)$ depending on certain natural divisibility considerations. Given a graph $G$ of order $n$, a $2$-edge-coloring of $G$ and a subgraph $G'$ of $G$, we say that $G'$ has high discrepancy if it contains significantly (linear in $n$) more edges of one color than the other. Balogh, Csaba, Pluh\\'ar and Treglown asked for th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.13780","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/2302.13780/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":"2302.13780","created_at":"2026-07-05T05:45:50.835450+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.13780v1","created_at":"2026-07-05T05:45:50.835450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.13780","created_at":"2026-07-05T05:45:50.835450+00:00"},{"alias_kind":"pith_short_12","alias_value":"FLOFSEN4IFKM","created_at":"2026-07-05T05:45:50.835450+00:00"},{"alias_kind":"pith_short_16","alias_value":"FLOFSEN4IFKM7OWX","created_at":"2026-07-05T05:45:50.835450+00:00"},{"alias_kind":"pith_short_8","alias_value":"FLOFSEN4","created_at":"2026-07-05T05:45:50.835450+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.04189","citing_title":"Colour-biased Hamilton cycles in randomly perturbed graphs","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FLOFSEN4IFKM7OWXUHLOKWUTVF","json":"https://pith.science/pith/FLOFSEN4IFKM7OWXUHLOKWUTVF.json","graph_json":"https://pith.science/api/pith-number/FLOFSEN4IFKM7OWXUHLOKWUTVF/graph.json","events_json":"https://pith.science/api/pith-number/FLOFSEN4IFKM7OWXUHLOKWUTVF/events.json","paper":"https://pith.science/paper/FLOFSEN4"},"agent_actions":{"view_html":"https://pith.science/pith/FLOFSEN4IFKM7OWXUHLOKWUTVF","download_json":"https://pith.science/pith/FLOFSEN4IFKM7OWXUHLOKWUTVF.json","view_paper":"https://pith.science/paper/FLOFSEN4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.13780&json=true","fetch_graph":"https://pith.science/api/pith-number/FLOFSEN4IFKM7OWXUHLOKWUTVF/graph.json","fetch_events":"https://pith.science/api/pith-number/FLOFSEN4IFKM7OWXUHLOKWUTVF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FLOFSEN4IFKM7OWXUHLOKWUTVF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FLOFSEN4IFKM7OWXUHLOKWUTVF/action/storage_attestation","attest_author":"https://pith.science/pith/FLOFSEN4IFKM7OWXUHLOKWUTVF/action/author_attestation","sign_citation":"https://pith.science/pith/FLOFSEN4IFKM7OWXUHLOKWUTVF/action/citation_signature","submit_replication":"https://pith.science/pith/FLOFSEN4IFKM7OWXUHLOKWUTVF/action/replication_record"}},"created_at":"2026-07-05T05:45:50.835450+00:00","updated_at":"2026-07-05T05:45:50.835450+00:00"}