{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:I52ECNDUQEDTLEU2EVWYSARGF5","short_pith_number":"pith:I52ECNDU","schema_version":"1.0","canonical_sha256":"4774413474810735929a256d8902262f5b45c8c7cb4582784436dc6531a848e1","source":{"kind":"arxiv","id":"0802.1332","version":2},"attestation_state":"computed","paper":{"title":"A connection between palindromic and factor complexity using return words","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alessandro De Luca, Amy Glen, Luca Q. Zamboni, Michelangelo Bucci","submitted_at":"2008-02-10T17:17:59Z","abstract_excerpt":"In this paper we prove that for any infinite word W whose set of factors is closed under reversal, the following conditions are equivalent:\n  (I) all complete returns to palindromes are palindromes;\n  (II) P(n) + P(n+1) = C(n+1) - C(n) + 2 for all n, where P (resp. C) denotes the palindromic complexity (resp. factor complexity) function of W, which counts the number of distinct palindromic factors (resp. factors) of each length in W."},"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":"0802.1332","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2008-02-10T17:17:59Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4d74e9253c7b7b751dea973d80ab07011e88166d1fb876e494fcde136ff4146b","abstract_canon_sha256":"8bcbfe9b064159b69b58031e5a73966faaa75d3c35ad749e9ae8c4b8990ef01e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:25:48.291373Z","signature_b64":"FyxyRV7Cs3fcYndOsyt4C5MfvFF4aYnV89nsRxckqw6sLHoj+RKSbF5yOYakvfa4qY+JuYPWwrSOzBWS1MTKAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4774413474810735929a256d8902262f5b45c8c7cb4582784436dc6531a848e1","last_reissued_at":"2026-07-04T17:25:48.290844Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:25:48.290844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A connection between palindromic and factor complexity using return words","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alessandro De Luca, Amy Glen, Luca Q. Zamboni, Michelangelo Bucci","submitted_at":"2008-02-10T17:17:59Z","abstract_excerpt":"In this paper we prove that for any infinite word W whose set of factors is closed under reversal, the following conditions are equivalent:\n  (I) all complete returns to palindromes are palindromes;\n  (II) P(n) + P(n+1) = C(n+1) - C(n) + 2 for all n, where P (resp. C) denotes the palindromic complexity (resp. factor complexity) function of W, which counts the number of distinct palindromic factors (resp. factors) of each length in W."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.1332","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0802.1332/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":"0802.1332","created_at":"2026-07-04T17:25:48.290930+00:00"},{"alias_kind":"arxiv_version","alias_value":"0802.1332v2","created_at":"2026-07-04T17:25:48.290930+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.1332","created_at":"2026-07-04T17:25:48.290930+00:00"},{"alias_kind":"pith_short_12","alias_value":"I52ECNDUQEDT","created_at":"2026-07-04T17:25:48.290930+00:00"},{"alias_kind":"pith_short_16","alias_value":"I52ECNDUQEDTLEU2","created_at":"2026-07-04T17:25:48.290930+00:00"},{"alias_kind":"pith_short_8","alias_value":"I52ECNDU","created_at":"2026-07-04T17:25:48.290930+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I52ECNDUQEDTLEU2EVWYSARGF5","json":"https://pith.science/pith/I52ECNDUQEDTLEU2EVWYSARGF5.json","graph_json":"https://pith.science/api/pith-number/I52ECNDUQEDTLEU2EVWYSARGF5/graph.json","events_json":"https://pith.science/api/pith-number/I52ECNDUQEDTLEU2EVWYSARGF5/events.json","paper":"https://pith.science/paper/I52ECNDU"},"agent_actions":{"view_html":"https://pith.science/pith/I52ECNDUQEDTLEU2EVWYSARGF5","download_json":"https://pith.science/pith/I52ECNDUQEDTLEU2EVWYSARGF5.json","view_paper":"https://pith.science/paper/I52ECNDU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0802.1332&json=true","fetch_graph":"https://pith.science/api/pith-number/I52ECNDUQEDTLEU2EVWYSARGF5/graph.json","fetch_events":"https://pith.science/api/pith-number/I52ECNDUQEDTLEU2EVWYSARGF5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I52ECNDUQEDTLEU2EVWYSARGF5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I52ECNDUQEDTLEU2EVWYSARGF5/action/storage_attestation","attest_author":"https://pith.science/pith/I52ECNDUQEDTLEU2EVWYSARGF5/action/author_attestation","sign_citation":"https://pith.science/pith/I52ECNDUQEDTLEU2EVWYSARGF5/action/citation_signature","submit_replication":"https://pith.science/pith/I52ECNDUQEDTLEU2EVWYSARGF5/action/replication_record"}},"created_at":"2026-07-04T17:25:48.290930+00:00","updated_at":"2026-07-04T17:25:48.290930+00:00"}