{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:EWLXNEKLVF6Q7W6XJEYCI5YY6W","short_pith_number":"pith:EWLXNEKL","schema_version":"1.0","canonical_sha256":"259776914ba97d0fdbd74930247718f5944d0defe4f254fcac4bd76e06771007","source":{"kind":"arxiv","id":"2210.04768","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2210.04768","created_at":"2026-07-05T05:18:07.657279+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.04768v2","created_at":"2026-07-05T05:18:07.657279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.04768","created_at":"2026-07-05T05:18:07.657279+00:00"},{"alias_kind":"pith_short_12","alias_value":"EWLXNEKLVF6Q","created_at":"2026-07-05T05:18:07.657279+00:00"},{"alias_kind":"pith_short_16","alias_value":"EWLXNEKLVF6Q7W6X","created_at":"2026-07-05T05:18:07.657279+00:00"},{"alias_kind":"pith_short_8","alias_value":"EWLXNEKL","created_at":"2026-07-05T05:18:07.657279+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/EWLXNEKLVF6Q7W6XJEYCI5YY6W","json":"https://pith.science/pith/EWLXNEKLVF6Q7W6XJEYCI5YY6W.json","graph_json":"https://pith.science/api/pith-number/EWLXNEKLVF6Q7W6XJEYCI5YY6W/graph.json","events_json":"https://pith.science/api/pith-number/EWLXNEKLVF6Q7W6XJEYCI5YY6W/events.json","paper":"https://pith.science/paper/EWLXNEKL"},"agent_actions":{"view_html":"https://pith.science/pith/EWLXNEKLVF6Q7W6XJEYCI5YY6W","download_json":"https://pith.science/pith/EWLXNEKLVF6Q7W6XJEYCI5YY6W.json","view_paper":"https://pith.science/paper/EWLXNEKL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.04768&json=true","fetch_graph":"https://pith.science/api/pith-number/EWLXNEKLVF6Q7W6XJEYCI5YY6W/graph.json","fetch_events":"https://pith.science/api/pith-number/EWLXNEKLVF6Q7W6XJEYCI5YY6W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EWLXNEKLVF6Q7W6XJEYCI5YY6W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EWLXNEKLVF6Q7W6XJEYCI5YY6W/action/storage_attestation","attest_author":"https://pith.science/pith/EWLXNEKLVF6Q7W6XJEYCI5YY6W/action/author_attestation","sign_citation":"https://pith.science/pith/EWLXNEKLVF6Q7W6XJEYCI5YY6W/action/citation_signature","submit_replication":"https://pith.science/pith/EWLXNEKLVF6Q7W6XJEYCI5YY6W/action/replication_record"}},"created_at":"2026-07-05T05:18:07.657279+00:00","updated_at":"2026-07-05T05:18:07.657279+00:00"}