{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GMFC4F7BCLZ5HNWV6MSWMUHI3G","short_pith_number":"pith:GMFC4F7B","schema_version":"1.0","canonical_sha256":"330a2e17e112f3d3b6d5f3256650e8d98d0c9be71a0646aae65390269478f52b","source":{"kind":"arxiv","id":"2602.08684","version":2},"attestation_state":"computed","paper":{"title":"Laplacian Pair State Transfer on Total Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Akash Kalita, Bikash Bhattacharjya","submitted_at":"2026-02-09T14:06:32Z","abstract_excerpt":"The total graph of a graph $G$, denoted $\\mathcal{T}(G)$, is defined as the graph whose vertex set is the union of the vertex set of $G$ and the edge set of $G$, such that two vertices of $\\mathcal{T}(G)$ are adjacent if the corresponding elements of $G$ are either adjacent or incident. In this paper, we investigate the existence of Laplacian perfect pair state transfer and Laplacian pretty good pair state transfer on $\\mathcal{T}(G)$, where $G$ is an $r$-regular graph. We prove that if $G$ is Laplacian integral, $r \\geq 3$, and $r+1$ is not a Laplacian eigenvalue of $G$, then $\\mathcal{T}(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":"2602.08684","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2026-02-09T14:06:32Z","cross_cats_sorted":[],"title_canon_sha256":"31f8cef7e68bf03d00b04ce9c69cf5b1e4c5d61a5baa0e14ff521dcc159bf404","abstract_canon_sha256":"f9a5c9ff7f1c01612587333b21fdc5791c5f95321b727c92992ad97db5bece64"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:04:05.874013Z","signature_b64":"tyfeL+nDFtGj/Uo+coGgDv6bxbIPJxNk27M5q5A8lIgWfmHO8YKtELI2WJet0B6Fic5o1I83HJVBUMkl9fO3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"330a2e17e112f3d3b6d5f3256650e8d98d0c9be71a0646aae65390269478f52b","last_reissued_at":"2026-05-26T02:04:05.873020Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:04:05.873020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Laplacian Pair State Transfer on Total Graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Akash Kalita, Bikash Bhattacharjya","submitted_at":"2026-02-09T14:06:32Z","abstract_excerpt":"The total graph of a graph $G$, denoted $\\mathcal{T}(G)$, is defined as the graph whose vertex set is the union of the vertex set of $G$ and the edge set of $G$, such that two vertices of $\\mathcal{T}(G)$ are adjacent if the corresponding elements of $G$ are either adjacent or incident. In this paper, we investigate the existence of Laplacian perfect pair state transfer and Laplacian pretty good pair state transfer on $\\mathcal{T}(G)$, where $G$ is an $r$-regular graph. We prove that if $G$ is Laplacian integral, $r \\geq 3$, and $r+1$ is not a Laplacian eigenvalue of $G$, then $\\mathcal{T}(G)$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.08684","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/2602.08684/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":"2602.08684","created_at":"2026-05-26T02:04:05.873135+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.08684v2","created_at":"2026-05-26T02:04:05.873135+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.08684","created_at":"2026-05-26T02:04:05.873135+00:00"},{"alias_kind":"pith_short_12","alias_value":"GMFC4F7BCLZ5","created_at":"2026-05-26T02:04:05.873135+00:00"},{"alias_kind":"pith_short_16","alias_value":"GMFC4F7BCLZ5HNWV","created_at":"2026-05-26T02:04:05.873135+00:00"},{"alias_kind":"pith_short_8","alias_value":"GMFC4F7B","created_at":"2026-05-26T02:04:05.873135+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/GMFC4F7BCLZ5HNWV6MSWMUHI3G","json":"https://pith.science/pith/GMFC4F7BCLZ5HNWV6MSWMUHI3G.json","graph_json":"https://pith.science/api/pith-number/GMFC4F7BCLZ5HNWV6MSWMUHI3G/graph.json","events_json":"https://pith.science/api/pith-number/GMFC4F7BCLZ5HNWV6MSWMUHI3G/events.json","paper":"https://pith.science/paper/GMFC4F7B"},"agent_actions":{"view_html":"https://pith.science/pith/GMFC4F7BCLZ5HNWV6MSWMUHI3G","download_json":"https://pith.science/pith/GMFC4F7BCLZ5HNWV6MSWMUHI3G.json","view_paper":"https://pith.science/paper/GMFC4F7B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.08684&json=true","fetch_graph":"https://pith.science/api/pith-number/GMFC4F7BCLZ5HNWV6MSWMUHI3G/graph.json","fetch_events":"https://pith.science/api/pith-number/GMFC4F7BCLZ5HNWV6MSWMUHI3G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GMFC4F7BCLZ5HNWV6MSWMUHI3G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GMFC4F7BCLZ5HNWV6MSWMUHI3G/action/storage_attestation","attest_author":"https://pith.science/pith/GMFC4F7BCLZ5HNWV6MSWMUHI3G/action/author_attestation","sign_citation":"https://pith.science/pith/GMFC4F7BCLZ5HNWV6MSWMUHI3G/action/citation_signature","submit_replication":"https://pith.science/pith/GMFC4F7BCLZ5HNWV6MSWMUHI3G/action/replication_record"}},"created_at":"2026-05-26T02:04:05.873135+00:00","updated_at":"2026-05-26T02:04:05.873135+00:00"}