{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YZIMSJTILSJ4S5PLFHUBGD4ABE","short_pith_number":"pith:YZIMSJTI","canonical_record":{"source":{"id":"1309.1886","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-07T17:26:34Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"dfc1578597f8191586a4c5e667bcfb78f36994ec142cd28249e32e6e87c61ab7","abstract_canon_sha256":"49dc5cb2b8bebc8f9bef6ebad5dfbf83b164688da592e3722a6c1b770c5bfe7e"},"schema_version":"1.0"},"canonical_sha256":"c650c926685c93c975eb29e8130f8009231816e7f8e05ffa424f148707596a01","source":{"kind":"arxiv","id":"1309.1886","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1886","created_at":"2026-05-18T02:54:56Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1886v2","created_at":"2026-05-18T02:54:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1886","created_at":"2026-05-18T02:54:56Z"},{"alias_kind":"pith_short_12","alias_value":"YZIMSJTILSJ4","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YZIMSJTILSJ4S5PL","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YZIMSJTI","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YZIMSJTILSJ4S5PLFHUBGD4ABE","target":"record","payload":{"canonical_record":{"source":{"id":"1309.1886","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-07T17:26:34Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"dfc1578597f8191586a4c5e667bcfb78f36994ec142cd28249e32e6e87c61ab7","abstract_canon_sha256":"49dc5cb2b8bebc8f9bef6ebad5dfbf83b164688da592e3722a6c1b770c5bfe7e"},"schema_version":"1.0"},"canonical_sha256":"c650c926685c93c975eb29e8130f8009231816e7f8e05ffa424f148707596a01","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:56.141272Z","signature_b64":"PiBGVn2eJurZepozdW4MwzKhLTUlliAZ9tCkiHDkpy5FEr9RaR3nqKi/N6IlkHaSba51xwJN1UptJyYnWFEyCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c650c926685c93c975eb29e8130f8009231816e7f8e05ffa424f148707596a01","last_reissued_at":"2026-05-18T02:54:56.140789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:56.140789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.1886","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-18T02:54:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bFLLT7nVofzjFfnon6C0lbjatpN9uwLWqTYst119ZfJQH+j5SgvNsm9BLw39Cn1xUWgNFtRryILEiU3UCK1UDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T20:43:11.963807Z"},"content_sha256":"c82ce49284adec3760273959c20898b0f81b6bc6b87f1550a828c55ef8bb1f69","schema_version":"1.0","event_id":"sha256:c82ce49284adec3760273959c20898b0f81b6bc6b87f1550a828c55ef8bb1f69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YZIMSJTILSJ4S5PLFHUBGD4ABE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Generating Binary Words Palindromically","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"L.Q. Zamboni, Mari Huova, Tero Harju","submitted_at":"2013-09-07T17:26:34Z","abstract_excerpt":"We regard a finite word $u=u_1u_2\\cdots u_n$ up to word isomorphism as an equivalence relation on $\\{1,2,\\ldots, n\\}$ where $i$ is equivalent to $j$ if and only if $x_i=x_j.$ Some finite words (in particular all binary words) are generated by \"{\\it palindromic}\" relations of the form $k\\sim j+i-k$ for some choice of $1\\leq i\\leq j\\leq n$ and $k\\in \\{i,i+1,\\ldots,j\\}.$ That is to say, some finite words $u$ are uniquely determined up to word isomorphism by the position and length of some of its palindromic factors. In this paper we study the function $\\mu(u)$ defined as the least number of palin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1886","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-18T02:54:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+9eNR9Q8ap9FCwKHPyEP2I5TLbOoG0zLWsN4QNp1Z2YGAoZskCkcp8oXd5ghdg2r51iAQ9kkbti6VVGbuYxjAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T20:43:11.964145Z"},"content_sha256":"2a71c0801c768cb2f31ca05a67c0859437fe882ca66a963ba34ea76baa11944f","schema_version":"1.0","event_id":"sha256:2a71c0801c768cb2f31ca05a67c0859437fe882ca66a963ba34ea76baa11944f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YZIMSJTILSJ4S5PLFHUBGD4ABE/bundle.json","state_url":"https://pith.science/pith/YZIMSJTILSJ4S5PLFHUBGD4ABE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YZIMSJTILSJ4S5PLFHUBGD4ABE/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-29T20:43:11Z","links":{"resolver":"https://pith.science/pith/YZIMSJTILSJ4S5PLFHUBGD4ABE","bundle":"https://pith.science/pith/YZIMSJTILSJ4S5PLFHUBGD4ABE/bundle.json","state":"https://pith.science/pith/YZIMSJTILSJ4S5PLFHUBGD4ABE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YZIMSJTILSJ4S5PLFHUBGD4ABE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YZIMSJTILSJ4S5PLFHUBGD4ABE","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":"49dc5cb2b8bebc8f9bef6ebad5dfbf83b164688da592e3722a6c1b770c5bfe7e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-07T17:26:34Z","title_canon_sha256":"dfc1578597f8191586a4c5e667bcfb78f36994ec142cd28249e32e6e87c61ab7"},"schema_version":"1.0","source":{"id":"1309.1886","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1886","created_at":"2026-05-18T02:54:56Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1886v2","created_at":"2026-05-18T02:54:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1886","created_at":"2026-05-18T02:54:56Z"},{"alias_kind":"pith_short_12","alias_value":"YZIMSJTILSJ4","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"YZIMSJTILSJ4S5PL","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"YZIMSJTI","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:2a71c0801c768cb2f31ca05a67c0859437fe882ca66a963ba34ea76baa11944f","target":"graph","created_at":"2026-05-18T02:54:56Z","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 regard a finite word $u=u_1u_2\\cdots u_n$ up to word isomorphism as an equivalence relation on $\\{1,2,\\ldots, n\\}$ where $i$ is equivalent to $j$ if and only if $x_i=x_j.$ Some finite words (in particular all binary words) are generated by \"{\\it palindromic}\" relations of the form $k\\sim j+i-k$ for some choice of $1\\leq i\\leq j\\leq n$ and $k\\in \\{i,i+1,\\ldots,j\\}.$ That is to say, some finite words $u$ are uniquely determined up to word isomorphism by the position and length of some of its palindromic factors. In this paper we study the function $\\mu(u)$ defined as the least number of palin","authors_text":"L.Q. Zamboni, Mari Huova, Tero Harju","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-07T17:26:34Z","title":"On Generating Binary Words Palindromically"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1886","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:c82ce49284adec3760273959c20898b0f81b6bc6b87f1550a828c55ef8bb1f69","target":"record","created_at":"2026-05-18T02:54:56Z","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":"49dc5cb2b8bebc8f9bef6ebad5dfbf83b164688da592e3722a6c1b770c5bfe7e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-07T17:26:34Z","title_canon_sha256":"dfc1578597f8191586a4c5e667bcfb78f36994ec142cd28249e32e6e87c61ab7"},"schema_version":"1.0","source":{"id":"1309.1886","kind":"arxiv","version":2}},"canonical_sha256":"c650c926685c93c975eb29e8130f8009231816e7f8e05ffa424f148707596a01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c650c926685c93c975eb29e8130f8009231816e7f8e05ffa424f148707596a01","first_computed_at":"2026-05-18T02:54:56.140789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:56.140789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PiBGVn2eJurZepozdW4MwzKhLTUlliAZ9tCkiHDkpy5FEr9RaR3nqKi/N6IlkHaSba51xwJN1UptJyYnWFEyCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:56.141272Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.1886","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c82ce49284adec3760273959c20898b0f81b6bc6b87f1550a828c55ef8bb1f69","sha256:2a71c0801c768cb2f31ca05a67c0859437fe882ca66a963ba34ea76baa11944f"],"state_sha256":"2a0a46017f99a2e048572b5c7072b4de5ca4459bdc84c8d70840425f5fe71cd8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SO1QrzlEkJv55eilDBsijLv/MInefovGLYS19dXHj0plBg6T+EYcIsSZZ1joPWW9UHrkzqUSMRPm4SFiesAcAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T20:43:11.966031Z","bundle_sha256":"b0b44dc334f84b5a438b7dd2ac523bd8e857062e42d1b741898d913e6966f6aa"}}