{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:UCTSTUA6EWS6FPO5AN4QHAF7SX","short_pith_number":"pith:UCTSTUA6","schema_version":"1.0","canonical_sha256":"a0a729d01e25a5e2bddd03790380bf95ebfa9d2365786a6e29e979478b4c8dc6","source":{"kind":"arxiv","id":"1011.3882","version":1},"attestation_state":"computed","paper":{"title":"Embedding a Forest in a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Malik Magdon-Ismail, Mark Goldberg","submitted_at":"2010-11-17T04:15:36Z","abstract_excerpt":"For \\math{p\\ge 1}, we prove that every forest with \\math{p} trees whose sizes are $a_1,..., a_p$ can be embedded in any graph containing at least $\\sum_{i=1}^p (a_i + 1)$ vertices and having a minimum degree at least $\\sum_{i=1}^p a_i$."},"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":"1011.3882","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-17T04:15:36Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"893d6e81645aa9bdbdb676b42c645b2e81d7b272ccd938bc0dcca384604be65c","abstract_canon_sha256":"5195ddb33aa4060cff7edcd5e6f07d0049ddefce42787d1819f4004dc574a564"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:35:47.389018Z","signature_b64":"QdGAe+rX2VHnfYXJd1eCkZuU4tQmZqyDtyKyNgkfX7r/XpYUkp9Lnr4ALMTfGcrp7Zx/mw0JoD2kKViVIWesBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0a729d01e25a5e2bddd03790380bf95ebfa9d2365786a6e29e979478b4c8dc6","last_reissued_at":"2026-05-18T04:35:47.388608Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:35:47.388608Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Embedding a Forest in a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Malik Magdon-Ismail, Mark Goldberg","submitted_at":"2010-11-17T04:15:36Z","abstract_excerpt":"For \\math{p\\ge 1}, we prove that every forest with \\math{p} trees whose sizes are $a_1,..., a_p$ can be embedded in any graph containing at least $\\sum_{i=1}^p (a_i + 1)$ vertices and having a minimum degree at least $\\sum_{i=1}^p a_i$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3882","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":""},"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":"1011.3882","created_at":"2026-05-18T04:35:47.388671+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.3882v1","created_at":"2026-05-18T04:35:47.388671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3882","created_at":"2026-05-18T04:35:47.388671+00:00"},{"alias_kind":"pith_short_12","alias_value":"UCTSTUA6EWS6","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"UCTSTUA6EWS6FPO5","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"UCTSTUA6","created_at":"2026-05-18T12:26:15.391820+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/UCTSTUA6EWS6FPO5AN4QHAF7SX","json":"https://pith.science/pith/UCTSTUA6EWS6FPO5AN4QHAF7SX.json","graph_json":"https://pith.science/api/pith-number/UCTSTUA6EWS6FPO5AN4QHAF7SX/graph.json","events_json":"https://pith.science/api/pith-number/UCTSTUA6EWS6FPO5AN4QHAF7SX/events.json","paper":"https://pith.science/paper/UCTSTUA6"},"agent_actions":{"view_html":"https://pith.science/pith/UCTSTUA6EWS6FPO5AN4QHAF7SX","download_json":"https://pith.science/pith/UCTSTUA6EWS6FPO5AN4QHAF7SX.json","view_paper":"https://pith.science/paper/UCTSTUA6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.3882&json=true","fetch_graph":"https://pith.science/api/pith-number/UCTSTUA6EWS6FPO5AN4QHAF7SX/graph.json","fetch_events":"https://pith.science/api/pith-number/UCTSTUA6EWS6FPO5AN4QHAF7SX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UCTSTUA6EWS6FPO5AN4QHAF7SX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UCTSTUA6EWS6FPO5AN4QHAF7SX/action/storage_attestation","attest_author":"https://pith.science/pith/UCTSTUA6EWS6FPO5AN4QHAF7SX/action/author_attestation","sign_citation":"https://pith.science/pith/UCTSTUA6EWS6FPO5AN4QHAF7SX/action/citation_signature","submit_replication":"https://pith.science/pith/UCTSTUA6EWS6FPO5AN4QHAF7SX/action/replication_record"}},"created_at":"2026-05-18T04:35:47.388671+00:00","updated_at":"2026-05-18T04:35:47.388671+00:00"}