{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:AUIATSLNI2GX7MHBRZRKHEIF4Z","short_pith_number":"pith:AUIATSLN","canonical_record":{"source":{"id":"2607.13219","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-14T19:28:41Z","cross_cats_sorted":[],"title_canon_sha256":"72248174936d4bd8513ff50bec0511aa4ed205cc59672f17861d229055336528","abstract_canon_sha256":"485e1b2396425337bf770d44154275077cd42252c459e05acd61507f8025f02e"},"schema_version":"1.0"},"canonical_sha256":"051009c96d468d7fb0e18e62a39105e64f2110394eb6f4a17be56f52742517e8","source":{"kind":"arxiv","id":"2607.13219","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.13219","created_at":"2026-07-16T00:22:03Z"},{"alias_kind":"arxiv_version","alias_value":"2607.13219v1","created_at":"2026-07-16T00:22:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.13219","created_at":"2026-07-16T00:22:03Z"},{"alias_kind":"pith_short_12","alias_value":"AUIATSLNI2GX","created_at":"2026-07-16T00:22:03Z"},{"alias_kind":"pith_short_16","alias_value":"AUIATSLNI2GX7MHB","created_at":"2026-07-16T00:22:03Z"},{"alias_kind":"pith_short_8","alias_value":"AUIATSLN","created_at":"2026-07-16T00:22:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:AUIATSLNI2GX7MHBRZRKHEIF4Z","target":"record","payload":{"canonical_record":{"source":{"id":"2607.13219","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-14T19:28:41Z","cross_cats_sorted":[],"title_canon_sha256":"72248174936d4bd8513ff50bec0511aa4ed205cc59672f17861d229055336528","abstract_canon_sha256":"485e1b2396425337bf770d44154275077cd42252c459e05acd61507f8025f02e"},"schema_version":"1.0"},"canonical_sha256":"051009c96d468d7fb0e18e62a39105e64f2110394eb6f4a17be56f52742517e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-16T00:22:03.464572Z","signature_b64":"3m8u+DHV/TmuYPFRchpf3JLJSPf/7SYc20Bu5LGvjH8DUbQH5Z1GoGPo0tefeVi5SLGh+Y0n7EI0JxlqZC+EBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"051009c96d468d7fb0e18e62a39105e64f2110394eb6f4a17be56f52742517e8","last_reissued_at":"2026-07-16T00:22:03.463728Z","signature_status":"signed_v1","first_computed_at":"2026-07-16T00:22:03.463728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.13219","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-07-16T00:22:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EyctuBV0X85/lBaI/wwETIKWt1dcMOVKLvWHK58dvrX3rwHRRi/FmckVef0ODyfeHq1VGpl4Km99a5aej+0FCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:50:59.927159Z"},"content_sha256":"347529e29eb0c1bc24a8c88ac47bf327ba3a55aa01f4d1d500b7fef594d2b29b","schema_version":"1.0","event_id":"sha256:347529e29eb0c1bc24a8c88ac47bf327ba3a55aa01f4d1d500b7fef594d2b29b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:AUIATSLNI2GX7MHBRZRKHEIF4Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CayleyR: Solving the TopSpin puzzle via cycle intersection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Yuri Baramykov","submitted_at":"2026-07-14T19:28:41Z","abstract_excerpt":"We present cayleyR, an R package for solving permutation puzzles by detecting cycle intersections in Cayley graphs. The core algorithm performs an iterative bidirectional search: from both the initial and target permutation states, random operation sequences generate cycles in the Cayley graph of the symmetric group Sn; their intersection yields a connecting path. When no direct intersection is found, a distance-guided bridge selection narrows the gap, and the process repeats. The package targets the TopSpin(n,k) puzzle, whose state space is a Cayley graph of Sn generated by a cyclic shift and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.13219","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/2607.13219/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-07-16T00:22:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lV2TBJcyyEhO9PGgGU0FZlPzAF3po6kyAYSnrWSO+NV9hrYboKjIZ9nSx8ueZKVE4JZO5kBzM7rXqF0wyhLABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:50:59.928075Z"},"content_sha256":"2c7c87bc0bf678da3bf19c8d148a082194ef63f719787a7da41e0f826716bebc","schema_version":"1.0","event_id":"sha256:2c7c87bc0bf678da3bf19c8d148a082194ef63f719787a7da41e0f826716bebc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AUIATSLNI2GX7MHBRZRKHEIF4Z/bundle.json","state_url":"https://pith.science/pith/AUIATSLNI2GX7MHBRZRKHEIF4Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AUIATSLNI2GX7MHBRZRKHEIF4Z/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-08-15T15:50:59Z","links":{"resolver":"https://pith.science/pith/AUIATSLNI2GX7MHBRZRKHEIF4Z","bundle":"https://pith.science/pith/AUIATSLNI2GX7MHBRZRKHEIF4Z/bundle.json","state":"https://pith.science/pith/AUIATSLNI2GX7MHBRZRKHEIF4Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AUIATSLNI2GX7MHBRZRKHEIF4Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:AUIATSLNI2GX7MHBRZRKHEIF4Z","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":"485e1b2396425337bf770d44154275077cd42252c459e05acd61507f8025f02e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-14T19:28:41Z","title_canon_sha256":"72248174936d4bd8513ff50bec0511aa4ed205cc59672f17861d229055336528"},"schema_version":"1.0","source":{"id":"2607.13219","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.13219","created_at":"2026-07-16T00:22:03Z"},{"alias_kind":"arxiv_version","alias_value":"2607.13219v1","created_at":"2026-07-16T00:22:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.13219","created_at":"2026-07-16T00:22:03Z"},{"alias_kind":"pith_short_12","alias_value":"AUIATSLNI2GX","created_at":"2026-07-16T00:22:03Z"},{"alias_kind":"pith_short_16","alias_value":"AUIATSLNI2GX7MHB","created_at":"2026-07-16T00:22:03Z"},{"alias_kind":"pith_short_8","alias_value":"AUIATSLN","created_at":"2026-07-16T00:22:03Z"}],"graph_snapshots":[{"event_id":"sha256:2c7c87bc0bf678da3bf19c8d148a082194ef63f719787a7da41e0f826716bebc","target":"graph","created_at":"2026-07-16T00:22:03Z","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/2607.13219/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present cayleyR, an R package for solving permutation puzzles by detecting cycle intersections in Cayley graphs. The core algorithm performs an iterative bidirectional search: from both the initial and target permutation states, random operation sequences generate cycles in the Cayley graph of the symmetric group Sn; their intersection yields a connecting path. When no direct intersection is found, a distance-guided bridge selection narrows the gap, and the process repeats. The package targets the TopSpin(n,k) puzzle, whose state space is a Cayley graph of Sn generated by a cyclic shift and","authors_text":"Yuri Baramykov","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-14T19:28:41Z","title":"CayleyR: Solving the TopSpin puzzle via cycle intersection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.13219","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:347529e29eb0c1bc24a8c88ac47bf327ba3a55aa01f4d1d500b7fef594d2b29b","target":"record","created_at":"2026-07-16T00:22:03Z","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":"485e1b2396425337bf770d44154275077cd42252c459e05acd61507f8025f02e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-07-14T19:28:41Z","title_canon_sha256":"72248174936d4bd8513ff50bec0511aa4ed205cc59672f17861d229055336528"},"schema_version":"1.0","source":{"id":"2607.13219","kind":"arxiv","version":1}},"canonical_sha256":"051009c96d468d7fb0e18e62a39105e64f2110394eb6f4a17be56f52742517e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"051009c96d468d7fb0e18e62a39105e64f2110394eb6f4a17be56f52742517e8","first_computed_at":"2026-07-16T00:22:03.463728Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-16T00:22:03.463728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3m8u+DHV/TmuYPFRchpf3JLJSPf/7SYc20Bu5LGvjH8DUbQH5Z1GoGPo0tefeVi5SLGh+Y0n7EI0JxlqZC+EBA==","signature_status":"signed_v1","signed_at":"2026-07-16T00:22:03.464572Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.13219","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:347529e29eb0c1bc24a8c88ac47bf327ba3a55aa01f4d1d500b7fef594d2b29b","sha256:2c7c87bc0bf678da3bf19c8d148a082194ef63f719787a7da41e0f826716bebc"],"state_sha256":"dddc6684c4d41321b2b8a2c5abba9e49a0a248a7d0b0c2ca34d1d5d1d4739fb4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m3DxNgvwVEzD4SBdhM6c34tVeb9S+usGL3PGIpQ/0fSFZsx212HfOXVcveX5MRx3nDx2Ce/974AoIKj+/MieCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T15:50:59.934686Z","bundle_sha256":"2932f882a193c22774a7a36a5bd2d9b1d608cbc1e0b026aaaec5004aed6e04a2"}}