{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:SLJ4PRT6DJDACWUXMULQ6CJ6CS","short_pith_number":"pith:SLJ4PRT6","canonical_record":{"source":{"id":"2504.06556","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-09T03:35:21Z","cross_cats_sorted":[],"title_canon_sha256":"0c0aaee6f3cc6ed656661cbdefb20a22d993c35f2c7bc65b6af6bd89fddd567c","abstract_canon_sha256":"133eb4a3cc2de68650c243e0e90c36bcfd522195fc339179ceb008d34d0f684b"},"schema_version":"1.0"},"canonical_sha256":"92d3c7c67e1a46015a9765170f093e14adbe509d6737f5258bd8123739a6f4a8","source":{"kind":"arxiv","id":"2504.06556","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.06556","created_at":"2026-07-05T10:46:28Z"},{"alias_kind":"arxiv_version","alias_value":"2504.06556v1","created_at":"2026-07-05T10:46:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.06556","created_at":"2026-07-05T10:46:28Z"},{"alias_kind":"pith_short_12","alias_value":"SLJ4PRT6DJDA","created_at":"2026-07-05T10:46:28Z"},{"alias_kind":"pith_short_16","alias_value":"SLJ4PRT6DJDACWUX","created_at":"2026-07-05T10:46:28Z"},{"alias_kind":"pith_short_8","alias_value":"SLJ4PRT6","created_at":"2026-07-05T10:46:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:SLJ4PRT6DJDACWUXMULQ6CJ6CS","target":"record","payload":{"canonical_record":{"source":{"id":"2504.06556","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-09T03:35:21Z","cross_cats_sorted":[],"title_canon_sha256":"0c0aaee6f3cc6ed656661cbdefb20a22d993c35f2c7bc65b6af6bd89fddd567c","abstract_canon_sha256":"133eb4a3cc2de68650c243e0e90c36bcfd522195fc339179ceb008d34d0f684b"},"schema_version":"1.0"},"canonical_sha256":"92d3c7c67e1a46015a9765170f093e14adbe509d6737f5258bd8123739a6f4a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:46:28.894079Z","signature_b64":"wwXKCmouqnar1lOBkwrtFtpVUhatqRyXYFtCeZ9tPFJlNOWM7kK/O1baT2XsiBQ25ILAIV9YOo2Po/sKE/rCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92d3c7c67e1a46015a9765170f093e14adbe509d6737f5258bd8123739a6f4a8","last_reissued_at":"2026-07-05T10:46:28.893692Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:46:28.893692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.06556","source_version":1,"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-07-05T10:46:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LDCmL+kBwmGYBB0kAjgWsZZ8tpsym0qERA7coRUUPOsmjz8SDf8RAgu9FkAaW/EP7XGm+mIc/Lr1ayGUT8jYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T05:38:48.321146Z"},"content_sha256":"048f2c998b4e6e26e733c597df409298832b6fc63d545ef50bfee9e2cb8b1b98","schema_version":"1.0","event_id":"sha256:048f2c998b4e6e26e733c597df409298832b6fc63d545ef50bfee9e2cb8b1b98"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:SLJ4PRT6DJDACWUXMULQ6CJ6CS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Bounds for Codes over Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Tingting Chen, Wenjie Zhong, Xiande Zhang, Yanzhi Li","submitted_at":"2025-04-09T03:35:21Z","abstract_excerpt":"Codes over trees were introduced recently to bridge graph theory and coding theory with diverse applications in computer science and beyond. A central challenge lies in determining the maximum number of labelled trees over $n$ nodes with pairwise distance at least $d$, denoted by $A(n,d)$, where the distance between any two labelled trees is the minimum number of edit edge operations in order to transform one tree to another. By various tools from graph theory and algebra, we show that when $n$ is large, $A(n,d)=O((Cn)^{n-d})$ for any $d\\leq n-2$, and $A(n,d)=\\Omega((cn)^{n-d})$ for any $d$ li"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.06556","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/2504.06556/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"},"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-07-05T10:46:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mBL62sTnKcX4CeOO2rDZSTbAiSW2cCn+4kn33IMOB2gYs7nw7MN1eJxwsguuKA43gRXs6Vc9ujrIYwHQ2k1rDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T05:38:48.321642Z"},"content_sha256":"025c726ec3bf5c6b11d8d7611f2302b7f6543468b346ca246a3dd759873a3661","schema_version":"1.0","event_id":"sha256:025c726ec3bf5c6b11d8d7611f2302b7f6543468b346ca246a3dd759873a3661"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SLJ4PRT6DJDACWUXMULQ6CJ6CS/bundle.json","state_url":"https://pith.science/pith/SLJ4PRT6DJDACWUXMULQ6CJ6CS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SLJ4PRT6DJDACWUXMULQ6CJ6CS/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-08-07T05:38:48Z","links":{"resolver":"https://pith.science/pith/SLJ4PRT6DJDACWUXMULQ6CJ6CS","bundle":"https://pith.science/pith/SLJ4PRT6DJDACWUXMULQ6CJ6CS/bundle.json","state":"https://pith.science/pith/SLJ4PRT6DJDACWUXMULQ6CJ6CS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SLJ4PRT6DJDACWUXMULQ6CJ6CS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:SLJ4PRT6DJDACWUXMULQ6CJ6CS","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":"133eb4a3cc2de68650c243e0e90c36bcfd522195fc339179ceb008d34d0f684b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-09T03:35:21Z","title_canon_sha256":"0c0aaee6f3cc6ed656661cbdefb20a22d993c35f2c7bc65b6af6bd89fddd567c"},"schema_version":"1.0","source":{"id":"2504.06556","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.06556","created_at":"2026-07-05T10:46:28Z"},{"alias_kind":"arxiv_version","alias_value":"2504.06556v1","created_at":"2026-07-05T10:46:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.06556","created_at":"2026-07-05T10:46:28Z"},{"alias_kind":"pith_short_12","alias_value":"SLJ4PRT6DJDA","created_at":"2026-07-05T10:46:28Z"},{"alias_kind":"pith_short_16","alias_value":"SLJ4PRT6DJDACWUX","created_at":"2026-07-05T10:46:28Z"},{"alias_kind":"pith_short_8","alias_value":"SLJ4PRT6","created_at":"2026-07-05T10:46:28Z"}],"graph_snapshots":[{"event_id":"sha256:025c726ec3bf5c6b11d8d7611f2302b7f6543468b346ca246a3dd759873a3661","target":"graph","created_at":"2026-07-05T10:46:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.06556/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Codes over trees were introduced recently to bridge graph theory and coding theory with diverse applications in computer science and beyond. A central challenge lies in determining the maximum number of labelled trees over $n$ nodes with pairwise distance at least $d$, denoted by $A(n,d)$, where the distance between any two labelled trees is the minimum number of edit edge operations in order to transform one tree to another. By various tools from graph theory and algebra, we show that when $n$ is large, $A(n,d)=O((Cn)^{n-d})$ for any $d\\leq n-2$, and $A(n,d)=\\Omega((cn)^{n-d})$ for any $d$ li","authors_text":"Tingting Chen, Wenjie Zhong, Xiande Zhang, Yanzhi Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-09T03:35:21Z","title":"Improved Bounds for Codes over Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.06556","kind":"arxiv","version":1},"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:048f2c998b4e6e26e733c597df409298832b6fc63d545ef50bfee9e2cb8b1b98","target":"record","created_at":"2026-07-05T10:46:28Z","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":"133eb4a3cc2de68650c243e0e90c36bcfd522195fc339179ceb008d34d0f684b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-09T03:35:21Z","title_canon_sha256":"0c0aaee6f3cc6ed656661cbdefb20a22d993c35f2c7bc65b6af6bd89fddd567c"},"schema_version":"1.0","source":{"id":"2504.06556","kind":"arxiv","version":1}},"canonical_sha256":"92d3c7c67e1a46015a9765170f093e14adbe509d6737f5258bd8123739a6f4a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92d3c7c67e1a46015a9765170f093e14adbe509d6737f5258bd8123739a6f4a8","first_computed_at":"2026-07-05T10:46:28.893692Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:46:28.893692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wwXKCmouqnar1lOBkwrtFtpVUhatqRyXYFtCeZ9tPFJlNOWM7kK/O1baT2XsiBQ25ILAIV9YOo2Po/sKE/rCAw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:46:28.894079Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.06556","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:048f2c998b4e6e26e733c597df409298832b6fc63d545ef50bfee9e2cb8b1b98","sha256:025c726ec3bf5c6b11d8d7611f2302b7f6543468b346ca246a3dd759873a3661"],"state_sha256":"b0c38b971323dc5028ff0b6e84cd11e84b228a66ae677cb1bb175aad775d8dec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eju2tLonaV6oxPdyafE5VjT4c2T7hhja7JCZp8AGyMXK2CG4THt0eNKga+ap7bloNreqYrj7ZhZtzGKdF2tLDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T05:38:48.325771Z","bundle_sha256":"6400594aa64bebe1578d294b2bf0dacd0e610d11d5a050cfe7ee939dafb21db2"}}