{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JUWLORX7BK7DT2ZKPJWZU7DUU5","short_pith_number":"pith:JUWLORX7","schema_version":"1.0","canonical_sha256":"4d2cb746ff0abe39eb2a7a6d9a7c74a76ee113a84dc1b62996a0b3fd2180308e","source":{"kind":"arxiv","id":"1304.2429","version":2},"attestation_state":"computed","paper":{"title":"Packing tree factors in random and pseudo-random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Deepak Bal, Michael Krivelevich, Po-Shen Loh","submitted_at":"2013-04-08T22:45:52Z","abstract_excerpt":"For a fixed graph H with t vertices, an H-factor of a graph G with n vertices, where t divides n, is a collection of vertex disjoint (not necessarily induced) copies of H in G covering all vertices of G. We prove that for a fixed tree T on t vertices and \\epsilon > 0, the random graph G_{n,p}, with n a multiple of t, with high probability contains a family of edge-disjoint T-factors covering all but an \\epsilon-fraction of its edges, as long as \\epsilon^4 n p >> (log n)^2. Assuming stronger divisibility conditions, the edge probability can be taken down to p > (C log n)/n. A similar packing re"},"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":"1304.2429","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-08T22:45:52Z","cross_cats_sorted":[],"title_canon_sha256":"060c0068e7ea04804545055b3b1f334a1aaf6cc3d2c89a7705661c853f88a9e8","abstract_canon_sha256":"e7754d341424faa7911d523058c9a905395ac7bd0226da7d95209d26721cf9d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:11.416798Z","signature_b64":"1Uox8NWgbR4Ms/kJI6pg1FIGNVTYkH88z8j5Pn+XG06VJetHUY/pYJqUXmviBbOfSTFXpAMeEfCfMC/i9KmGDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d2cb746ff0abe39eb2a7a6d9a7c74a76ee113a84dc1b62996a0b3fd2180308e","last_reissued_at":"2026-05-18T02:55:11.416334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:11.416334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Packing tree factors in random and pseudo-random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Deepak Bal, Michael Krivelevich, Po-Shen Loh","submitted_at":"2013-04-08T22:45:52Z","abstract_excerpt":"For a fixed graph H with t vertices, an H-factor of a graph G with n vertices, where t divides n, is a collection of vertex disjoint (not necessarily induced) copies of H in G covering all vertices of G. We prove that for a fixed tree T on t vertices and \\epsilon > 0, the random graph G_{n,p}, with n a multiple of t, with high probability contains a family of edge-disjoint T-factors covering all but an \\epsilon-fraction of its edges, as long as \\epsilon^4 n p >> (log n)^2. Assuming stronger divisibility conditions, the edge probability can be taken down to p > (C log n)/n. A similar packing re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2429","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":"1304.2429","created_at":"2026-05-18T02:55:11.416402+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.2429v2","created_at":"2026-05-18T02:55:11.416402+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2429","created_at":"2026-05-18T02:55:11.416402+00:00"},{"alias_kind":"pith_short_12","alias_value":"JUWLORX7BK7D","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JUWLORX7BK7DT2ZK","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JUWLORX7","created_at":"2026-05-18T12:27:49.015174+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/JUWLORX7BK7DT2ZKPJWZU7DUU5","json":"https://pith.science/pith/JUWLORX7BK7DT2ZKPJWZU7DUU5.json","graph_json":"https://pith.science/api/pith-number/JUWLORX7BK7DT2ZKPJWZU7DUU5/graph.json","events_json":"https://pith.science/api/pith-number/JUWLORX7BK7DT2ZKPJWZU7DUU5/events.json","paper":"https://pith.science/paper/JUWLORX7"},"agent_actions":{"view_html":"https://pith.science/pith/JUWLORX7BK7DT2ZKPJWZU7DUU5","download_json":"https://pith.science/pith/JUWLORX7BK7DT2ZKPJWZU7DUU5.json","view_paper":"https://pith.science/paper/JUWLORX7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.2429&json=true","fetch_graph":"https://pith.science/api/pith-number/JUWLORX7BK7DT2ZKPJWZU7DUU5/graph.json","fetch_events":"https://pith.science/api/pith-number/JUWLORX7BK7DT2ZKPJWZU7DUU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JUWLORX7BK7DT2ZKPJWZU7DUU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JUWLORX7BK7DT2ZKPJWZU7DUU5/action/storage_attestation","attest_author":"https://pith.science/pith/JUWLORX7BK7DT2ZKPJWZU7DUU5/action/author_attestation","sign_citation":"https://pith.science/pith/JUWLORX7BK7DT2ZKPJWZU7DUU5/action/citation_signature","submit_replication":"https://pith.science/pith/JUWLORX7BK7DT2ZKPJWZU7DUU5/action/replication_record"}},"created_at":"2026-05-18T02:55:11.416402+00:00","updated_at":"2026-05-18T02:55:11.416402+00:00"}