{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:EWLXNEKLVF6Q7W6XJEYCI5YY6W","short_pith_number":"pith:EWLXNEKL","canonical_record":{"source":{"id":"2210.04768","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-05T06:43:43Z","cross_cats_sorted":[],"title_canon_sha256":"49e26c0bd9b2b14c9a18905d8713253a9636be233b0da0754d019b71a8a3102a","abstract_canon_sha256":"ab8b3db396b855524b7d63454032b131eadc592d246fe95506dc9e35f107f78c"},"schema_version":"1.0"},"canonical_sha256":"259776914ba97d0fdbd74930247718f5944d0defe4f254fcac4bd76e06771007","source":{"kind":"arxiv","id":"2210.04768","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.04768","created_at":"2026-07-05T05:18:07Z"},{"alias_kind":"arxiv_version","alias_value":"2210.04768v2","created_at":"2026-07-05T05:18:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.04768","created_at":"2026-07-05T05:18:07Z"},{"alias_kind":"pith_short_12","alias_value":"EWLXNEKLVF6Q","created_at":"2026-07-05T05:18:07Z"},{"alias_kind":"pith_short_16","alias_value":"EWLXNEKLVF6Q7W6X","created_at":"2026-07-05T05:18:07Z"},{"alias_kind":"pith_short_8","alias_value":"EWLXNEKL","created_at":"2026-07-05T05:18:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:EWLXNEKLVF6Q7W6XJEYCI5YY6W","target":"record","payload":{"canonical_record":{"source":{"id":"2210.04768","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-05T06:43:43Z","cross_cats_sorted":[],"title_canon_sha256":"49e26c0bd9b2b14c9a18905d8713253a9636be233b0da0754d019b71a8a3102a","abstract_canon_sha256":"ab8b3db396b855524b7d63454032b131eadc592d246fe95506dc9e35f107f78c"},"schema_version":"1.0"},"canonical_sha256":"259776914ba97d0fdbd74930247718f5944d0defe4f254fcac4bd76e06771007","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:18:07.657625Z","signature_b64":"dKNBSST+Ndx5SA2UGgBEpWhLEAd32smoQBMGnC44QKiX2ubIgOC9YgI1/8iH+MnCSZiB1ohyEIbLu+46NVuKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"259776914ba97d0fdbd74930247718f5944d0defe4f254fcac4bd76e06771007","last_reissued_at":"2026-07-05T05:18:07.657223Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:18:07.657223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.04768","source_version":2,"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-05T05:18:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1UE+1m2HEftiwjGSdeOHVIYTzi2tV4CHi6FJYUJOYALnxzCD7zBW2MrOlbBodAc7di7JxHjsaFtMouSAhkDuCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T18:45:08.865124Z"},"content_sha256":"d59d4b13ad3fe448d7a1ddce049bff8ae41bb40dec9efd439f9496909fe61241","schema_version":"1.0","event_id":"sha256:d59d4b13ad3fe448d7a1ddce049bff8ae41bb40dec9efd439f9496909fe61241"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:EWLXNEKLVF6Q7W6XJEYCI5YY6W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connectedness in Friends-and-Strangers Graphs of Spiders and Complements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Lee","submitted_at":"2022-10-05T06:43:43Z","abstract_excerpt":"Let $X$ and $Y$ be two graphs with vertex set $[n]$. Their friends-and-strangers graph $\\mathsf{FS}(X,Y)$ is a graph with vertices corresponding to elements of the group $S_n$, and two permutations $\\sigma$ and $\\sigma'$ are adjacent if they are separated by a transposition $\\{a,b\\}$ such that $a$ and $b$ are adjacent in $X$ and $\\sigma(a)$ and $\\sigma(b)$ are adjacent in $Y$. Specific friends-and-strangers graphs such as $\\mathsf{FS}(\\mathsf{Path}_n,Y)$ and $\\mathsf{FS}(\\mathsf{Cycle}_n,Y)$ have been researched, and their connected components have been enumerated using various equivalence rel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.04768","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.04768/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-05T05:18:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mJOduBMfHXnl7R+3tAEJEy1FTmqUm0e/CA97AifK4Tbm0MOP06a2rmRhOFo0eiiQippiKdt//tewg69jSHd3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T18:45:08.865629Z"},"content_sha256":"38ffae4be885f8be020da9a4ecd5d58f9efa684f773b4426e4da50d9b752ce32","schema_version":"1.0","event_id":"sha256:38ffae4be885f8be020da9a4ecd5d58f9efa684f773b4426e4da50d9b752ce32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EWLXNEKLVF6Q7W6XJEYCI5YY6W/bundle.json","state_url":"https://pith.science/pith/EWLXNEKLVF6Q7W6XJEYCI5YY6W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EWLXNEKLVF6Q7W6XJEYCI5YY6W/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-13T18:45:08Z","links":{"resolver":"https://pith.science/pith/EWLXNEKLVF6Q7W6XJEYCI5YY6W","bundle":"https://pith.science/pith/EWLXNEKLVF6Q7W6XJEYCI5YY6W/bundle.json","state":"https://pith.science/pith/EWLXNEKLVF6Q7W6XJEYCI5YY6W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EWLXNEKLVF6Q7W6XJEYCI5YY6W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:EWLXNEKLVF6Q7W6XJEYCI5YY6W","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":"ab8b3db396b855524b7d63454032b131eadc592d246fe95506dc9e35f107f78c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-05T06:43:43Z","title_canon_sha256":"49e26c0bd9b2b14c9a18905d8713253a9636be233b0da0754d019b71a8a3102a"},"schema_version":"1.0","source":{"id":"2210.04768","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.04768","created_at":"2026-07-05T05:18:07Z"},{"alias_kind":"arxiv_version","alias_value":"2210.04768v2","created_at":"2026-07-05T05:18:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.04768","created_at":"2026-07-05T05:18:07Z"},{"alias_kind":"pith_short_12","alias_value":"EWLXNEKLVF6Q","created_at":"2026-07-05T05:18:07Z"},{"alias_kind":"pith_short_16","alias_value":"EWLXNEKLVF6Q7W6X","created_at":"2026-07-05T05:18:07Z"},{"alias_kind":"pith_short_8","alias_value":"EWLXNEKL","created_at":"2026-07-05T05:18:07Z"}],"graph_snapshots":[{"event_id":"sha256:38ffae4be885f8be020da9a4ecd5d58f9efa684f773b4426e4da50d9b752ce32","target":"graph","created_at":"2026-07-05T05:18:07Z","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/2210.04768/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $X$ and $Y$ be two graphs with vertex set $[n]$. Their friends-and-strangers graph $\\mathsf{FS}(X,Y)$ is a graph with vertices corresponding to elements of the group $S_n$, and two permutations $\\sigma$ and $\\sigma'$ are adjacent if they are separated by a transposition $\\{a,b\\}$ such that $a$ and $b$ are adjacent in $X$ and $\\sigma(a)$ and $\\sigma(b)$ are adjacent in $Y$. Specific friends-and-strangers graphs such as $\\mathsf{FS}(\\mathsf{Path}_n,Y)$ and $\\mathsf{FS}(\\mathsf{Cycle}_n,Y)$ have been researched, and their connected components have been enumerated using various equivalence rel","authors_text":"Alan Lee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-05T06:43:43Z","title":"Connectedness in Friends-and-Strangers Graphs of Spiders and Complements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.04768","kind":"arxiv","version":2},"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:d59d4b13ad3fe448d7a1ddce049bff8ae41bb40dec9efd439f9496909fe61241","target":"record","created_at":"2026-07-05T05:18:07Z","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":"ab8b3db396b855524b7d63454032b131eadc592d246fe95506dc9e35f107f78c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-05T06:43:43Z","title_canon_sha256":"49e26c0bd9b2b14c9a18905d8713253a9636be233b0da0754d019b71a8a3102a"},"schema_version":"1.0","source":{"id":"2210.04768","kind":"arxiv","version":2}},"canonical_sha256":"259776914ba97d0fdbd74930247718f5944d0defe4f254fcac4bd76e06771007","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"259776914ba97d0fdbd74930247718f5944d0defe4f254fcac4bd76e06771007","first_computed_at":"2026-07-05T05:18:07.657223Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:18:07.657223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dKNBSST+Ndx5SA2UGgBEpWhLEAd32smoQBMGnC44QKiX2ubIgOC9YgI1/8iH+MnCSZiB1ohyEIbLu+46NVuKBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:18:07.657625Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.04768","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d59d4b13ad3fe448d7a1ddce049bff8ae41bb40dec9efd439f9496909fe61241","sha256:38ffae4be885f8be020da9a4ecd5d58f9efa684f773b4426e4da50d9b752ce32"],"state_sha256":"58925d497c394aa632f98364d2f6dd609a6dfde7b609fd127a61bb4c687f547f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9tyO9XuvA/Ek5WWe2/PrFzg7QrY7L4tuWjljdhtEGFXTDz2ZSD71t5UZRh4+D4nvsQ3tuQSrQUL5Byn61QGbAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T18:45:08.878162Z","bundle_sha256":"a735bcd224f962ada2c878dacda150e1f94b56fddf7791a314eea330325de1f5"}}