{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JUWLORX7BK7DT2ZKPJWZU7DUU5","short_pith_number":"pith:JUWLORX7","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"},"canonical_sha256":"4d2cb746ff0abe39eb2a7a6d9a7c74a76ee113a84dc1b62996a0b3fd2180308e","source":{"kind":"arxiv","id":"1304.2429","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2429","created_at":"2026-05-18T02:55:11Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2429v2","created_at":"2026-05-18T02:55:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2429","created_at":"2026-05-18T02:55:11Z"},{"alias_kind":"pith_short_12","alias_value":"JUWLORX7BK7D","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JUWLORX7BK7DT2ZK","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JUWLORX7","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JUWLORX7BK7DT2ZKPJWZU7DUU5","target":"record","payload":{"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"},"canonical_sha256":"4d2cb746ff0abe39eb2a7a6d9a7c74a76ee113a84dc1b62996a0b3fd2180308e","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"},"source_kind":"arxiv","source_id":"1304.2429","source_version":2,"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-18T02:55:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hUqqchZ1jhOx/JJ+h/obhJBW7GrZphXUrTLdwrl4nGIvMDko62SACYPsaukRM3Jr3GYdFc6j6ukyrQnx2d4+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:46:21.662112Z"},"content_sha256":"286e3bd35a8c8072d005166b33a3c98f62efd09b59629072635e4d4fc992d017","schema_version":"1.0","event_id":"sha256:286e3bd35a8c8072d005166b33a3c98f62efd09b59629072635e4d4fc992d017"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JUWLORX7BK7DT2ZKPJWZU7DUU5","target":"graph","payload":{"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"},"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-18T02:55:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xgmdcg/qIP0R5snO+y8xAXNYpOFgpzeTYBdGzuxMz+CwgyixWfp4EWc22SbqwVrcNMRVgpgW4sZO/DtlAwA9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:46:21.662708Z"},"content_sha256":"2bebf0768746c30286230ac5f565eff3d2c4cb232c1569fab6e169e50e6cde78","schema_version":"1.0","event_id":"sha256:2bebf0768746c30286230ac5f565eff3d2c4cb232c1569fab6e169e50e6cde78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JUWLORX7BK7DT2ZKPJWZU7DUU5/bundle.json","state_url":"https://pith.science/pith/JUWLORX7BK7DT2ZKPJWZU7DUU5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JUWLORX7BK7DT2ZKPJWZU7DUU5/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-05-27T01:46:21Z","links":{"resolver":"https://pith.science/pith/JUWLORX7BK7DT2ZKPJWZU7DUU5","bundle":"https://pith.science/pith/JUWLORX7BK7DT2ZKPJWZU7DUU5/bundle.json","state":"https://pith.science/pith/JUWLORX7BK7DT2ZKPJWZU7DUU5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JUWLORX7BK7DT2ZKPJWZU7DUU5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JUWLORX7BK7DT2ZKPJWZU7DUU5","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":"e7754d341424faa7911d523058c9a905395ac7bd0226da7d95209d26721cf9d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-08T22:45:52Z","title_canon_sha256":"060c0068e7ea04804545055b3b1f334a1aaf6cc3d2c89a7705661c853f88a9e8"},"schema_version":"1.0","source":{"id":"1304.2429","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2429","created_at":"2026-05-18T02:55:11Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2429v2","created_at":"2026-05-18T02:55:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2429","created_at":"2026-05-18T02:55:11Z"},{"alias_kind":"pith_short_12","alias_value":"JUWLORX7BK7D","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JUWLORX7BK7DT2ZK","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JUWLORX7","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:2bebf0768746c30286230ac5f565eff3d2c4cb232c1569fab6e169e50e6cde78","target":"graph","created_at":"2026-05-18T02:55:11Z","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":"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","authors_text":"Alan Frieze, Deepak Bal, Michael Krivelevich, Po-Shen Loh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-08T22:45:52Z","title":"Packing tree factors in random and pseudo-random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2429","kind":"arxiv","version":2},"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:286e3bd35a8c8072d005166b33a3c98f62efd09b59629072635e4d4fc992d017","target":"record","created_at":"2026-05-18T02:55:11Z","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":"e7754d341424faa7911d523058c9a905395ac7bd0226da7d95209d26721cf9d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-08T22:45:52Z","title_canon_sha256":"060c0068e7ea04804545055b3b1f334a1aaf6cc3d2c89a7705661c853f88a9e8"},"schema_version":"1.0","source":{"id":"1304.2429","kind":"arxiv","version":2}},"canonical_sha256":"4d2cb746ff0abe39eb2a7a6d9a7c74a76ee113a84dc1b62996a0b3fd2180308e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d2cb746ff0abe39eb2a7a6d9a7c74a76ee113a84dc1b62996a0b3fd2180308e","first_computed_at":"2026-05-18T02:55:11.416334Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:11.416334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1Uox8NWgbR4Ms/kJI6pg1FIGNVTYkH88z8j5Pn+XG06VJetHUY/pYJqUXmviBbOfSTFXpAMeEfCfMC/i9KmGDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:11.416798Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.2429","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:286e3bd35a8c8072d005166b33a3c98f62efd09b59629072635e4d4fc992d017","sha256:2bebf0768746c30286230ac5f565eff3d2c4cb232c1569fab6e169e50e6cde78"],"state_sha256":"841da06797b20fee4fb6446166ef6e8803fe4d144181f99922941c36b38f2969"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dhAMhqCgRNZgvEvp8MdTZUW+0cV9sII6gywde82moU97c9HXiO7edZywjcqmeOEzrD2TQaEUBbsd9eX1nWNYBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:46:21.666702Z","bundle_sha256":"8b51131037a7c1cc7caf4327cdd1eb46b638735213c0997caf8603d4ca12acf1"}}