{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ZX53BTGO24VZL3QTDQ3ZXQ3J3X","short_pith_number":"pith:ZX53BTGO","schema_version":"1.0","canonical_sha256":"cdfbb0ccced72b95ee131c379bc369ddd6d9fe122ef11b7dafda1664c438fd3e","source":{"kind":"arxiv","id":"1003.3045","version":2},"attestation_state":"computed","paper":{"title":"A Computational Approach to the Graceful Tree Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Wenjie Fang","submitted_at":"2010-03-15T22:42:57Z","abstract_excerpt":"Graceful tree conjecture is a well-known open problem in graph theory. Here we present a computational approach to this conjecture. An algorithm for finding graceful labelling for trees is proposed. With this algorithm, we show that every tree with at most 35 vertices allows a graceful labelling, hence we verify that the graceful tree conjecture is correct for trees with at most 35 vertices."},"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":"1003.3045","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-03-15T22:42:57Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e4bb147def4c6fcf28d9b9f583a64ad5bbd53c8669f2a6f104822bb6bab12f49","abstract_canon_sha256":"9f66789e55712a9e39730c8eea0595022fd75d89b25af5f6e0b0a00036673231"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:42:03.272864Z","signature_b64":"7AcsfsasgandmCzFdeo3k33edIdSNTrezc12VQruVtOtCT5Bgxj57ObGTgdJqmiTGhajnTl57pPgbfMdMyk7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdfbb0ccced72b95ee131c379bc369ddd6d9fe122ef11b7dafda1664c438fd3e","last_reissued_at":"2026-05-18T04:42:03.272411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:42:03.272411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Computational Approach to the Graceful Tree Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Wenjie Fang","submitted_at":"2010-03-15T22:42:57Z","abstract_excerpt":"Graceful tree conjecture is a well-known open problem in graph theory. Here we present a computational approach to this conjecture. An algorithm for finding graceful labelling for trees is proposed. With this algorithm, we show that every tree with at most 35 vertices allows a graceful labelling, hence we verify that the graceful tree conjecture is correct for trees with at most 35 vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.3045","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":"1003.3045","created_at":"2026-05-18T04:42:03.272479+00:00"},{"alias_kind":"arxiv_version","alias_value":"1003.3045v2","created_at":"2026-05-18T04:42:03.272479+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.3045","created_at":"2026-05-18T04:42:03.272479+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZX53BTGO24VZ","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZX53BTGO24VZL3QT","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZX53BTGO","created_at":"2026-05-18T12:26:18.847500+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.02303","citing_title":"Graceful labelings of spiders with three-edge legs and pendant leaves at the center","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZX53BTGO24VZL3QTDQ3ZXQ3J3X","json":"https://pith.science/pith/ZX53BTGO24VZL3QTDQ3ZXQ3J3X.json","graph_json":"https://pith.science/api/pith-number/ZX53BTGO24VZL3QTDQ3ZXQ3J3X/graph.json","events_json":"https://pith.science/api/pith-number/ZX53BTGO24VZL3QTDQ3ZXQ3J3X/events.json","paper":"https://pith.science/paper/ZX53BTGO"},"agent_actions":{"view_html":"https://pith.science/pith/ZX53BTGO24VZL3QTDQ3ZXQ3J3X","download_json":"https://pith.science/pith/ZX53BTGO24VZL3QTDQ3ZXQ3J3X.json","view_paper":"https://pith.science/paper/ZX53BTGO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1003.3045&json=true","fetch_graph":"https://pith.science/api/pith-number/ZX53BTGO24VZL3QTDQ3ZXQ3J3X/graph.json","fetch_events":"https://pith.science/api/pith-number/ZX53BTGO24VZL3QTDQ3ZXQ3J3X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZX53BTGO24VZL3QTDQ3ZXQ3J3X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZX53BTGO24VZL3QTDQ3ZXQ3J3X/action/storage_attestation","attest_author":"https://pith.science/pith/ZX53BTGO24VZL3QTDQ3ZXQ3J3X/action/author_attestation","sign_citation":"https://pith.science/pith/ZX53BTGO24VZL3QTDQ3ZXQ3J3X/action/citation_signature","submit_replication":"https://pith.science/pith/ZX53BTGO24VZL3QTDQ3ZXQ3J3X/action/replication_record"}},"created_at":"2026-05-18T04:42:03.272479+00:00","updated_at":"2026-05-18T04:42:03.272479+00:00"}