{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LWC33RVS2LWDB3YSS4K5PNBDBC","short_pith_number":"pith:LWC33RVS","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"},"canonical_sha256":"5d85bdc6b2d2ec30ef129715d7b42308a36eb2befa5131b3c90789e9114cf5fa","source":{"kind":"arxiv","id":"2605.20945","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20945","created_at":"2026-05-21T01:05:29Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20945v1","created_at":"2026-05-21T01:05:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20945","created_at":"2026-05-21T01:05:29Z"},{"alias_kind":"pith_short_12","alias_value":"LWC33RVS2LWD","created_at":"2026-05-21T01:05:29Z"},{"alias_kind":"pith_short_16","alias_value":"LWC33RVS2LWDB3YS","created_at":"2026-05-21T01:05:29Z"},{"alias_kind":"pith_short_8","alias_value":"LWC33RVS","created_at":"2026-05-21T01:05:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LWC33RVS2LWDB3YSS4K5PNBDBC","target":"record","payload":{"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"},"canonical_sha256":"5d85bdc6b2d2ec30ef129715d7b42308a36eb2befa5131b3c90789e9114cf5fa","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"},"source_kind":"arxiv","source_id":"2605.20945","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-21T01:05:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d7T9GhUQ6BWNp3xBL80GjLR2H/AJYOPknXJIJ/qrIsMIpapXy3mejRZ2IqHJPm6FbVxq+nUbs2vum6bhmzlDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T17:29:38.808381Z"},"content_sha256":"79816909334633db3b3fae567259abaef48b9ce5134b50cdf9cd206f883cd965","schema_version":"1.0","event_id":"sha256:79816909334633db3b3fae567259abaef48b9ce5134b50cdf9cd206f883cd965"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LWC33RVS2LWDB3YSS4K5PNBDBC","target":"graph","payload":{"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"},"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-21T01:05:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vr3NbDX5v8XaBU6rl9eZsoJjfAGw8g4EJZvN9Kpe9HLWHlDASCpfe+6/aaVex/ion6UKRhHNY76FySsd9//jAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T17:29:38.809116Z"},"content_sha256":"66768674c293eb2f411d440b4af8612829a6d3fb4a934073ca93491f06f2ed7b","schema_version":"1.0","event_id":"sha256:66768674c293eb2f411d440b4af8612829a6d3fb4a934073ca93491f06f2ed7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LWC33RVS2LWDB3YSS4K5PNBDBC/bundle.json","state_url":"https://pith.science/pith/LWC33RVS2LWDB3YSS4K5PNBDBC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LWC33RVS2LWDB3YSS4K5PNBDBC/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-05-22T17:29:38Z","links":{"resolver":"https://pith.science/pith/LWC33RVS2LWDB3YSS4K5PNBDBC","bundle":"https://pith.science/pith/LWC33RVS2LWDB3YSS4K5PNBDBC/bundle.json","state":"https://pith.science/pith/LWC33RVS2LWDB3YSS4K5PNBDBC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LWC33RVS2LWDB3YSS4K5PNBDBC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LWC33RVS2LWDB3YSS4K5PNBDBC","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":"b32103198218cf746fc3949db8d4f1472173d6615efbaf8ab7592849a0e7bd95","cross_cats_sorted":["math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2026-05-20T09:31:34Z","title_canon_sha256":"fb2522492515d8b16d493db61cd08b3484b806b9b5f255fefbb5d1aca62edb5e"},"schema_version":"1.0","source":{"id":"2605.20945","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20945","created_at":"2026-05-21T01:05:29Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20945v1","created_at":"2026-05-21T01:05:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20945","created_at":"2026-05-21T01:05:29Z"},{"alias_kind":"pith_short_12","alias_value":"LWC33RVS2LWD","created_at":"2026-05-21T01:05:29Z"},{"alias_kind":"pith_short_16","alias_value":"LWC33RVS2LWDB3YS","created_at":"2026-05-21T01:05:29Z"},{"alias_kind":"pith_short_8","alias_value":"LWC33RVS","created_at":"2026-05-21T01:05:29Z"}],"graph_snapshots":[{"event_id":"sha256:66768674c293eb2f411d440b4af8612829a6d3fb4a934073ca93491f06f2ed7b","target":"graph","created_at":"2026-05-21T01:05:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.20945/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Kan\\'eda Blot, Ville Salo","cross_cats":["math.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2026-05-20T09:31:34Z","title":"Self-simulability of right-angled Artin groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20945","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:79816909334633db3b3fae567259abaef48b9ce5134b50cdf9cd206f883cd965","target":"record","created_at":"2026-05-21T01:05:29Z","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":"b32103198218cf746fc3949db8d4f1472173d6615efbaf8ab7592849a0e7bd95","cross_cats_sorted":["math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2026-05-20T09:31:34Z","title_canon_sha256":"fb2522492515d8b16d493db61cd08b3484b806b9b5f255fefbb5d1aca62edb5e"},"schema_version":"1.0","source":{"id":"2605.20945","kind":"arxiv","version":1}},"canonical_sha256":"5d85bdc6b2d2ec30ef129715d7b42308a36eb2befa5131b3c90789e9114cf5fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d85bdc6b2d2ec30ef129715d7b42308a36eb2befa5131b3c90789e9114cf5fa","first_computed_at":"2026-05-21T01:05:29.256417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:05:29.256417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jq7/cLUn2qd+967zuTNfc4okyeOemj0REsxbXH1uNisWPw6JZ9cmjd6uHvF1rwUA48C5DMxgCdMIn/cBTqlKBw==","signature_status":"signed_v1","signed_at":"2026-05-21T01:05:29.257083Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.20945","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79816909334633db3b3fae567259abaef48b9ce5134b50cdf9cd206f883cd965","sha256:66768674c293eb2f411d440b4af8612829a6d3fb4a934073ca93491f06f2ed7b"],"state_sha256":"2c0919cc0774f44513a9794fd570b3fccc8f05de2c6848ff24262141b453ca9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1j/JkgSy7o0ePu0PcMp5XOaw4887Q82tkSCswRFwIVij28LJpMVb7vd76YwRoxvGlrAvW6wUHu7juyew+/ukAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T17:29:38.813215Z","bundle_sha256":"66d163fa6672d3807e76e61bc92b37d365ea313fa983d97c5711c1330c5c8326"}}