{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:FLOFSEN4IFKM7OWXUHLOKWUTVF","short_pith_number":"pith:FLOFSEN4","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"},"canonical_sha256":"2adc5911bc4154cfbad7a1d6e55a93a955c93118bef45b347912688139ece903","source":{"kind":"arxiv","id":"2302.13780","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.13780","created_at":"2026-07-05T05:45:50Z"},{"alias_kind":"arxiv_version","alias_value":"2302.13780v1","created_at":"2026-07-05T05:45:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.13780","created_at":"2026-07-05T05:45:50Z"},{"alias_kind":"pith_short_12","alias_value":"FLOFSEN4IFKM","created_at":"2026-07-05T05:45:50Z"},{"alias_kind":"pith_short_16","alias_value":"FLOFSEN4IFKM7OWX","created_at":"2026-07-05T05:45:50Z"},{"alias_kind":"pith_short_8","alias_value":"FLOFSEN4","created_at":"2026-07-05T05:45:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:FLOFSEN4IFKM7OWXUHLOKWUTVF","target":"record","payload":{"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"},"canonical_sha256":"2adc5911bc4154cfbad7a1d6e55a93a955c93118bef45b347912688139ece903","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"},"source_kind":"arxiv","source_id":"2302.13780","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-05T05:45:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vX5wAebfAGDvRiI88rNq39SZ/n8ZV99bLjbbGxbrzxrk4NOUiteW49O849V3x7Ptqwoz84v74qxcSMsKzV70Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T16:51:08.470287Z"},"content_sha256":"39ba3820934e4bd2fe45ec9248633f477e0d59e31c3a34ab32b56506a046959a","schema_version":"1.0","event_id":"sha256:39ba3820934e4bd2fe45ec9248633f477e0d59e31c3a34ab32b56506a046959a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:FLOFSEN4IFKM7OWXUHLOKWUTVF","target":"graph","payload":{"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"},"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-05T05:45:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OOwNIhq2J7PDXL0l4/yySBaku4IcDlL5SdVMZziHUuKOBVXrcGzZLrY80X/zl0049Jy1WrPSeKai6dpON4E/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T16:51:08.470780Z"},"content_sha256":"f213d4e7c10b8df94fb1fdeebb210a90a98b495b92d17ce40eceabc2ae3b6ad3","schema_version":"1.0","event_id":"sha256:f213d4e7c10b8df94fb1fdeebb210a90a98b495b92d17ce40eceabc2ae3b6ad3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FLOFSEN4IFKM7OWXUHLOKWUTVF/bundle.json","state_url":"https://pith.science/pith/FLOFSEN4IFKM7OWXUHLOKWUTVF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FLOFSEN4IFKM7OWXUHLOKWUTVF/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-08T16:51:08Z","links":{"resolver":"https://pith.science/pith/FLOFSEN4IFKM7OWXUHLOKWUTVF","bundle":"https://pith.science/pith/FLOFSEN4IFKM7OWXUHLOKWUTVF/bundle.json","state":"https://pith.science/pith/FLOFSEN4IFKM7OWXUHLOKWUTVF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FLOFSEN4IFKM7OWXUHLOKWUTVF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:FLOFSEN4IFKM7OWXUHLOKWUTVF","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":"c1c520dccff5ffeb184e6e79b20646970ac3543046c253dd62ac0a021d9852b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-02-27T13:57:41Z","title_canon_sha256":"6a8ad65a97d256b0b11b1879201bdcbc746b3dc8c67972bee43aa3fbb84f89b2"},"schema_version":"1.0","source":{"id":"2302.13780","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.13780","created_at":"2026-07-05T05:45:50Z"},{"alias_kind":"arxiv_version","alias_value":"2302.13780v1","created_at":"2026-07-05T05:45:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.13780","created_at":"2026-07-05T05:45:50Z"},{"alias_kind":"pith_short_12","alias_value":"FLOFSEN4IFKM","created_at":"2026-07-05T05:45:50Z"},{"alias_kind":"pith_short_16","alias_value":"FLOFSEN4IFKM7OWX","created_at":"2026-07-05T05:45:50Z"},{"alias_kind":"pith_short_8","alias_value":"FLOFSEN4","created_at":"2026-07-05T05:45:50Z"}],"graph_snapshots":[{"event_id":"sha256:f213d4e7c10b8df94fb1fdeebb210a90a98b495b92d17ce40eceabc2ae3b6ad3","target":"graph","created_at":"2026-07-05T05:45:50Z","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/2302.13780/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Domagoj Brada\\v{c}, Lior Gishboliner, Micha Christoph","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-02-27T13:57:41Z","title":"Minimum Degree Threshold for $H$-factors with High Discrepancy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.13780","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:39ba3820934e4bd2fe45ec9248633f477e0d59e31c3a34ab32b56506a046959a","target":"record","created_at":"2026-07-05T05:45:50Z","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":"c1c520dccff5ffeb184e6e79b20646970ac3543046c253dd62ac0a021d9852b9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-02-27T13:57:41Z","title_canon_sha256":"6a8ad65a97d256b0b11b1879201bdcbc746b3dc8c67972bee43aa3fbb84f89b2"},"schema_version":"1.0","source":{"id":"2302.13780","kind":"arxiv","version":1}},"canonical_sha256":"2adc5911bc4154cfbad7a1d6e55a93a955c93118bef45b347912688139ece903","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2adc5911bc4154cfbad7a1d6e55a93a955c93118bef45b347912688139ece903","first_computed_at":"2026-07-05T05:45:50.835393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:45:50.835393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vmqDDuY0w+yvgg1se6bPuGJkRveZyBdmgJpn+4a/Hw6WHTvvPVH6svvjbxn/KPl+aFefzS4yG8eqQY+INXy6BA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:45:50.835848Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.13780","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39ba3820934e4bd2fe45ec9248633f477e0d59e31c3a34ab32b56506a046959a","sha256:f213d4e7c10b8df94fb1fdeebb210a90a98b495b92d17ce40eceabc2ae3b6ad3"],"state_sha256":"d750148bff0b449e1a498e487410471471d5be4449a7c379c57124395910378b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dPAFw+WdT5VRLnWyuG1a2GUHBOsrO65dTaWQixYzZp34dekft4zz6bQyZQgWgltSRrNaP30t38V/SKbfbZCCCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T16:51:08.474042Z","bundle_sha256":"cc3c23f62dd324f77c266a3af33a6eeade96c82ae67ee5c8427d60f4463247df"}}