{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DOZ2RFQ7MHQ3RC2RZJOSO2YDNC","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":"54b50cdd36f5ad1cedbb2278aaf4739486abe819495873b073750b5c3ab84766","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-09-15T00:04:42Z","title_canon_sha256":"f32af661675d0489ef0b2f3dd4b9b65422bfe08d370809f01c27a915ef0367c8"},"schema_version":"1.0","source":{"id":"1909.06698","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.06698","created_at":"2026-07-05T00:04:48Z"},{"alias_kind":"arxiv_version","alias_value":"1909.06698v1","created_at":"2026-07-05T00:04:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.06698","created_at":"2026-07-05T00:04:48Z"},{"alias_kind":"pith_short_12","alias_value":"DOZ2RFQ7MHQ3","created_at":"2026-07-05T00:04:48Z"},{"alias_kind":"pith_short_16","alias_value":"DOZ2RFQ7MHQ3RC2R","created_at":"2026-07-05T00:04:48Z"},{"alias_kind":"pith_short_8","alias_value":"DOZ2RFQ7","created_at":"2026-07-05T00:04:48Z"}],"graph_snapshots":[{"event_id":"sha256:35c134090ef0a6a8865f20b06f6dd03d520e45f770ad154c2309343ea1bc0212","target":"graph","created_at":"2026-07-05T00:04:48Z","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/1909.06698/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be a simple graph of order $n\\geq 2$ and let $k\\in \\{1,\\ldots ,n-1\\}$. The $k$-token graph $F_k(G)$ of $G$ is the graph whose vertices are the $k$-subsets of $V(G)$, where two vertices are adjacent in $F_k(G)$ whenever their symmetric difference is an edge of $G$. In 2018 J. Lea\\~nos and A. L. Trujillo-Negrete proved that if $G$ is $t$-connected and $t\\geq k$, then $F_k(G)$ is at least $k(t-k+1)$-connected. In this paper we show that such a lower bound remains true in the context of edge-connectivity. Specifically, we show that if $G$ is $t$-edge-connected and $t\\geq k$, then $F_k(G)$ ","authors_text":"J. Lea\\~nos, M. K. Christophe Ndjatchi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-09-15T00:04:42Z","title":"The Edge-connectivity of Token Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.06698","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:a0c86245272086191bd7a02bb1b0cd8360fdccd8df6a2f959d95b1e7c6a3e230","target":"record","created_at":"2026-07-05T00:04:48Z","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":"54b50cdd36f5ad1cedbb2278aaf4739486abe819495873b073750b5c3ab84766","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-09-15T00:04:42Z","title_canon_sha256":"f32af661675d0489ef0b2f3dd4b9b65422bfe08d370809f01c27a915ef0367c8"},"schema_version":"1.0","source":{"id":"1909.06698","kind":"arxiv","version":1}},"canonical_sha256":"1bb3a8961f61e1b88b51ca5d276b03688e4e2de6442a3bc8e65f409c8df88e4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1bb3a8961f61e1b88b51ca5d276b03688e4e2de6442a3bc8e65f409c8df88e4d","first_computed_at":"2026-07-05T00:04:48.761533Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:04:48.761533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KzL2S5mqdiqpicvyNtuOE6whP8+F8LpI5U+sb4Ki20/nLUUcrwbM4rNFwKEYmb0P3BKf0Xg0zZDpTf1Ioi4TDA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:04:48.761940Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.06698","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0c86245272086191bd7a02bb1b0cd8360fdccd8df6a2f959d95b1e7c6a3e230","sha256:35c134090ef0a6a8865f20b06f6dd03d520e45f770ad154c2309343ea1bc0212"],"state_sha256":"7b4ef99d180f2bac6a2da951d2f73aa659656c0909ede61bc7b5d4b9d28a2dc5"}