{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:Y2NUL2X526C6B3BLQEW2JESJCZ","short_pith_number":"pith:Y2NUL2X5","schema_version":"1.0","canonical_sha256":"c69b45eafdd785e0ec2b812da492491665f70446752b722b1f906d4694072989","source":{"kind":"arxiv","id":"1601.04295","version":2},"attestation_state":"computed","paper":{"title":"Generating Sets of the Kernel Graph and the Inverse Problem in Synchronization Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Artur Schaefer","submitted_at":"2016-01-17T13:46:17Z","abstract_excerpt":"This paper analyses the construction of the kernel graph of a non-synchronizing transformation semigroup and introduces the inverse synchronization problem. Given a transformation semigroup $S\\leq T_n$, we construct the kernel graph $\\text{Gr}(S)$ by saying $v$ and $w$ are adjacent, if there is no $f\\in S$ with $vf=wf$. The kernel graph is trivial or complete if the semigroup is a synchronizing semigroup or a permutation group, respectively. The connection between graphs and synchronizing (semi-) groups was established by Cameron and Kazanidis, and it has led to many results regarding the clas"},"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":"1601.04295","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-17T13:46:17Z","cross_cats_sorted":[],"title_canon_sha256":"126b726a436d885569fd3e1634a3cdf814a6230fb22adabdb32c8043462ea909","abstract_canon_sha256":"41e6069d41bb2b58b53cf09deffcffa93e360fbc59d9f732c333e67d851b1ed1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:15.731877Z","signature_b64":"Pc09yO4VGeHpIDgdN9zfuel7zXqGX6EHCoangJzBAImLHMeda4HqxkbHUeyBDi6PhjckKqLjuDKtbxLVcGGsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c69b45eafdd785e0ec2b812da492491665f70446752b722b1f906d4694072989","last_reissued_at":"2026-05-18T01:19:15.731542Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:15.731542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generating Sets of the Kernel Graph and the Inverse Problem in Synchronization Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Artur Schaefer","submitted_at":"2016-01-17T13:46:17Z","abstract_excerpt":"This paper analyses the construction of the kernel graph of a non-synchronizing transformation semigroup and introduces the inverse synchronization problem. Given a transformation semigroup $S\\leq T_n$, we construct the kernel graph $\\text{Gr}(S)$ by saying $v$ and $w$ are adjacent, if there is no $f\\in S$ with $vf=wf$. The kernel graph is trivial or complete if the semigroup is a synchronizing semigroup or a permutation group, respectively. The connection between graphs and synchronizing (semi-) groups was established by Cameron and Kazanidis, and it has led to many results regarding the clas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04295","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.04295","created_at":"2026-05-18T01:19:15.731593+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04295v2","created_at":"2026-05-18T01:19:15.731593+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04295","created_at":"2026-05-18T01:19:15.731593+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2NUL2X526C6","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2NUL2X526C6B3BL","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2NUL2X5","created_at":"2026-05-18T12:30:51.357362+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/Y2NUL2X526C6B3BLQEW2JESJCZ","json":"https://pith.science/pith/Y2NUL2X526C6B3BLQEW2JESJCZ.json","graph_json":"https://pith.science/api/pith-number/Y2NUL2X526C6B3BLQEW2JESJCZ/graph.json","events_json":"https://pith.science/api/pith-number/Y2NUL2X526C6B3BLQEW2JESJCZ/events.json","paper":"https://pith.science/paper/Y2NUL2X5"},"agent_actions":{"view_html":"https://pith.science/pith/Y2NUL2X526C6B3BLQEW2JESJCZ","download_json":"https://pith.science/pith/Y2NUL2X526C6B3BLQEW2JESJCZ.json","view_paper":"https://pith.science/paper/Y2NUL2X5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04295&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2NUL2X526C6B3BLQEW2JESJCZ/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2NUL2X526C6B3BLQEW2JESJCZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2NUL2X526C6B3BLQEW2JESJCZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2NUL2X526C6B3BLQEW2JESJCZ/action/storage_attestation","attest_author":"https://pith.science/pith/Y2NUL2X526C6B3BLQEW2JESJCZ/action/author_attestation","sign_citation":"https://pith.science/pith/Y2NUL2X526C6B3BLQEW2JESJCZ/action/citation_signature","submit_replication":"https://pith.science/pith/Y2NUL2X526C6B3BLQEW2JESJCZ/action/replication_record"}},"created_at":"2026-05-18T01:19:15.731593+00:00","updated_at":"2026-05-18T01:19:15.731593+00:00"}