{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:ZX53BTGO24VZL3QTDQ3ZXQ3J3X","short_pith_number":"pith:ZX53BTGO","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"},"canonical_sha256":"cdfbb0ccced72b95ee131c379bc369ddd6d9fe122ef11b7dafda1664c438fd3e","source":{"kind":"arxiv","id":"1003.3045","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.3045","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1003.3045v2","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.3045","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"ZX53BTGO24VZ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"ZX53BTGO24VZL3QT","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"ZX53BTGO","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:ZX53BTGO24VZL3QTDQ3ZXQ3J3X","target":"record","payload":{"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"},"canonical_sha256":"cdfbb0ccced72b95ee131c379bc369ddd6d9fe122ef11b7dafda1664c438fd3e","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"},"source_kind":"arxiv","source_id":"1003.3045","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-18T04:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BI5vXt+oOzinwBWK5xciQ/gufCJdBl2Q82QXzdsHlHA495ccz0hs7O3w1pc2cWpzNb3pqkmRk9fDucCv657YCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:12:37.950934Z"},"content_sha256":"b6662424a73a8ceb254df3981542e909f993861f30c31bde4fa753840aa9aad1","schema_version":"1.0","event_id":"sha256:b6662424a73a8ceb254df3981542e909f993861f30c31bde4fa753840aa9aad1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:ZX53BTGO24VZL3QTDQ3ZXQ3J3X","target":"graph","payload":{"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"},"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-18T04:42:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QkJxyxVk9Nv/9h9EWvdsfQj7saOmZTq1c9i2OhX8u8XgUx3UU67pEnX0d1ZIMTQDZpSmDkE/iYNfaqcltD6nCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:12:37.951273Z"},"content_sha256":"ca0ea80c2323b7b0115ff685ceb63410b1e269dc5fd8ddb3909dbdb8830830b5","schema_version":"1.0","event_id":"sha256:ca0ea80c2323b7b0115ff685ceb63410b1e269dc5fd8ddb3909dbdb8830830b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZX53BTGO24VZL3QTDQ3ZXQ3J3X/bundle.json","state_url":"https://pith.science/pith/ZX53BTGO24VZL3QTDQ3ZXQ3J3X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZX53BTGO24VZL3QTDQ3ZXQ3J3X/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-28T11:12:37Z","links":{"resolver":"https://pith.science/pith/ZX53BTGO24VZL3QTDQ3ZXQ3J3X","bundle":"https://pith.science/pith/ZX53BTGO24VZL3QTDQ3ZXQ3J3X/bundle.json","state":"https://pith.science/pith/ZX53BTGO24VZL3QTDQ3ZXQ3J3X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZX53BTGO24VZL3QTDQ3ZXQ3J3X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ZX53BTGO24VZL3QTDQ3ZXQ3J3X","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":"9f66789e55712a9e39730c8eea0595022fd75d89b25af5f6e0b0a00036673231","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-03-15T22:42:57Z","title_canon_sha256":"e4bb147def4c6fcf28d9b9f583a64ad5bbd53c8669f2a6f104822bb6bab12f49"},"schema_version":"1.0","source":{"id":"1003.3045","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1003.3045","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"arxiv_version","alias_value":"1003.3045v2","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1003.3045","created_at":"2026-05-18T04:42:03Z"},{"alias_kind":"pith_short_12","alias_value":"ZX53BTGO24VZ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"ZX53BTGO24VZL3QT","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"ZX53BTGO","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:ca0ea80c2323b7b0115ff685ceb63410b1e269dc5fd8ddb3909dbdb8830830b5","target":"graph","created_at":"2026-05-18T04:42:03Z","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":"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.","authors_text":"Wenjie Fang","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-03-15T22:42:57Z","title":"A Computational Approach to the Graceful Tree Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1003.3045","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:b6662424a73a8ceb254df3981542e909f993861f30c31bde4fa753840aa9aad1","target":"record","created_at":"2026-05-18T04:42:03Z","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":"9f66789e55712a9e39730c8eea0595022fd75d89b25af5f6e0b0a00036673231","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2010-03-15T22:42:57Z","title_canon_sha256":"e4bb147def4c6fcf28d9b9f583a64ad5bbd53c8669f2a6f104822bb6bab12f49"},"schema_version":"1.0","source":{"id":"1003.3045","kind":"arxiv","version":2}},"canonical_sha256":"cdfbb0ccced72b95ee131c379bc369ddd6d9fe122ef11b7dafda1664c438fd3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdfbb0ccced72b95ee131c379bc369ddd6d9fe122ef11b7dafda1664c438fd3e","first_computed_at":"2026-05-18T04:42:03.272411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:42:03.272411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7AcsfsasgandmCzFdeo3k33edIdSNTrezc12VQruVtOtCT5Bgxj57ObGTgdJqmiTGhajnTl57pPgbfMdMyk7Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:42:03.272864Z","signed_message":"canonical_sha256_bytes"},"source_id":"1003.3045","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6662424a73a8ceb254df3981542e909f993861f30c31bde4fa753840aa9aad1","sha256:ca0ea80c2323b7b0115ff685ceb63410b1e269dc5fd8ddb3909dbdb8830830b5"],"state_sha256":"1058f8354082e288cbda8149d7f5efcfc64fa1edc64bae89b071874082c96c19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P6k254fUBHpczfUGaocWNP92B8X0itww84ROHaJw4s6jcTmKgmWG8E4JaUvRGeOYOISGyiOVF4jaUD6BjsjcAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:12:37.953157Z","bundle_sha256":"83fbf97ec7fa9a60d9fa2b755cbec988d1e7bba13deec2ed2e95654e3a5c75aa"}}