{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:A5NRBYSYMKZF2YBIWDVMW2LJRK","short_pith_number":"pith:A5NRBYSY","canonical_record":{"source":{"id":"1612.07881","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-12-23T05:56:52Z","cross_cats_sorted":[],"title_canon_sha256":"06541b65e76e9a83ccf58b1168aacf1055f94a6e8f50fa1a105ffe15e01c22b4","abstract_canon_sha256":"6cf23f6e822fac10636a77c0ce6894d0291425714a2cc04ab9167b0bcd074eac"},"schema_version":"1.0"},"canonical_sha256":"075b10e25862b25d6028b0eacb69698abaa57f957a3df5cad3bf35c492225c98","source":{"kind":"arxiv","id":"1612.07881","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07881","created_at":"2026-05-18T00:54:05Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07881v1","created_at":"2026-05-18T00:54:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07881","created_at":"2026-05-18T00:54:05Z"},{"alias_kind":"pith_short_12","alias_value":"A5NRBYSYMKZF","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"A5NRBYSYMKZF2YBI","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"A5NRBYSY","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:A5NRBYSYMKZF2YBIWDVMW2LJRK","target":"record","payload":{"canonical_record":{"source":{"id":"1612.07881","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-12-23T05:56:52Z","cross_cats_sorted":[],"title_canon_sha256":"06541b65e76e9a83ccf58b1168aacf1055f94a6e8f50fa1a105ffe15e01c22b4","abstract_canon_sha256":"6cf23f6e822fac10636a77c0ce6894d0291425714a2cc04ab9167b0bcd074eac"},"schema_version":"1.0"},"canonical_sha256":"075b10e25862b25d6028b0eacb69698abaa57f957a3df5cad3bf35c492225c98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:05.472356Z","signature_b64":"zvCg7SNXPC//t3KdifDXw0msHfHcjUROfmfdwWigrY9mc/t1nTgBXVuounfYfkGNGhVUt2LZG2c8UO6vyS8UBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"075b10e25862b25d6028b0eacb69698abaa57f957a3df5cad3bf35c492225c98","last_reissued_at":"2026-05-18T00:54:05.471947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:05.471947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.07881","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-18T00:54:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MWxhryRqOJGB6l68xfnkkuEWmgT9+scfFccS925xJFyfSclnb9jNXvsm1V9NwBXuRti9sSMBZpqb57qaN3R8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T23:49:10.807078Z"},"content_sha256":"c0b147a1ced91b7a2c2aa13b5e4fe5e55da217c136e4797adc2432be78f05b41","schema_version":"1.0","event_id":"sha256:c0b147a1ced91b7a2c2aa13b5e4fe5e55da217c136e4797adc2432be78f05b41"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:A5NRBYSYMKZF2YBIWDVMW2LJRK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On incomplete and synchronizing finite sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Arturo Carpi, Flavio D'Alessandro","submitted_at":"2016-12-23T05:56:52Z","abstract_excerpt":"This paper situates itself in the theory of variable length codes and of finite automata where the concepts of completeness and synchronization play a central role. In this theoretical setting, we investigate the problem of finding upper bounds to the minimal length of synchronizing words and incompletable words of a finite language X in terms of the length of the words of X. This problem is related to two well-known conjectures formulated by Cerny and Restivo, respectively. In particular, if Restivo's conjecture is true, our main result provides a quadratic bound for the minimal length of a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07881","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-18T00:54:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ipI5vBIsLRv4OVlgJCV5T6L3T6uQ3b2N2YrOFf4zoInH5L6u4dfMQuwxbhMzWcVUQMgdVRFdX/nDPw4+Pr/4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T23:49:10.807430Z"},"content_sha256":"a702589cc7a9c3050be1a9b587570b8afc3ba9a2177665a77b783c2773c0a1b1","schema_version":"1.0","event_id":"sha256:a702589cc7a9c3050be1a9b587570b8afc3ba9a2177665a77b783c2773c0a1b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A5NRBYSYMKZF2YBIWDVMW2LJRK/bundle.json","state_url":"https://pith.science/pith/A5NRBYSYMKZF2YBIWDVMW2LJRK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A5NRBYSYMKZF2YBIWDVMW2LJRK/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-26T23:49:10Z","links":{"resolver":"https://pith.science/pith/A5NRBYSYMKZF2YBIWDVMW2LJRK","bundle":"https://pith.science/pith/A5NRBYSYMKZF2YBIWDVMW2LJRK/bundle.json","state":"https://pith.science/pith/A5NRBYSYMKZF2YBIWDVMW2LJRK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A5NRBYSYMKZF2YBIWDVMW2LJRK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:A5NRBYSYMKZF2YBIWDVMW2LJRK","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":"6cf23f6e822fac10636a77c0ce6894d0291425714a2cc04ab9167b0bcd074eac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-12-23T05:56:52Z","title_canon_sha256":"06541b65e76e9a83ccf58b1168aacf1055f94a6e8f50fa1a105ffe15e01c22b4"},"schema_version":"1.0","source":{"id":"1612.07881","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07881","created_at":"2026-05-18T00:54:05Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07881v1","created_at":"2026-05-18T00:54:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07881","created_at":"2026-05-18T00:54:05Z"},{"alias_kind":"pith_short_12","alias_value":"A5NRBYSYMKZF","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"A5NRBYSYMKZF2YBI","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"A5NRBYSY","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:a702589cc7a9c3050be1a9b587570b8afc3ba9a2177665a77b783c2773c0a1b1","target":"graph","created_at":"2026-05-18T00:54:05Z","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":"This paper situates itself in the theory of variable length codes and of finite automata where the concepts of completeness and synchronization play a central role. In this theoretical setting, we investigate the problem of finding upper bounds to the minimal length of synchronizing words and incompletable words of a finite language X in terms of the length of the words of X. This problem is related to two well-known conjectures formulated by Cerny and Restivo, respectively. In particular, if Restivo's conjecture is true, our main result provides a quadratic bound for the minimal length of a s","authors_text":"Arturo Carpi, Flavio D'Alessandro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-12-23T05:56:52Z","title":"On incomplete and synchronizing finite sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07881","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:c0b147a1ced91b7a2c2aa13b5e4fe5e55da217c136e4797adc2432be78f05b41","target":"record","created_at":"2026-05-18T00:54:05Z","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":"6cf23f6e822fac10636a77c0ce6894d0291425714a2cc04ab9167b0bcd074eac","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-12-23T05:56:52Z","title_canon_sha256":"06541b65e76e9a83ccf58b1168aacf1055f94a6e8f50fa1a105ffe15e01c22b4"},"schema_version":"1.0","source":{"id":"1612.07881","kind":"arxiv","version":1}},"canonical_sha256":"075b10e25862b25d6028b0eacb69698abaa57f957a3df5cad3bf35c492225c98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"075b10e25862b25d6028b0eacb69698abaa57f957a3df5cad3bf35c492225c98","first_computed_at":"2026-05-18T00:54:05.471947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:05.471947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zvCg7SNXPC//t3KdifDXw0msHfHcjUROfmfdwWigrY9mc/t1nTgBXVuounfYfkGNGhVUt2LZG2c8UO6vyS8UBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:05.472356Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.07881","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0b147a1ced91b7a2c2aa13b5e4fe5e55da217c136e4797adc2432be78f05b41","sha256:a702589cc7a9c3050be1a9b587570b8afc3ba9a2177665a77b783c2773c0a1b1"],"state_sha256":"414a961381e89b166dafc188b967fac2ef70fc78840099662faad56ecc4eb07f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O9YzhWXyihLnNxQ7DFgn7pzQVQQXgLQjVB2Z1fZ49paO1WSQUfO7xD6dHslIKmZAqJjNmFgMFDcuzsj3KujfBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T23:49:10.809195Z","bundle_sha256":"d8e091e1167154c398f37b38546ca7c4f94c507313dd8e604024fb87a4601b9c"}}