{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:DZ5ODJ7TCTOXEKS4IWKHGAU7C7","short_pith_number":"pith:DZ5ODJ7T","schema_version":"1.0","canonical_sha256":"1e7ae1a7f314dd722a5c459473029f17fe77ba0ffdc683a48cdedb5abbf9d78a","source":{"kind":"arxiv","id":"2004.09947","version":1},"attestation_state":"computed","paper":{"title":"Ringel's tree packing conjecture in quasirandom graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Katherine Staden, Peter Keevash","submitted_at":"2020-04-21T12:23:37Z","abstract_excerpt":"We prove that any quasirandom graph with $n$ vertices and $rn$ edges can be decomposed into $n$ copies of any fixed tree with $r$ edges. The case of decomposing a complete graph establishes a conjecture of Ringel from 1963."},"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":"2004.09947","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-04-21T12:23:37Z","cross_cats_sorted":[],"title_canon_sha256":"3634266a160c61dad9c487379102aa2073ea69431eec6ec6e85ed617b28cda99","abstract_canon_sha256":"3f67359d6711d9a562612ebe717e4587a3760414181ac3fab0386dd87f0f8142"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:56:55.915000Z","signature_b64":"KDoMdyL50X1HLpVTlx6T+ugzoKRAS7QYIJTK94460gsf/1R08ngOUVNer27T4cjFv/hnAZQKRbh0Gi4TCNErAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e7ae1a7f314dd722a5c459473029f17fe77ba0ffdc683a48cdedb5abbf9d78a","last_reissued_at":"2026-07-05T00:56:55.914566Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:56:55.914566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ringel's tree packing conjecture in quasirandom graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Katherine Staden, Peter Keevash","submitted_at":"2020-04-21T12:23:37Z","abstract_excerpt":"We prove that any quasirandom graph with $n$ vertices and $rn$ edges can be decomposed into $n$ copies of any fixed tree with $r$ edges. The case of decomposing a complete graph establishes a conjecture of Ringel from 1963."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.09947","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/2004.09947/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":"2004.09947","created_at":"2026-07-05T00:56:55.914625+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.09947v1","created_at":"2026-07-05T00:56:55.914625+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.09947","created_at":"2026-07-05T00:56:55.914625+00:00"},{"alias_kind":"pith_short_12","alias_value":"DZ5ODJ7TCTOX","created_at":"2026-07-05T00:56:55.914625+00:00"},{"alias_kind":"pith_short_16","alias_value":"DZ5ODJ7TCTOXEKS4","created_at":"2026-07-05T00:56:55.914625+00:00"},{"alias_kind":"pith_short_8","alias_value":"DZ5ODJ7T","created_at":"2026-07-05T00:56:55.914625+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.13945","citing_title":"Restricted subgraphs of edge-colored graphs and applications","ref_index":64,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DZ5ODJ7TCTOXEKS4IWKHGAU7C7","json":"https://pith.science/pith/DZ5ODJ7TCTOXEKS4IWKHGAU7C7.json","graph_json":"https://pith.science/api/pith-number/DZ5ODJ7TCTOXEKS4IWKHGAU7C7/graph.json","events_json":"https://pith.science/api/pith-number/DZ5ODJ7TCTOXEKS4IWKHGAU7C7/events.json","paper":"https://pith.science/paper/DZ5ODJ7T"},"agent_actions":{"view_html":"https://pith.science/pith/DZ5ODJ7TCTOXEKS4IWKHGAU7C7","download_json":"https://pith.science/pith/DZ5ODJ7TCTOXEKS4IWKHGAU7C7.json","view_paper":"https://pith.science/paper/DZ5ODJ7T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.09947&json=true","fetch_graph":"https://pith.science/api/pith-number/DZ5ODJ7TCTOXEKS4IWKHGAU7C7/graph.json","fetch_events":"https://pith.science/api/pith-number/DZ5ODJ7TCTOXEKS4IWKHGAU7C7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DZ5ODJ7TCTOXEKS4IWKHGAU7C7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DZ5ODJ7TCTOXEKS4IWKHGAU7C7/action/storage_attestation","attest_author":"https://pith.science/pith/DZ5ODJ7TCTOXEKS4IWKHGAU7C7/action/author_attestation","sign_citation":"https://pith.science/pith/DZ5ODJ7TCTOXEKS4IWKHGAU7C7/action/citation_signature","submit_replication":"https://pith.science/pith/DZ5ODJ7TCTOXEKS4IWKHGAU7C7/action/replication_record"}},"created_at":"2026-07-05T00:56:55.914625+00:00","updated_at":"2026-07-05T00:56:55.914625+00:00"}