{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DOZ2RFQ7MHQ3RC2RZJOSO2YDNC","short_pith_number":"pith:DOZ2RFQ7","schema_version":"1.0","canonical_sha256":"1bb3a8961f61e1b88b51ca5d276b03688e4e2de6442a3bc8e65f409c8df88e4d","source":{"kind":"arxiv","id":"1909.06698","version":1},"attestation_state":"computed","paper":{"title":"The Edge-connectivity of Token Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J. Lea\\~nos, M. K. Christophe Ndjatchi","submitted_at":"2019-09-15T00:04:42Z","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)$ "},"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":"1909.06698","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-09-15T00:04:42Z","cross_cats_sorted":[],"title_canon_sha256":"f32af661675d0489ef0b2f3dd4b9b65422bfe08d370809f01c27a915ef0367c8","abstract_canon_sha256":"54b50cdd36f5ad1cedbb2278aaf4739486abe819495873b073750b5c3ab84766"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:04:48.761940Z","signature_b64":"KzL2S5mqdiqpicvyNtuOE6whP8+F8LpI5U+sb4Ki20/nLUUcrwbM4rNFwKEYmb0P3BKf0Xg0zZDpTf1Ioi4TDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bb3a8961f61e1b88b51ca5d276b03688e4e2de6442a3bc8e65f409c8df88e4d","last_reissued_at":"2026-07-05T00:04:48.761533Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:04:48.761533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Edge-connectivity of Token Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"J. Lea\\~nos, M. K. Christophe Ndjatchi","submitted_at":"2019-09-15T00:04:42Z","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)$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.06698","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/1909.06698/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":"1909.06698","created_at":"2026-07-05T00:04:48.761593+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.06698v1","created_at":"2026-07-05T00:04:48.761593+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.06698","created_at":"2026-07-05T00:04:48.761593+00:00"},{"alias_kind":"pith_short_12","alias_value":"DOZ2RFQ7MHQ3","created_at":"2026-07-05T00:04:48.761593+00:00"},{"alias_kind":"pith_short_16","alias_value":"DOZ2RFQ7MHQ3RC2R","created_at":"2026-07-05T00:04:48.761593+00:00"},{"alias_kind":"pith_short_8","alias_value":"DOZ2RFQ7","created_at":"2026-07-05T00:04:48.761593+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/DOZ2RFQ7MHQ3RC2RZJOSO2YDNC","json":"https://pith.science/pith/DOZ2RFQ7MHQ3RC2RZJOSO2YDNC.json","graph_json":"https://pith.science/api/pith-number/DOZ2RFQ7MHQ3RC2RZJOSO2YDNC/graph.json","events_json":"https://pith.science/api/pith-number/DOZ2RFQ7MHQ3RC2RZJOSO2YDNC/events.json","paper":"https://pith.science/paper/DOZ2RFQ7"},"agent_actions":{"view_html":"https://pith.science/pith/DOZ2RFQ7MHQ3RC2RZJOSO2YDNC","download_json":"https://pith.science/pith/DOZ2RFQ7MHQ3RC2RZJOSO2YDNC.json","view_paper":"https://pith.science/paper/DOZ2RFQ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.06698&json=true","fetch_graph":"https://pith.science/api/pith-number/DOZ2RFQ7MHQ3RC2RZJOSO2YDNC/graph.json","fetch_events":"https://pith.science/api/pith-number/DOZ2RFQ7MHQ3RC2RZJOSO2YDNC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DOZ2RFQ7MHQ3RC2RZJOSO2YDNC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DOZ2RFQ7MHQ3RC2RZJOSO2YDNC/action/storage_attestation","attest_author":"https://pith.science/pith/DOZ2RFQ7MHQ3RC2RZJOSO2YDNC/action/author_attestation","sign_citation":"https://pith.science/pith/DOZ2RFQ7MHQ3RC2RZJOSO2YDNC/action/citation_signature","submit_replication":"https://pith.science/pith/DOZ2RFQ7MHQ3RC2RZJOSO2YDNC/action/replication_record"}},"created_at":"2026-07-05T00:04:48.761593+00:00","updated_at":"2026-07-05T00:04:48.761593+00:00"}