{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:B56NDMLJ3MEOADKJOUWVEARE6N","short_pith_number":"pith:B56NDMLJ","schema_version":"1.0","canonical_sha256":"0f7cd1b169db08e00d49752d520224f36d8bb149ff72a002e3da368337d1dbbd","source":{"kind":"arxiv","id":"1007.4287","version":3},"attestation_state":"computed","paper":{"title":"Completing Partial Packings of Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ago-Erik Riet, Mykhaylo Tyomkyn, Zolt\\'an F\\\"uredi","submitted_at":"2010-07-24T22:54:51Z","abstract_excerpt":"Given a bipartite graph $H$ and an integer $n$, let $f(n;H)$ be the smallest integer such that, any set of edge disjoint copies of $H$ on $n$ vertices, can be extended to an $H$-design on at most $n+f(n;H)$ vertices. We establish tight bounds for the growth of $f(n;H)$ as $n \\rightarrow \\infty$. In particular, we prove the conjecture of F\\\"uredi and Lehel \\cite{FuLe} that $f(n;H) = o(n)$. This settles a long-standing open problem."},"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":"1007.4287","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-07-24T22:54:51Z","cross_cats_sorted":[],"title_canon_sha256":"31b72125ff58cda65ec43b6ec3a8c8fb5e807a31c4b88df81efa1fe20afdca09","abstract_canon_sha256":"cb2868a223274bde5127a34afd47aaf27a75b0b77d5b6eaf052df2b39299f66d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:03.842957Z","signature_b64":"SO1/cnVmQ1SotfSB3+xu4mDYrECsmbMh4+K4grHf6OTAHtWDZEVlneioCzlk2ZI51ygg1ZwpUWS8R2we4GmFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f7cd1b169db08e00d49752d520224f36d8bb149ff72a002e3da368337d1dbbd","last_reissued_at":"2026-05-18T04:42:03.842431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:03.842431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Completing Partial Packings of Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ago-Erik Riet, Mykhaylo Tyomkyn, Zolt\\'an F\\\"uredi","submitted_at":"2010-07-24T22:54:51Z","abstract_excerpt":"Given a bipartite graph $H$ and an integer $n$, let $f(n;H)$ be the smallest integer such that, any set of edge disjoint copies of $H$ on $n$ vertices, can be extended to an $H$-design on at most $n+f(n;H)$ vertices. We establish tight bounds for the growth of $f(n;H)$ as $n \\rightarrow \\infty$. In particular, we prove the conjecture of F\\\"uredi and Lehel \\cite{FuLe} that $f(n;H) = o(n)$. This settles a long-standing open problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4287","kind":"arxiv","version":3},"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":"1007.4287","created_at":"2026-05-18T04:42:03.842540+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.4287v3","created_at":"2026-05-18T04:42:03.842540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4287","created_at":"2026-05-18T04:42:03.842540+00:00"},{"alias_kind":"pith_short_12","alias_value":"B56NDMLJ3MEO","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"B56NDMLJ3MEOADKJ","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"B56NDMLJ","created_at":"2026-05-18T12:26:05.355336+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/B56NDMLJ3MEOADKJOUWVEARE6N","json":"https://pith.science/pith/B56NDMLJ3MEOADKJOUWVEARE6N.json","graph_json":"https://pith.science/api/pith-number/B56NDMLJ3MEOADKJOUWVEARE6N/graph.json","events_json":"https://pith.science/api/pith-number/B56NDMLJ3MEOADKJOUWVEARE6N/events.json","paper":"https://pith.science/paper/B56NDMLJ"},"agent_actions":{"view_html":"https://pith.science/pith/B56NDMLJ3MEOADKJOUWVEARE6N","download_json":"https://pith.science/pith/B56NDMLJ3MEOADKJOUWVEARE6N.json","view_paper":"https://pith.science/paper/B56NDMLJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.4287&json=true","fetch_graph":"https://pith.science/api/pith-number/B56NDMLJ3MEOADKJOUWVEARE6N/graph.json","fetch_events":"https://pith.science/api/pith-number/B56NDMLJ3MEOADKJOUWVEARE6N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B56NDMLJ3MEOADKJOUWVEARE6N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B56NDMLJ3MEOADKJOUWVEARE6N/action/storage_attestation","attest_author":"https://pith.science/pith/B56NDMLJ3MEOADKJOUWVEARE6N/action/author_attestation","sign_citation":"https://pith.science/pith/B56NDMLJ3MEOADKJOUWVEARE6N/action/citation_signature","submit_replication":"https://pith.science/pith/B56NDMLJ3MEOADKJOUWVEARE6N/action/replication_record"}},"created_at":"2026-05-18T04:42:03.842540+00:00","updated_at":"2026-05-18T04:42:03.842540+00:00"}