{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:N7BD5OGJJPRLL5FPUOZ7L4KGUZ","short_pith_number":"pith:N7BD5OGJ","schema_version":"1.0","canonical_sha256":"6fc23eb8c94be2b5f4afa3b3f5f146a66dc76142bb02d6cb24b1094c1a6addff","source":{"kind":"arxiv","id":"0910.1064","version":2},"attestation_state":"computed","paper":{"title":"The extremal function for partial bipartite tilings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Codrut Grosu, Jan Hladky","submitted_at":"2009-10-06T17:44:00Z","abstract_excerpt":"For a fixed bipartite graph H and given number c, 0<c<1, we determine the threshold T_H(c) which guarantees that any n-vertex graph with at edge density at least T_H(c) contains $(1-o(1))c/v(H) n$ vertex-disjoint copies of H. In the proof we use a variant of a technique developed by Komlos~\\bcolor{[Combinatorica 20 (2000), 203-218}]"},"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":"0910.1064","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-10-06T17:44:00Z","cross_cats_sorted":[],"title_canon_sha256":"e38d5e15ba95f47501710012bc68c1316c9dfccfea29a4898e343e3097a95867","abstract_canon_sha256":"ad4cd26c911872b92e52933b4dcf25c6aeb4f040f8f7cc15c842d643eb8c08bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:18.834853Z","signature_b64":"p8t2Ht4rVFhuEoH1/nP+RYhfoTO5qMy9C0CohTa8vOQmWS1gGEfgZxTGOUcx6jsjPvjIBMEqCRwbIZbtjNp9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fc23eb8c94be2b5f4afa3b3f5f146a66dc76142bb02d6cb24b1094c1a6addff","last_reissued_at":"2026-05-18T00:39:18.834089Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:18.834089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The extremal function for partial bipartite tilings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Codrut Grosu, Jan Hladky","submitted_at":"2009-10-06T17:44:00Z","abstract_excerpt":"For a fixed bipartite graph H and given number c, 0<c<1, we determine the threshold T_H(c) which guarantees that any n-vertex graph with at edge density at least T_H(c) contains $(1-o(1))c/v(H) n$ vertex-disjoint copies of H. In the proof we use a variant of a technique developed by Komlos~\\bcolor{[Combinatorica 20 (2000), 203-218}]"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.1064","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":""},"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":"0910.1064","created_at":"2026-05-18T00:39:18.834197+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.1064v2","created_at":"2026-05-18T00:39:18.834197+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.1064","created_at":"2026-05-18T00:39:18.834197+00:00"},{"alias_kind":"pith_short_12","alias_value":"N7BD5OGJJPRL","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"N7BD5OGJJPRLL5FP","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"N7BD5OGJ","created_at":"2026-05-18T12:26:00.592388+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N7BD5OGJJPRLL5FPUOZ7L4KGUZ","json":"https://pith.science/pith/N7BD5OGJJPRLL5FPUOZ7L4KGUZ.json","graph_json":"https://pith.science/api/pith-number/N7BD5OGJJPRLL5FPUOZ7L4KGUZ/graph.json","events_json":"https://pith.science/api/pith-number/N7BD5OGJJPRLL5FPUOZ7L4KGUZ/events.json","paper":"https://pith.science/paper/N7BD5OGJ"},"agent_actions":{"view_html":"https://pith.science/pith/N7BD5OGJJPRLL5FPUOZ7L4KGUZ","download_json":"https://pith.science/pith/N7BD5OGJJPRLL5FPUOZ7L4KGUZ.json","view_paper":"https://pith.science/paper/N7BD5OGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.1064&json=true","fetch_graph":"https://pith.science/api/pith-number/N7BD5OGJJPRLL5FPUOZ7L4KGUZ/graph.json","fetch_events":"https://pith.science/api/pith-number/N7BD5OGJJPRLL5FPUOZ7L4KGUZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N7BD5OGJJPRLL5FPUOZ7L4KGUZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N7BD5OGJJPRLL5FPUOZ7L4KGUZ/action/storage_attestation","attest_author":"https://pith.science/pith/N7BD5OGJJPRLL5FPUOZ7L4KGUZ/action/author_attestation","sign_citation":"https://pith.science/pith/N7BD5OGJJPRLL5FPUOZ7L4KGUZ/action/citation_signature","submit_replication":"https://pith.science/pith/N7BD5OGJJPRLL5FPUOZ7L4KGUZ/action/replication_record"}},"created_at":"2026-05-18T00:39:18.834197+00:00","updated_at":"2026-05-18T00:39:18.834197+00:00"}