{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:37SRE3NO73JQ6K3VBPTOY37GYW","short_pith_number":"pith:37SRE3NO","canonical_record":{"source":{"id":"2106.09688","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-06-17T17:40:31Z","cross_cats_sorted":[],"title_canon_sha256":"138d9a729e9242dfd2cc2aa6ddbe3c60ea8bfb46fa784c8eb5261ee0c5c98197","abstract_canon_sha256":"7be22713da37752f269cfd99623c69a7311e84b90d883a1c8746c3a3fc6ea7a6"},"schema_version":"1.0"},"canonical_sha256":"dfe5126daefed30f2b750be6ec6fe6c5b836011ce2ae230840bb9e209a2a1fd8","source":{"kind":"arxiv","id":"2106.09688","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.09688","created_at":"2026-06-23T03:13:42Z"},{"alias_kind":"arxiv_version","alias_value":"2106.09688v2","created_at":"2026-06-23T03:13:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.09688","created_at":"2026-06-23T03:13:42Z"},{"alias_kind":"pith_short_12","alias_value":"37SRE3NO73JQ","created_at":"2026-06-23T03:13:42Z"},{"alias_kind":"pith_short_16","alias_value":"37SRE3NO73JQ6K3V","created_at":"2026-06-23T03:13:42Z"},{"alias_kind":"pith_short_8","alias_value":"37SRE3NO","created_at":"2026-06-23T03:13:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:37SRE3NO73JQ6K3VBPTOY37GYW","target":"record","payload":{"canonical_record":{"source":{"id":"2106.09688","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-06-17T17:40:31Z","cross_cats_sorted":[],"title_canon_sha256":"138d9a729e9242dfd2cc2aa6ddbe3c60ea8bfb46fa784c8eb5261ee0c5c98197","abstract_canon_sha256":"7be22713da37752f269cfd99623c69a7311e84b90d883a1c8746c3a3fc6ea7a6"},"schema_version":"1.0"},"canonical_sha256":"dfe5126daefed30f2b750be6ec6fe6c5b836011ce2ae230840bb9e209a2a1fd8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:13:42.121203Z","signature_b64":"tJ/oKW9PFDQIX1KkwOXYQMoNQk2MwfCRMPZgCg9KLcYnQHxvnKE7mi1AOw5oYSqzDrLt3KSKzhOyQ3dzg+a4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfe5126daefed30f2b750be6ec6fe6c5b836011ce2ae230840bb9e209a2a1fd8","last_reissued_at":"2026-06-23T03:13:42.120559Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:13:42.120559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2106.09688","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-06-23T03:13:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f7rVd2M4uHyqX0f/Ysjo8MjVpl9FL0r3YqtzZJWxL2RrkzMNdvm6a8AKKtEjUEmz+T9hVfV3HEkzQcEhTZofAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T09:27:59.319712Z"},"content_sha256":"6ff63c2da64afe540d350f16230bec09879b252dfe724854063bd6958823cad7","schema_version":"1.0","event_id":"sha256:6ff63c2da64afe540d350f16230bec09879b252dfe724854063bd6958823cad7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:37SRE3NO73JQ6K3VBPTOY37GYW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Ramsey-Tur\\'an theory for tilings in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Donglei Yang, Guanghui Wang, Jie Han, Patrick Morris","submitted_at":"2021-06-17T17:40:31Z","abstract_excerpt":"For a $k$-vertex graph $F$ and an $n$-vertex graph $G$, an $F$-tiling in $G$ is a collection of vertex-disjoint copies of $F$ in $G$. For $r\\in \\mathbb{N}$, the $r$-independence number of $G$, denoted $\\alpha_r(G)$, is the largest size of a $K_r$-free set of vertices in $G$. In this paper, we discuss Ramsey--Tur\\'an-type theorems for tilings where one is interested in minimum degree and independence number conditions (and the interaction between the two) that guarantee the existence of optimal $F$-tilings. For cliques, we show that for any $k\\geq 3$ and $\\eta>0$, any graph $G$ on $n$ vertices "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.09688","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/2106.09688/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-06-23T03:13:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SGK7V33oiEO70IOtGfiKhvOO4NcADdiIyFOqVts421q4eCyD2bs9hKENmlT3GmdiZ9lCoesOeEYEgueg7NKTAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T09:27:59.320093Z"},"content_sha256":"f9192be7e62495ae3c48d555db5112fdfaa45a62bdd2a50c6f31ab68f67f4156","schema_version":"1.0","event_id":"sha256:f9192be7e62495ae3c48d555db5112fdfaa45a62bdd2a50c6f31ab68f67f4156"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/37SRE3NO73JQ6K3VBPTOY37GYW/bundle.json","state_url":"https://pith.science/pith/37SRE3NO73JQ6K3VBPTOY37GYW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/37SRE3NO73JQ6K3VBPTOY37GYW/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-06-25T09:27:59Z","links":{"resolver":"https://pith.science/pith/37SRE3NO73JQ6K3VBPTOY37GYW","bundle":"https://pith.science/pith/37SRE3NO73JQ6K3VBPTOY37GYW/bundle.json","state":"https://pith.science/pith/37SRE3NO73JQ6K3VBPTOY37GYW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/37SRE3NO73JQ6K3VBPTOY37GYW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:37SRE3NO73JQ6K3VBPTOY37GYW","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":"7be22713da37752f269cfd99623c69a7311e84b90d883a1c8746c3a3fc6ea7a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-06-17T17:40:31Z","title_canon_sha256":"138d9a729e9242dfd2cc2aa6ddbe3c60ea8bfb46fa784c8eb5261ee0c5c98197"},"schema_version":"1.0","source":{"id":"2106.09688","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.09688","created_at":"2026-06-23T03:13:42Z"},{"alias_kind":"arxiv_version","alias_value":"2106.09688v2","created_at":"2026-06-23T03:13:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.09688","created_at":"2026-06-23T03:13:42Z"},{"alias_kind":"pith_short_12","alias_value":"37SRE3NO73JQ","created_at":"2026-06-23T03:13:42Z"},{"alias_kind":"pith_short_16","alias_value":"37SRE3NO73JQ6K3V","created_at":"2026-06-23T03:13:42Z"},{"alias_kind":"pith_short_8","alias_value":"37SRE3NO","created_at":"2026-06-23T03:13:42Z"}],"graph_snapshots":[{"event_id":"sha256:f9192be7e62495ae3c48d555db5112fdfaa45a62bdd2a50c6f31ab68f67f4156","target":"graph","created_at":"2026-06-23T03:13:42Z","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/2106.09688/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a $k$-vertex graph $F$ and an $n$-vertex graph $G$, an $F$-tiling in $G$ is a collection of vertex-disjoint copies of $F$ in $G$. For $r\\in \\mathbb{N}$, the $r$-independence number of $G$, denoted $\\alpha_r(G)$, is the largest size of a $K_r$-free set of vertices in $G$. In this paper, we discuss Ramsey--Tur\\'an-type theorems for tilings where one is interested in minimum degree and independence number conditions (and the interaction between the two) that guarantee the existence of optimal $F$-tilings. For cliques, we show that for any $k\\geq 3$ and $\\eta>0$, any graph $G$ on $n$ vertices ","authors_text":"Donglei Yang, Guanghui Wang, Jie Han, Patrick Morris","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-06-17T17:40:31Z","title":"A Ramsey-Tur\\'an theory for tilings in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.09688","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:6ff63c2da64afe540d350f16230bec09879b252dfe724854063bd6958823cad7","target":"record","created_at":"2026-06-23T03:13:42Z","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":"7be22713da37752f269cfd99623c69a7311e84b90d883a1c8746c3a3fc6ea7a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-06-17T17:40:31Z","title_canon_sha256":"138d9a729e9242dfd2cc2aa6ddbe3c60ea8bfb46fa784c8eb5261ee0c5c98197"},"schema_version":"1.0","source":{"id":"2106.09688","kind":"arxiv","version":2}},"canonical_sha256":"dfe5126daefed30f2b750be6ec6fe6c5b836011ce2ae230840bb9e209a2a1fd8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfe5126daefed30f2b750be6ec6fe6c5b836011ce2ae230840bb9e209a2a1fd8","first_computed_at":"2026-06-23T03:13:42.120559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T03:13:42.120559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tJ/oKW9PFDQIX1KkwOXYQMoNQk2MwfCRMPZgCg9KLcYnQHxvnKE7mi1AOw5oYSqzDrLt3KSKzhOyQ3dzg+a4Ag==","signature_status":"signed_v1","signed_at":"2026-06-23T03:13:42.121203Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.09688","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ff63c2da64afe540d350f16230bec09879b252dfe724854063bd6958823cad7","sha256:f9192be7e62495ae3c48d555db5112fdfaa45a62bdd2a50c6f31ab68f67f4156"],"state_sha256":"0dba966435ae39784751a7cce858aedee7227e6f08725f5fafa6c3c54fc94151"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cg8FSOpEeOPOY+e3+ATz+0bELj2YnKP5hJD2KgMrXXtgAb3SXOz3tr5PpDX7rqWZPeq0GRdA7vj1V4IEOZFlAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T09:27:59.322087Z","bundle_sha256":"299dd2cf83395c66961947bf83fbdb619fe18bb8357aab0f29e79286fd06bca7"}}