{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LWU5CLWGIH73BH7OYTANXK26DE","short_pith_number":"pith:LWU5CLWG","canonical_record":{"source":{"id":"1505.02695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-11T16:24:52Z","cross_cats_sorted":[],"title_canon_sha256":"4ad3b290aea81f18fccf57ba94436bfcf55a86c2fa06c8fb8d8b307b9b1fb74c","abstract_canon_sha256":"551dcc2cbde1a10b45c9cabac558ca8d7b255c1ac43e6a5c705203ca6a88062b"},"schema_version":"1.0"},"canonical_sha256":"5da9d12ec641ffb09feec4c0dbab5e192c5f71653c22b79930ad67889ec3eac0","source":{"kind":"arxiv","id":"1505.02695","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02695","created_at":"2026-05-18T02:16:11Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02695v1","created_at":"2026-05-18T02:16:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02695","created_at":"2026-05-18T02:16:11Z"},{"alias_kind":"pith_short_12","alias_value":"LWU5CLWGIH73","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LWU5CLWGIH73BH7O","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LWU5CLWG","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LWU5CLWGIH73BH7OYTANXK26DE","target":"record","payload":{"canonical_record":{"source":{"id":"1505.02695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-11T16:24:52Z","cross_cats_sorted":[],"title_canon_sha256":"4ad3b290aea81f18fccf57ba94436bfcf55a86c2fa06c8fb8d8b307b9b1fb74c","abstract_canon_sha256":"551dcc2cbde1a10b45c9cabac558ca8d7b255c1ac43e6a5c705203ca6a88062b"},"schema_version":"1.0"},"canonical_sha256":"5da9d12ec641ffb09feec4c0dbab5e192c5f71653c22b79930ad67889ec3eac0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:11.839557Z","signature_b64":"F+54r1Lqo4bD2U0e6r8UceHsZpwLjufMEL7KA0Pl17mPDsFTuVlQaFpEulbTVe33OHR9cwy/zz1RKLrE4vyJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5da9d12ec641ffb09feec4c0dbab5e192c5f71653c22b79930ad67889ec3eac0","last_reissued_at":"2026-05-18T02:16:11.839048Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:11.839048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.02695","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-05-18T02:16:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i70W77IRV0gpv8BWbnZyQiBi5tOMu4QOxWIcafokYrFRtV5CLvkDX39mczyBzk2FEAQxVh5pIoYu9U6jpmkMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T07:50:59.861334Z"},"content_sha256":"62c3dab77d15344e9a4e558d26154dacee2b327f0ac4e2cf99ea182a8364b2f7","schema_version":"1.0","event_id":"sha256:62c3dab77d15344e9a4e558d26154dacee2b327f0ac4e2cf99ea182a8364b2f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LWU5CLWGIH73BH7OYTANXK26DE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Palindromic complexity of trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nadia Lafreni\\`ere, Sre\\v{c}ko Brlek, Xavier Proven\\c{c}al","submitted_at":"2015-05-11T16:24:52Z","abstract_excerpt":"We consider finite trees with edges labeled by letters on a finite alphabet $\\varSigma$. Each pair of nodes defines a unique labeled path whose trace is a word of the free monoid $\\varSigma^*$. The set of all such words defines the language of the tree. In this paper, we investigate the palindromic complexity of trees and provide hints for an upper bound on the number of distinct palindromes in the language of a tree."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02695","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"},"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-18T02:16:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2/UbKWuRA94Y9BPmh/WiPApq3/RC0GD/bM31NG3Rw746ynOtY98r14WFpIvgEHuJe0PI/rB4VC93DePhLSqnBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T07:50:59.861680Z"},"content_sha256":"cc36a5d23f52d06fe488702fa522f825c77d812f3116ea02687d3703bb3f4724","schema_version":"1.0","event_id":"sha256:cc36a5d23f52d06fe488702fa522f825c77d812f3116ea02687d3703bb3f4724"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LWU5CLWGIH73BH7OYTANXK26DE/bundle.json","state_url":"https://pith.science/pith/LWU5CLWGIH73BH7OYTANXK26DE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LWU5CLWGIH73BH7OYTANXK26DE/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-06-23T07:50:59Z","links":{"resolver":"https://pith.science/pith/LWU5CLWGIH73BH7OYTANXK26DE","bundle":"https://pith.science/pith/LWU5CLWGIH73BH7OYTANXK26DE/bundle.json","state":"https://pith.science/pith/LWU5CLWGIH73BH7OYTANXK26DE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LWU5CLWGIH73BH7OYTANXK26DE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LWU5CLWGIH73BH7OYTANXK26DE","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":"551dcc2cbde1a10b45c9cabac558ca8d7b255c1ac43e6a5c705203ca6a88062b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-11T16:24:52Z","title_canon_sha256":"4ad3b290aea81f18fccf57ba94436bfcf55a86c2fa06c8fb8d8b307b9b1fb74c"},"schema_version":"1.0","source":{"id":"1505.02695","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02695","created_at":"2026-05-18T02:16:11Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02695v1","created_at":"2026-05-18T02:16:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02695","created_at":"2026-05-18T02:16:11Z"},{"alias_kind":"pith_short_12","alias_value":"LWU5CLWGIH73","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LWU5CLWGIH73BH7O","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LWU5CLWG","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:cc36a5d23f52d06fe488702fa522f825c77d812f3116ea02687d3703bb3f4724","target":"graph","created_at":"2026-05-18T02:16:11Z","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":"We consider finite trees with edges labeled by letters on a finite alphabet $\\varSigma$. Each pair of nodes defines a unique labeled path whose trace is a word of the free monoid $\\varSigma^*$. The set of all such words defines the language of the tree. In this paper, we investigate the palindromic complexity of trees and provide hints for an upper bound on the number of distinct palindromes in the language of a tree.","authors_text":"Nadia Lafreni\\`ere, Sre\\v{c}ko Brlek, Xavier Proven\\c{c}al","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-11T16:24:52Z","title":"Palindromic complexity of trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02695","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:62c3dab77d15344e9a4e558d26154dacee2b327f0ac4e2cf99ea182a8364b2f7","target":"record","created_at":"2026-05-18T02:16:11Z","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":"551dcc2cbde1a10b45c9cabac558ca8d7b255c1ac43e6a5c705203ca6a88062b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-11T16:24:52Z","title_canon_sha256":"4ad3b290aea81f18fccf57ba94436bfcf55a86c2fa06c8fb8d8b307b9b1fb74c"},"schema_version":"1.0","source":{"id":"1505.02695","kind":"arxiv","version":1}},"canonical_sha256":"5da9d12ec641ffb09feec4c0dbab5e192c5f71653c22b79930ad67889ec3eac0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5da9d12ec641ffb09feec4c0dbab5e192c5f71653c22b79930ad67889ec3eac0","first_computed_at":"2026-05-18T02:16:11.839048Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:11.839048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F+54r1Lqo4bD2U0e6r8UceHsZpwLjufMEL7KA0Pl17mPDsFTuVlQaFpEulbTVe33OHR9cwy/zz1RKLrE4vyJCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:11.839557Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.02695","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62c3dab77d15344e9a4e558d26154dacee2b327f0ac4e2cf99ea182a8364b2f7","sha256:cc36a5d23f52d06fe488702fa522f825c77d812f3116ea02687d3703bb3f4724"],"state_sha256":"64d6e2562c21fdc669c14ff30afa87917ffca1a93b4ed2c252b91bffde260a42"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uhzWrTB+J9C3ab15FgcO+508NxCLAy3gmdBhl9YW2FSCNdDOEY4ma6X3waJrgdXLRf5jOHEZ0wsAParw2/PLBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T07:50:59.863657Z","bundle_sha256":"9946be08195905699bc102d1992de6d9458902dac2a3199b80f83a5f46c666a9"}}