{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:W3XVKBZHAVVDB37SFWMQ7Z54QC","short_pith_number":"pith:W3XVKBZH","canonical_record":{"source":{"id":"1310.0481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-01T20:25:02Z","cross_cats_sorted":[],"title_canon_sha256":"02526ec335160c052d624a27451bf90ee23a5752a85c80035ef105ffd9613f92","abstract_canon_sha256":"7ae8e5018d85ec033645c74b430798cf5498de2537ee4dcaa20151edeb2453c0"},"schema_version":"1.0"},"canonical_sha256":"b6ef550727056a30eff22d990fe7bc808156cd835ee92f7f2971f60876d25111","source":{"kind":"arxiv","id":"1310.0481","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.0481","created_at":"2026-05-18T03:11:35Z"},{"alias_kind":"arxiv_version","alias_value":"1310.0481v1","created_at":"2026-05-18T03:11:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0481","created_at":"2026-05-18T03:11:35Z"},{"alias_kind":"pith_short_12","alias_value":"W3XVKBZHAVVD","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"W3XVKBZHAVVDB37S","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"W3XVKBZH","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:W3XVKBZHAVVDB37SFWMQ7Z54QC","target":"record","payload":{"canonical_record":{"source":{"id":"1310.0481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-01T20:25:02Z","cross_cats_sorted":[],"title_canon_sha256":"02526ec335160c052d624a27451bf90ee23a5752a85c80035ef105ffd9613f92","abstract_canon_sha256":"7ae8e5018d85ec033645c74b430798cf5498de2537ee4dcaa20151edeb2453c0"},"schema_version":"1.0"},"canonical_sha256":"b6ef550727056a30eff22d990fe7bc808156cd835ee92f7f2971f60876d25111","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:35.179201Z","signature_b64":"HboUKMu5SDnH/gqs0yojkQYvWeisgOzUig55i4zy9dBWVgFD3ZEC024KiKngHn7em3AWT+htyiCFvQO3+FpsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6ef550727056a30eff22d990fe7bc808156cd835ee92f7f2971f60876d25111","last_reissued_at":"2026-05-18T03:11:35.178677Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:35.178677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.0481","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-05-18T03:11:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jFV0I/NBRPhP193IOmn6Vh9SoydFRDHsxNpq4ohIxgh0hkxpQQvm1lmGOF6qipw6wVl2BJF7COIFQbJ+1TdMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:54:05.399697Z"},"content_sha256":"4bc6fe739fe85eb9f1c470671b2e873b796af1d254b9ae8df20bb01e79249c84","schema_version":"1.0","event_id":"sha256:4bc6fe739fe85eb9f1c470671b2e873b796af1d254b9ae8df20bb01e79249c84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:W3XVKBZHAVVDB37SFWMQ7Z54QC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tiling in bipartite graphs with asymmetric minimum degrees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Czygrinow, Louis DeBiasio","submitted_at":"2013-10-01T20:25:02Z","abstract_excerpt":"The problem of determining the optimal minimum degree condition for a balanced bipartite graph on 2ms vertices to contain m vertex disjoint copies of K_{s,s} was solved by Zhao. Later Hladk\\'y and Schacht, and Czygrinow and DeBiasio determined the optimal minimum degree condition for a balanced bipartite graph on 2m(s+t) vertices to contain m vertex disjoint copies of K_{s,t} for fixed positive integers s<t.\n  For a balanced bipartite graph G[U,V], let \\delta_U be the minimum degree over all vertices in U and \\delta_V be the minimum degree over all vertices in V. We consider the problem of det"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0481","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":""},"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-18T03:11:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4PMrYTaD++IhhNdfXVLo23jGYWPRAG0pY5YVLpu8+zpraI1kAQrM/1O3WXbVW3uQvGj0ZZ5VNXG7Wv2AvL+sDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:54:05.400047Z"},"content_sha256":"6a05aa1f62c5b01a69c4bf2339857382a976aa0940241e033d5f8aa73c1989c6","schema_version":"1.0","event_id":"sha256:6a05aa1f62c5b01a69c4bf2339857382a976aa0940241e033d5f8aa73c1989c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W3XVKBZHAVVDB37SFWMQ7Z54QC/bundle.json","state_url":"https://pith.science/pith/W3XVKBZHAVVDB37SFWMQ7Z54QC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W3XVKBZHAVVDB37SFWMQ7Z54QC/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-23T00:54:05Z","links":{"resolver":"https://pith.science/pith/W3XVKBZHAVVDB37SFWMQ7Z54QC","bundle":"https://pith.science/pith/W3XVKBZHAVVDB37SFWMQ7Z54QC/bundle.json","state":"https://pith.science/pith/W3XVKBZHAVVDB37SFWMQ7Z54QC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W3XVKBZHAVVDB37SFWMQ7Z54QC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:W3XVKBZHAVVDB37SFWMQ7Z54QC","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":"7ae8e5018d85ec033645c74b430798cf5498de2537ee4dcaa20151edeb2453c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-01T20:25:02Z","title_canon_sha256":"02526ec335160c052d624a27451bf90ee23a5752a85c80035ef105ffd9613f92"},"schema_version":"1.0","source":{"id":"1310.0481","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.0481","created_at":"2026-05-18T03:11:35Z"},{"alias_kind":"arxiv_version","alias_value":"1310.0481v1","created_at":"2026-05-18T03:11:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0481","created_at":"2026-05-18T03:11:35Z"},{"alias_kind":"pith_short_12","alias_value":"W3XVKBZHAVVD","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"W3XVKBZHAVVDB37S","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"W3XVKBZH","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:6a05aa1f62c5b01a69c4bf2339857382a976aa0940241e033d5f8aa73c1989c6","target":"graph","created_at":"2026-05-18T03:11:35Z","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":"The problem of determining the optimal minimum degree condition for a balanced bipartite graph on 2ms vertices to contain m vertex disjoint copies of K_{s,s} was solved by Zhao. Later Hladk\\'y and Schacht, and Czygrinow and DeBiasio determined the optimal minimum degree condition for a balanced bipartite graph on 2m(s+t) vertices to contain m vertex disjoint copies of K_{s,t} for fixed positive integers s<t.\n  For a balanced bipartite graph G[U,V], let \\delta_U be the minimum degree over all vertices in U and \\delta_V be the minimum degree over all vertices in V. We consider the problem of det","authors_text":"Andrzej Czygrinow, Louis DeBiasio","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-01T20:25:02Z","title":"Tiling in bipartite graphs with asymmetric minimum degrees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0481","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:4bc6fe739fe85eb9f1c470671b2e873b796af1d254b9ae8df20bb01e79249c84","target":"record","created_at":"2026-05-18T03:11:35Z","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":"7ae8e5018d85ec033645c74b430798cf5498de2537ee4dcaa20151edeb2453c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-01T20:25:02Z","title_canon_sha256":"02526ec335160c052d624a27451bf90ee23a5752a85c80035ef105ffd9613f92"},"schema_version":"1.0","source":{"id":"1310.0481","kind":"arxiv","version":1}},"canonical_sha256":"b6ef550727056a30eff22d990fe7bc808156cd835ee92f7f2971f60876d25111","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6ef550727056a30eff22d990fe7bc808156cd835ee92f7f2971f60876d25111","first_computed_at":"2026-05-18T03:11:35.178677Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:35.178677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HboUKMu5SDnH/gqs0yojkQYvWeisgOzUig55i4zy9dBWVgFD3ZEC024KiKngHn7em3AWT+htyiCFvQO3+FpsDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:35.179201Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.0481","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4bc6fe739fe85eb9f1c470671b2e873b796af1d254b9ae8df20bb01e79249c84","sha256:6a05aa1f62c5b01a69c4bf2339857382a976aa0940241e033d5f8aa73c1989c6"],"state_sha256":"66c8da29542fcf80d08380521b523344ad401b2779d980c8479c179179d6d1c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BKg77p3Uz3PwiTqrNECztneF5lZ3ESoUISWY+SAKbh69vRKSHDC/YrAGJJKLHT/lpeJaEGfBlIJcyQLeNuWzAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T00:54:05.402008Z","bundle_sha256":"6455f6b6295d57c8bd7194f6059d879e069613773ec57b522b2ceeab460c529c"}}