{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:I52ECNDUQEDTLEU2EVWYSARGF5","short_pith_number":"pith:I52ECNDU","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"},"canonical_sha256":"4774413474810735929a256d8902262f5b45c8c7cb4582784436dc6531a848e1","source":{"kind":"arxiv","id":"0802.1332","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0802.1332","created_at":"2026-07-04T17:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"0802.1332v2","created_at":"2026-07-04T17:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.1332","created_at":"2026-07-04T17:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"I52ECNDUQEDT","created_at":"2026-07-04T17:25:48Z"},{"alias_kind":"pith_short_16","alias_value":"I52ECNDUQEDTLEU2","created_at":"2026-07-04T17:25:48Z"},{"alias_kind":"pith_short_8","alias_value":"I52ECNDU","created_at":"2026-07-04T17:25:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:I52ECNDUQEDTLEU2EVWYSARGF5","target":"record","payload":{"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"},"canonical_sha256":"4774413474810735929a256d8902262f5b45c8c7cb4582784436dc6531a848e1","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"},"source_kind":"arxiv","source_id":"0802.1332","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-07-04T17:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DA4ot1pzKLrtN8aHI+JaTAh8gyA5HkBr7x1J+dR/+tWAw1l0YmFfcu+xt42PKgX4kVOz/bufQwsOnuHTAwI0Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T23:06:19.597233Z"},"content_sha256":"ca2f6a15d924b745a48a19fdeb89ed3eb227d3630f6968861602c1b1b9dc1a5b","schema_version":"1.0","event_id":"sha256:ca2f6a15d924b745a48a19fdeb89ed3eb227d3630f6968861602c1b1b9dc1a5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:I52ECNDUQEDTLEU2EVWYSARGF5","target":"graph","payload":{"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"},"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-04T17:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TO2EBzuOkDNwUVfIzXw6IPXC0S6sbdQEweW/Qz5LrAb6LqFkvV89kFfj14rD006w0IXwWatjxEziXP4YxhihCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T23:06:19.597620Z"},"content_sha256":"ae86b4f9145892b1280a018aa1ae9c93ac3478206458944de0ccd342047c753a","schema_version":"1.0","event_id":"sha256:ae86b4f9145892b1280a018aa1ae9c93ac3478206458944de0ccd342047c753a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I52ECNDUQEDTLEU2EVWYSARGF5/bundle.json","state_url":"https://pith.science/pith/I52ECNDUQEDTLEU2EVWYSARGF5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I52ECNDUQEDTLEU2EVWYSARGF5/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-07-04T23:06:19Z","links":{"resolver":"https://pith.science/pith/I52ECNDUQEDTLEU2EVWYSARGF5","bundle":"https://pith.science/pith/I52ECNDUQEDTLEU2EVWYSARGF5/bundle.json","state":"https://pith.science/pith/I52ECNDUQEDTLEU2EVWYSARGF5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I52ECNDUQEDTLEU2EVWYSARGF5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:I52ECNDUQEDTLEU2EVWYSARGF5","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":"8bcbfe9b064159b69b58031e5a73966faaa75d3c35ad749e9ae8c4b8990ef01e","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"math.CO","submitted_at":"2008-02-10T17:17:59Z","title_canon_sha256":"4d74e9253c7b7b751dea973d80ab07011e88166d1fb876e494fcde136ff4146b"},"schema_version":"1.0","source":{"id":"0802.1332","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0802.1332","created_at":"2026-07-04T17:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"0802.1332v2","created_at":"2026-07-04T17:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0802.1332","created_at":"2026-07-04T17:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"I52ECNDUQEDT","created_at":"2026-07-04T17:25:48Z"},{"alias_kind":"pith_short_16","alias_value":"I52ECNDUQEDTLEU2","created_at":"2026-07-04T17:25:48Z"},{"alias_kind":"pith_short_8","alias_value":"I52ECNDU","created_at":"2026-07-04T17:25:48Z"}],"graph_snapshots":[{"event_id":"sha256:ae86b4f9145892b1280a018aa1ae9c93ac3478206458944de0ccd342047c753a","target":"graph","created_at":"2026-07-04T17:25:48Z","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/0802.1332/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Alessandro De Luca, Amy Glen, Luca Q. Zamboni, Michelangelo Bucci","cross_cats":["cs.DM"],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2008-02-10T17:17:59Z","title":"A connection between palindromic and factor complexity using return words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0802.1332","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:ca2f6a15d924b745a48a19fdeb89ed3eb227d3630f6968861602c1b1b9dc1a5b","target":"record","created_at":"2026-07-04T17:25:48Z","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":"8bcbfe9b064159b69b58031e5a73966faaa75d3c35ad749e9ae8c4b8990ef01e","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"math.CO","submitted_at":"2008-02-10T17:17:59Z","title_canon_sha256":"4d74e9253c7b7b751dea973d80ab07011e88166d1fb876e494fcde136ff4146b"},"schema_version":"1.0","source":{"id":"0802.1332","kind":"arxiv","version":2}},"canonical_sha256":"4774413474810735929a256d8902262f5b45c8c7cb4582784436dc6531a848e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4774413474810735929a256d8902262f5b45c8c7cb4582784436dc6531a848e1","first_computed_at":"2026-07-04T17:25:48.290844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T17:25:48.290844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FyxyRV7Cs3fcYndOsyt4C5MfvFF4aYnV89nsRxckqw6sLHoj+RKSbF5yOYakvfa4qY+JuYPWwrSOzBWS1MTKAA==","signature_status":"signed_v1","signed_at":"2026-07-04T17:25:48.291373Z","signed_message":"canonical_sha256_bytes"},"source_id":"0802.1332","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca2f6a15d924b745a48a19fdeb89ed3eb227d3630f6968861602c1b1b9dc1a5b","sha256:ae86b4f9145892b1280a018aa1ae9c93ac3478206458944de0ccd342047c753a"],"state_sha256":"682f9868420de46be1ddc77dd3e0101fdce24320214521920824ce62d6026c93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HrjOyLP8yMtSUv9X69PFJ9IUct+FlPgYYBP91xmjkYFv6230LNrT8cHZmv5IBy57muNw/D2qpoWUbT50zj1LCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T23:06:19.599576Z","bundle_sha256":"652c1c7440c43d002c5511ff6c82022ca98cfd9494963bb58a145e0e2ec9edc9"}}