{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CZTL53DYK3YXLKYOETG6BLXEHT","short_pith_number":"pith:CZTL53DY","schema_version":"1.0","canonical_sha256":"1666beec7856f175ab0e24cde0aee43cc9836dadd5530372bdd9f8d67b86a6fd","source":{"kind":"arxiv","id":"1204.4988","version":1},"attestation_state":"computed","paper":{"title":"Hardness of conjugacy and factorization of multidimensional subshifts of finite type","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jeandel Emmanuel (LIRMM), Pascal Vanier (LIF)","submitted_at":"2012-04-23T08:00:34Z","abstract_excerpt":"We investigate here the hardness of conjugacy and factorization of subshifts of finite type (SFTs) in dimension $d>1$. In particular, we prove that the factorization problem is $\\Sigma^0_3$-complete and the conjugacy problem $\\Sigma^0_1$-complete in the arithmetical hierarchy."},"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":"1204.4988","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-04-23T08:00:34Z","cross_cats_sorted":[],"title_canon_sha256":"9f4325259a2aaae134c2e8deb293b95e5b50b1cda6c37a065f53936204837dd3","abstract_canon_sha256":"1e9f05f93ec34d2b33dfefcd5b2e99d59f9bdefa42a0d8e9662c90b510a55617"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:15.014835Z","signature_b64":"d4JwkoJk9k5oh3ewYr6wRa/Bmtd8vK4flu1dd3NSLoAJnWkvxUFFzrA/0VldzQ5IaX9WfpvHR8QoE9ijoVaNAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1666beec7856f175ab0e24cde0aee43cc9836dadd5530372bdd9f8d67b86a6fd","last_reissued_at":"2026-05-18T03:57:15.014190Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:15.014190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardness of conjugacy and factorization of multidimensional subshifts of finite type","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jeandel Emmanuel (LIRMM), Pascal Vanier (LIF)","submitted_at":"2012-04-23T08:00:34Z","abstract_excerpt":"We investigate here the hardness of conjugacy and factorization of subshifts of finite type (SFTs) in dimension $d>1$. In particular, we prove that the factorization problem is $\\Sigma^0_3$-complete and the conjugacy problem $\\Sigma^0_1$-complete in the arithmetical hierarchy."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4988","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1204.4988","created_at":"2026-05-18T03:57:15.014274+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.4988v1","created_at":"2026-05-18T03:57:15.014274+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4988","created_at":"2026-05-18T03:57:15.014274+00:00"},{"alias_kind":"pith_short_12","alias_value":"CZTL53DYK3YX","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CZTL53DYK3YXLKYO","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CZTL53DY","created_at":"2026-05-18T12:27:01.376967+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/CZTL53DYK3YXLKYOETG6BLXEHT","json":"https://pith.science/pith/CZTL53DYK3YXLKYOETG6BLXEHT.json","graph_json":"https://pith.science/api/pith-number/CZTL53DYK3YXLKYOETG6BLXEHT/graph.json","events_json":"https://pith.science/api/pith-number/CZTL53DYK3YXLKYOETG6BLXEHT/events.json","paper":"https://pith.science/paper/CZTL53DY"},"agent_actions":{"view_html":"https://pith.science/pith/CZTL53DYK3YXLKYOETG6BLXEHT","download_json":"https://pith.science/pith/CZTL53DYK3YXLKYOETG6BLXEHT.json","view_paper":"https://pith.science/paper/CZTL53DY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.4988&json=true","fetch_graph":"https://pith.science/api/pith-number/CZTL53DYK3YXLKYOETG6BLXEHT/graph.json","fetch_events":"https://pith.science/api/pith-number/CZTL53DYK3YXLKYOETG6BLXEHT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CZTL53DYK3YXLKYOETG6BLXEHT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CZTL53DYK3YXLKYOETG6BLXEHT/action/storage_attestation","attest_author":"https://pith.science/pith/CZTL53DYK3YXLKYOETG6BLXEHT/action/author_attestation","sign_citation":"https://pith.science/pith/CZTL53DYK3YXLKYOETG6BLXEHT/action/citation_signature","submit_replication":"https://pith.science/pith/CZTL53DYK3YXLKYOETG6BLXEHT/action/replication_record"}},"created_at":"2026-05-18T03:57:15.014274+00:00","updated_at":"2026-05-18T03:57:15.014274+00:00"}