{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:22OYZTIJVN2VBC224HTUK27HW2","short_pith_number":"pith:22OYZTIJ","canonical_record":{"source":{"id":"1001.1002","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-01-06T22:18:39Z","cross_cats_sorted":[],"title_canon_sha256":"5e0b43503b6ce6ed22596a22c5ea629f372ee6e588e022ec145272a3163a00a0","abstract_canon_sha256":"ed91ce5e1df3ac58898906b33ccc0141e370b241ecfa6f2f6e171307623292e6"},"schema_version":"1.0"},"canonical_sha256":"d69d8ccd09ab75508b5ae1e7456be7b6a39392bad4f9473b92dc38f36f613bb0","source":{"kind":"arxiv","id":"1001.1002","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.1002","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"arxiv_version","alias_value":"1001.1002v4","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.1002","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"pith_short_12","alias_value":"22OYZTIJVN2V","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"22OYZTIJVN2VBC22","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"22OYZTIJ","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:22OYZTIJVN2VBC224HTUK27HW2","target":"record","payload":{"canonical_record":{"source":{"id":"1001.1002","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-01-06T22:18:39Z","cross_cats_sorted":[],"title_canon_sha256":"5e0b43503b6ce6ed22596a22c5ea629f372ee6e588e022ec145272a3163a00a0","abstract_canon_sha256":"ed91ce5e1df3ac58898906b33ccc0141e370b241ecfa6f2f6e171307623292e6"},"schema_version":"1.0"},"canonical_sha256":"d69d8ccd09ab75508b5ae1e7456be7b6a39392bad4f9473b92dc38f36f613bb0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:24.481356Z","signature_b64":"/v8/ZJ776jal78RyjxG4d8vt8/djE1f6eMzAMMQwcVT/LzjSR/R15k6KvI2oCOKBLhoPV4A+P1umuW7tydUFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d69d8ccd09ab75508b5ae1e7456be7b6a39392bad4f9473b92dc38f36f613bb0","last_reissued_at":"2026-05-18T00:08:24.480154Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:24.480154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.1002","source_version":4,"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-05-18T00:08:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cJ3Fagy/NGwFnEQXHHIkC44uTysOuzzPjq4VJ0l/Aa1kImNltURTIIoCo5KU6yxuv2sRTr4BSwLzjSQjnqGgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T09:31:33.941431Z"},"content_sha256":"dce14e36e820159094dbd30a59aa86598bb575b7c929a32543b39f1f241c5013","schema_version":"1.0","event_id":"sha256:dce14e36e820159094dbd30a59aa86598bb575b7c929a32543b39f1f241c5013"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:22OYZTIJVN2VBC224HTUK27HW2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tiling tripartite graphs with 3-colorable graphs: The extreme case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kirsten Hogenson, Ryan R. Martin, Yi Zhao","submitted_at":"2010-01-06T22:18:39Z","abstract_excerpt":"There is a sufficiently large $N\\in h\\mathbb{N}$ such that the following holds. If $G$ is a tripartite graph with $N$ vertices in each vertex class such that every vertex is adjacent to at least $2N/3+2h-1$ vertices in each of the other classes, then $G$ can be tiled perfectly by copies of $K_{h,h,h}$. This extends work by two of the authors [Electron. J. Combin, 16(1), 2009] and also gives a sufficient condition for tiling by any fixed 3-colorable graph. Furthermore, we show that $2N/3+2h-1$ in our result can not be replaced by $2N/3+ h-2$ and that if $N$ is divisible by $6h$, then we can rep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.1002","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:08:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hUEr+1NF5cU7J+2iwGO6ogqA1W+aauj0i3fGPfTYD5E5ADsOCKJKIU90XI+ZYYwnxtwWpbmpYInX/sLpQP1DAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T09:31:33.941783Z"},"content_sha256":"983644776014fea8fbb0d4af89dd5cb3377a040d2e2c574cecdd3378f067ee0e","schema_version":"1.0","event_id":"sha256:983644776014fea8fbb0d4af89dd5cb3377a040d2e2c574cecdd3378f067ee0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/22OYZTIJVN2VBC224HTUK27HW2/bundle.json","state_url":"https://pith.science/pith/22OYZTIJVN2VBC224HTUK27HW2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/22OYZTIJVN2VBC224HTUK27HW2/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-23T09:31:33Z","links":{"resolver":"https://pith.science/pith/22OYZTIJVN2VBC224HTUK27HW2","bundle":"https://pith.science/pith/22OYZTIJVN2VBC224HTUK27HW2/bundle.json","state":"https://pith.science/pith/22OYZTIJVN2VBC224HTUK27HW2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/22OYZTIJVN2VBC224HTUK27HW2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:22OYZTIJVN2VBC224HTUK27HW2","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":"ed91ce5e1df3ac58898906b33ccc0141e370b241ecfa6f2f6e171307623292e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-01-06T22:18:39Z","title_canon_sha256":"5e0b43503b6ce6ed22596a22c5ea629f372ee6e588e022ec145272a3163a00a0"},"schema_version":"1.0","source":{"id":"1001.1002","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.1002","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"arxiv_version","alias_value":"1001.1002v4","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.1002","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"pith_short_12","alias_value":"22OYZTIJVN2V","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"22OYZTIJVN2VBC22","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"22OYZTIJ","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:983644776014fea8fbb0d4af89dd5cb3377a040d2e2c574cecdd3378f067ee0e","target":"graph","created_at":"2026-05-18T00:08:24Z","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"},"paper":{"abstract_excerpt":"There is a sufficiently large $N\\in h\\mathbb{N}$ such that the following holds. If $G$ is a tripartite graph with $N$ vertices in each vertex class such that every vertex is adjacent to at least $2N/3+2h-1$ vertices in each of the other classes, then $G$ can be tiled perfectly by copies of $K_{h,h,h}$. This extends work by two of the authors [Electron. J. Combin, 16(1), 2009] and also gives a sufficient condition for tiling by any fixed 3-colorable graph. Furthermore, we show that $2N/3+2h-1$ in our result can not be replaced by $2N/3+ h-2$ and that if $N$ is divisible by $6h$, then we can rep","authors_text":"Kirsten Hogenson, Ryan R. Martin, Yi Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-01-06T22:18:39Z","title":"Tiling tripartite graphs with 3-colorable graphs: The extreme case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.1002","kind":"arxiv","version":4},"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:dce14e36e820159094dbd30a59aa86598bb575b7c929a32543b39f1f241c5013","target":"record","created_at":"2026-05-18T00:08:24Z","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":"ed91ce5e1df3ac58898906b33ccc0141e370b241ecfa6f2f6e171307623292e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-01-06T22:18:39Z","title_canon_sha256":"5e0b43503b6ce6ed22596a22c5ea629f372ee6e588e022ec145272a3163a00a0"},"schema_version":"1.0","source":{"id":"1001.1002","kind":"arxiv","version":4}},"canonical_sha256":"d69d8ccd09ab75508b5ae1e7456be7b6a39392bad4f9473b92dc38f36f613bb0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d69d8ccd09ab75508b5ae1e7456be7b6a39392bad4f9473b92dc38f36f613bb0","first_computed_at":"2026-05-18T00:08:24.480154Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:24.480154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/v8/ZJ776jal78RyjxG4d8vt8/djE1f6eMzAMMQwcVT/LzjSR/R15k6KvI2oCOKBLhoPV4A+P1umuW7tydUFDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:24.481356Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.1002","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dce14e36e820159094dbd30a59aa86598bb575b7c929a32543b39f1f241c5013","sha256:983644776014fea8fbb0d4af89dd5cb3377a040d2e2c574cecdd3378f067ee0e"],"state_sha256":"655578aca749cfd4cee6e8fb3d99291a7e35ac45448f5615ac7803cd9045a412"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"prcrooi4iNrTUxZi49l/VqAI23sj7jJtD+q9j3w/cnlVpgOvNlOlmcXz2XIi+dbZbDgPIXqtNfoUKWfN9n8JBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T09:31:33.943754Z","bundle_sha256":"8f8688985921a077e2afd813b93dc38b7bb857e7ea3bca003813f6945bd8f75b"}}