{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4LNSG66YOXWPETJFJAN6ZQ54Y3","short_pith_number":"pith:4LNSG66Y","schema_version":"1.0","canonical_sha256":"e2db237bd875ecf24d25481becc3bcc6f35f55bf83accc80cadea0d5ecb095f7","source":{"kind":"arxiv","id":"1906.07705","version":1},"attestation_state":"computed","paper":{"title":"Characterizing cospectral vertices via isospectral reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin Webb, Dallas Smith, John Sinkovic, Mark Kempton","submitted_at":"2019-06-18T17:36:38Z","abstract_excerpt":"Two emerging topics in graph theory are the study of cospectral vertices of a graph, and the study of isospectral reductions of graphs. In this paper, we prove a fundamental relationship between these two areas, which is that two vertices of a graph are cospectral if and only if the isospectral reduction over these vertices has a nontrivial automorphism. It is well known that if two vertices of a graph are symmetric, i.e. if there exists a graph automorphism permuting these two vertices, then they are cospectral. This paper extends this result showing that any two cospectral vertices are symme"},"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":"1906.07705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-18T17:36:38Z","cross_cats_sorted":[],"title_canon_sha256":"88f0137d82f9c45845026de0efeca3f723f3b93b8496c6a136c20c05dd9d82ab","abstract_canon_sha256":"02581d9492916d6b40f671ed9e264c3db0af39170121367579f0d6254efe92f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:59.520924Z","signature_b64":"wyheJvWKe/BtxEmwqHakh7esDok3NTLrszzae+j2+GLaf7Rw+G8uHiMUydJS195aqyDbPcF1kK8p2qiWOR57Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2db237bd875ecf24d25481becc3bcc6f35f55bf83accc80cadea0d5ecb095f7","last_reissued_at":"2026-05-17T23:42:59.520466Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:59.520466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterizing cospectral vertices via isospectral reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin Webb, Dallas Smith, John Sinkovic, Mark Kempton","submitted_at":"2019-06-18T17:36:38Z","abstract_excerpt":"Two emerging topics in graph theory are the study of cospectral vertices of a graph, and the study of isospectral reductions of graphs. In this paper, we prove a fundamental relationship between these two areas, which is that two vertices of a graph are cospectral if and only if the isospectral reduction over these vertices has a nontrivial automorphism. It is well known that if two vertices of a graph are symmetric, i.e. if there exists a graph automorphism permuting these two vertices, then they are cospectral. This paper extends this result showing that any two cospectral vertices are symme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.07705","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":""},"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":"1906.07705","created_at":"2026-05-17T23:42:59.520538+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.07705v1","created_at":"2026-05-17T23:42:59.520538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.07705","created_at":"2026-05-17T23:42:59.520538+00:00"},{"alias_kind":"pith_short_12","alias_value":"4LNSG66YOXWP","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4LNSG66YOXWPETJF","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4LNSG66Y","created_at":"2026-05-18T12:33:10.108867+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/4LNSG66YOXWPETJFJAN6ZQ54Y3","json":"https://pith.science/pith/4LNSG66YOXWPETJFJAN6ZQ54Y3.json","graph_json":"https://pith.science/api/pith-number/4LNSG66YOXWPETJFJAN6ZQ54Y3/graph.json","events_json":"https://pith.science/api/pith-number/4LNSG66YOXWPETJFJAN6ZQ54Y3/events.json","paper":"https://pith.science/paper/4LNSG66Y"},"agent_actions":{"view_html":"https://pith.science/pith/4LNSG66YOXWPETJFJAN6ZQ54Y3","download_json":"https://pith.science/pith/4LNSG66YOXWPETJFJAN6ZQ54Y3.json","view_paper":"https://pith.science/paper/4LNSG66Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.07705&json=true","fetch_graph":"https://pith.science/api/pith-number/4LNSG66YOXWPETJFJAN6ZQ54Y3/graph.json","fetch_events":"https://pith.science/api/pith-number/4LNSG66YOXWPETJFJAN6ZQ54Y3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4LNSG66YOXWPETJFJAN6ZQ54Y3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4LNSG66YOXWPETJFJAN6ZQ54Y3/action/storage_attestation","attest_author":"https://pith.science/pith/4LNSG66YOXWPETJFJAN6ZQ54Y3/action/author_attestation","sign_citation":"https://pith.science/pith/4LNSG66YOXWPETJFJAN6ZQ54Y3/action/citation_signature","submit_replication":"https://pith.science/pith/4LNSG66YOXWPETJFJAN6ZQ54Y3/action/replication_record"}},"created_at":"2026-05-17T23:42:59.520538+00:00","updated_at":"2026-05-17T23:42:59.520538+00:00"}