{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:UW5OW4R3EFZODRYNHXBSCCLZ6X","short_pith_number":"pith:UW5OW4R3","schema_version":"1.0","canonical_sha256":"a5baeb723b2172e1c70d3dc3210979f5c0c5c98aad367fe8c064e00898f393f6","source":{"kind":"arxiv","id":"2012.00808","version":1},"attestation_state":"computed","paper":{"title":"On the Laplacian spectra of token graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. L. Trujillo-Negrete, C. Dalf\\'o, C. Huemer, F. Duque, F. J. Zaragoza Mart\\'inez, M. A. Fiol, R. Fabila-Monroy","submitted_at":"2020-12-01T20:04:30Z","abstract_excerpt":"We study the Laplacian spectrum of token graphs, also called symmetric powers of graphs. The $k$-token graph $F_k(G)$ of a graph $G$ is the graph whose vertices are the $k$-subsets of vertices from $G$, two of which being adjacent whenever their symmetric difference is a pair of adjacent vertices in $G$. In this paper, we give a relationship between the Laplacian spectra of any two token graphs of a given graph. In particular, we show that, for any integers $h$ and $k$ such that $1\\le h\\le k\\le \\frac{n}{2}$, the Laplacian spectrum of $F_h(G)$ is contained in the Laplacian spectrum of $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":"2012.00808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-01T20:04:30Z","cross_cats_sorted":[],"title_canon_sha256":"04b437a16e949b1d801e59f5bed285c47aff69227ceec8b120cb987a59c23600","abstract_canon_sha256":"a3bd5de2d87af93763829fa5b45dc7a815c1763319ce0580a3c14f518eb85570"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:56:20.862176Z","signature_b64":"HvQXzz734HFijPAtSM4G7B0BGMf8Bven5eXhw2et1eSUEFuqtV23Pm0nRFwKYbfU+rKEhhHMwPoZBC2JllnfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5baeb723b2172e1c70d3dc3210979f5c0c5c98aad367fe8c064e00898f393f6","last_reissued_at":"2026-07-05T01:56:20.861734Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:56:20.861734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Laplacian spectra of token graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. L. Trujillo-Negrete, C. Dalf\\'o, C. Huemer, F. Duque, F. J. Zaragoza Mart\\'inez, M. A. Fiol, R. Fabila-Monroy","submitted_at":"2020-12-01T20:04:30Z","abstract_excerpt":"We study the Laplacian spectrum of token graphs, also called symmetric powers of graphs. The $k$-token graph $F_k(G)$ of a graph $G$ is the graph whose vertices are the $k$-subsets of vertices from $G$, two of which being adjacent whenever their symmetric difference is a pair of adjacent vertices in $G$. In this paper, we give a relationship between the Laplacian spectra of any two token graphs of a given graph. In particular, we show that, for any integers $h$ and $k$ such that $1\\le h\\le k\\le \\frac{n}{2}$, the Laplacian spectrum of $F_h(G)$ is contained in the Laplacian spectrum of $F_k(G)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.00808","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/2012.00808/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":"2012.00808","created_at":"2026-07-05T01:56:20.861791+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.00808v1","created_at":"2026-07-05T01:56:20.861791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.00808","created_at":"2026-07-05T01:56:20.861791+00:00"},{"alias_kind":"pith_short_12","alias_value":"UW5OW4R3EFZO","created_at":"2026-07-05T01:56:20.861791+00:00"},{"alias_kind":"pith_short_16","alias_value":"UW5OW4R3EFZODRYN","created_at":"2026-07-05T01:56:20.861791+00:00"},{"alias_kind":"pith_short_8","alias_value":"UW5OW4R3","created_at":"2026-07-05T01:56:20.861791+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.08597","citing_title":"Kikuchi Graphs of Random Hypergraphs are Approximately Johnson","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UW5OW4R3EFZODRYNHXBSCCLZ6X","json":"https://pith.science/pith/UW5OW4R3EFZODRYNHXBSCCLZ6X.json","graph_json":"https://pith.science/api/pith-number/UW5OW4R3EFZODRYNHXBSCCLZ6X/graph.json","events_json":"https://pith.science/api/pith-number/UW5OW4R3EFZODRYNHXBSCCLZ6X/events.json","paper":"https://pith.science/paper/UW5OW4R3"},"agent_actions":{"view_html":"https://pith.science/pith/UW5OW4R3EFZODRYNHXBSCCLZ6X","download_json":"https://pith.science/pith/UW5OW4R3EFZODRYNHXBSCCLZ6X.json","view_paper":"https://pith.science/paper/UW5OW4R3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.00808&json=true","fetch_graph":"https://pith.science/api/pith-number/UW5OW4R3EFZODRYNHXBSCCLZ6X/graph.json","fetch_events":"https://pith.science/api/pith-number/UW5OW4R3EFZODRYNHXBSCCLZ6X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UW5OW4R3EFZODRYNHXBSCCLZ6X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UW5OW4R3EFZODRYNHXBSCCLZ6X/action/storage_attestation","attest_author":"https://pith.science/pith/UW5OW4R3EFZODRYNHXBSCCLZ6X/action/author_attestation","sign_citation":"https://pith.science/pith/UW5OW4R3EFZODRYNHXBSCCLZ6X/action/citation_signature","submit_replication":"https://pith.science/pith/UW5OW4R3EFZODRYNHXBSCCLZ6X/action/replication_record"}},"created_at":"2026-07-05T01:56:20.861791+00:00","updated_at":"2026-07-05T01:56:20.861791+00:00"}