{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LWC33RVS2LWDB3YSS4K5PNBDBC","short_pith_number":"pith:LWC33RVS","schema_version":"1.0","canonical_sha256":"5d85bdc6b2d2ec30ef129715d7b42308a36eb2befa5131b3c90789e9114cf5fa","source":{"kind":"arxiv","id":"2605.20945","version":1},"attestation_state":"computed","paper":{"title":"Self-simulability of right-angled Artin groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.GR","authors_text":"Kan\\'eda Blot, Ville Salo","submitted_at":"2026-05-20T09:31:34Z","abstract_excerpt":"A group is self-simulable if all its computable actions admit SFT covers, which means roughly that they can be implemented with finitely many tiling constraints. We prove that a RAAG is self-simulable if and only if its defining graph has no disconnecting clique, and also prove partial results on self-simulability of general graph products."},"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":"2605.20945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2026-05-20T09:31:34Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"fb2522492515d8b16d493db61cd08b3484b806b9b5f255fefbb5d1aca62edb5e","abstract_canon_sha256":"b32103198218cf746fc3949db8d4f1472173d6615efbaf8ab7592849a0e7bd95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:29.257083Z","signature_b64":"Jq7/cLUn2qd+967zuTNfc4okyeOemj0REsxbXH1uNisWPw6JZ9cmjd6uHvF1rwUA48C5DMxgCdMIn/cBTqlKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d85bdc6b2d2ec30ef129715d7b42308a36eb2befa5131b3c90789e9114cf5fa","last_reissued_at":"2026-05-21T01:05:29.256417Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:29.256417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-simulability of right-angled Artin groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.GR","authors_text":"Kan\\'eda Blot, Ville Salo","submitted_at":"2026-05-20T09:31:34Z","abstract_excerpt":"A group is self-simulable if all its computable actions admit SFT covers, which means roughly that they can be implemented with finitely many tiling constraints. We prove that a RAAG is self-simulable if and only if its defining graph has no disconnecting clique, and also prove partial results on self-simulability of general graph products."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20945","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.20945/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.20945","created_at":"2026-05-21T01:05:29.256532+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.20945v1","created_at":"2026-05-21T01:05:29.256532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20945","created_at":"2026-05-21T01:05:29.256532+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWC33RVS2LWD","created_at":"2026-05-21T01:05:29.256532+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWC33RVS2LWDB3YS","created_at":"2026-05-21T01:05:29.256532+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWC33RVS","created_at":"2026-05-21T01:05:29.256532+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/LWC33RVS2LWDB3YSS4K5PNBDBC","json":"https://pith.science/pith/LWC33RVS2LWDB3YSS4K5PNBDBC.json","graph_json":"https://pith.science/api/pith-number/LWC33RVS2LWDB3YSS4K5PNBDBC/graph.json","events_json":"https://pith.science/api/pith-number/LWC33RVS2LWDB3YSS4K5PNBDBC/events.json","paper":"https://pith.science/paper/LWC33RVS"},"agent_actions":{"view_html":"https://pith.science/pith/LWC33RVS2LWDB3YSS4K5PNBDBC","download_json":"https://pith.science/pith/LWC33RVS2LWDB3YSS4K5PNBDBC.json","view_paper":"https://pith.science/paper/LWC33RVS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.20945&json=true","fetch_graph":"https://pith.science/api/pith-number/LWC33RVS2LWDB3YSS4K5PNBDBC/graph.json","fetch_events":"https://pith.science/api/pith-number/LWC33RVS2LWDB3YSS4K5PNBDBC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWC33RVS2LWDB3YSS4K5PNBDBC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWC33RVS2LWDB3YSS4K5PNBDBC/action/storage_attestation","attest_author":"https://pith.science/pith/LWC33RVS2LWDB3YSS4K5PNBDBC/action/author_attestation","sign_citation":"https://pith.science/pith/LWC33RVS2LWDB3YSS4K5PNBDBC/action/citation_signature","submit_replication":"https://pith.science/pith/LWC33RVS2LWDB3YSS4K5PNBDBC/action/replication_record"}},"created_at":"2026-05-21T01:05:29.256532+00:00","updated_at":"2026-05-21T01:05:29.256532+00:00"}