{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NXPGBVGALOUH37UF3TW34OD6EG","short_pith_number":"pith:NXPGBVGA","schema_version":"1.0","canonical_sha256":"6dde60d4c05ba87dfe85dcedbe387e21b0612e654df982ec5dc35966bcb34841","source":{"kind":"arxiv","id":"2410.13290","version":1},"attestation_state":"computed","paper":{"title":"Packing large balanced trees into bipartite graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cristina G. Fernandes, Giovanne Santos, Maya Stein, T\\'assio Naia","submitted_at":"2024-10-17T07:37:59Z","abstract_excerpt":"We prove that for every ${\\gamma > 0}$ there exists $n_0 \\in \\mathbb{N}$ such that for every ${n \\geq n_0}$ any family of up to $\\lfloor{n^{\\frac12+\\gamma}}\\rfloor$ trees having at most $(1-\\gamma)n$ vertices in each bipartition class can be packed into $K_{n,n}$. As a tool for our proof, we show an approximate bipartite version of the Koml\\'os-S\\'ark\\\"ozy-Szemer\\'edi Theorem, which we believe to be of independent interest."},"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":"2410.13290","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-17T07:37:59Z","cross_cats_sorted":[],"title_canon_sha256":"99b6ac17bcf2fccdca3568f6fbc0441d39e3c6d73aebff0c83f10d26d4e4d86f","abstract_canon_sha256":"034175aad410ff2e7ec6a9d6fd4d01c6192d584ca95bae48265c97a002da1b67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:21:58.154952Z","signature_b64":"XrZQ0z6bamT8YyihXV50cC5WN1zJze07bJv020RUZC41BjY/Oi8tOLDAMoKt9e+mbMbTgW7naVNHWz9eqoi1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dde60d4c05ba87dfe85dcedbe387e21b0612e654df982ec5dc35966bcb34841","last_reissued_at":"2026-07-05T09:21:58.154473Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:21:58.154473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Packing large balanced trees into bipartite graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cristina G. Fernandes, Giovanne Santos, Maya Stein, T\\'assio Naia","submitted_at":"2024-10-17T07:37:59Z","abstract_excerpt":"We prove that for every ${\\gamma > 0}$ there exists $n_0 \\in \\mathbb{N}$ such that for every ${n \\geq n_0}$ any family of up to $\\lfloor{n^{\\frac12+\\gamma}}\\rfloor$ trees having at most $(1-\\gamma)n$ vertices in each bipartition class can be packed into $K_{n,n}$. As a tool for our proof, we show an approximate bipartite version of the Koml\\'os-S\\'ark\\\"ozy-Szemer\\'edi Theorem, which we believe to be of independent interest."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.13290","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.13290/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2410.13290","created_at":"2026-07-05T09:21:58.154529+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.13290v1","created_at":"2026-07-05T09:21:58.154529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.13290","created_at":"2026-07-05T09:21:58.154529+00:00"},{"alias_kind":"pith_short_12","alias_value":"NXPGBVGALOUH","created_at":"2026-07-05T09:21:58.154529+00:00"},{"alias_kind":"pith_short_16","alias_value":"NXPGBVGALOUH37UF","created_at":"2026-07-05T09:21:58.154529+00:00"},{"alias_kind":"pith_short_8","alias_value":"NXPGBVGA","created_at":"2026-07-05T09:21:58.154529+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/NXPGBVGALOUH37UF3TW34OD6EG","json":"https://pith.science/pith/NXPGBVGALOUH37UF3TW34OD6EG.json","graph_json":"https://pith.science/api/pith-number/NXPGBVGALOUH37UF3TW34OD6EG/graph.json","events_json":"https://pith.science/api/pith-number/NXPGBVGALOUH37UF3TW34OD6EG/events.json","paper":"https://pith.science/paper/NXPGBVGA"},"agent_actions":{"view_html":"https://pith.science/pith/NXPGBVGALOUH37UF3TW34OD6EG","download_json":"https://pith.science/pith/NXPGBVGALOUH37UF3TW34OD6EG.json","view_paper":"https://pith.science/paper/NXPGBVGA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.13290&json=true","fetch_graph":"https://pith.science/api/pith-number/NXPGBVGALOUH37UF3TW34OD6EG/graph.json","fetch_events":"https://pith.science/api/pith-number/NXPGBVGALOUH37UF3TW34OD6EG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NXPGBVGALOUH37UF3TW34OD6EG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NXPGBVGALOUH37UF3TW34OD6EG/action/storage_attestation","attest_author":"https://pith.science/pith/NXPGBVGALOUH37UF3TW34OD6EG/action/author_attestation","sign_citation":"https://pith.science/pith/NXPGBVGALOUH37UF3TW34OD6EG/action/citation_signature","submit_replication":"https://pith.science/pith/NXPGBVGALOUH37UF3TW34OD6EG/action/replication_record"}},"created_at":"2026-07-05T09:21:58.154529+00:00","updated_at":"2026-07-05T09:21:58.154529+00:00"}