{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:BMYUBSZVNDGCKUDU7XKFDKJEBK","short_pith_number":"pith:BMYUBSZV","schema_version":"1.0","canonical_sha256":"0b3140cb3568cc255074fdd451a9240ab503383db44194c6f07c2e1c492c8302","source":{"kind":"arxiv","id":"1008.3646","version":2},"attestation_state":"computed","paper":{"title":"A construction of cospectral graphs for the normalized Laplacian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jason Grout, Steve Butler","submitted_at":"2010-08-21T17:04:00Z","abstract_excerpt":"We give a method to construct cospectral graphs for the normalized Laplacian by a local modification in some graphs with special structure. Namely, under some simple assumptions, we can replace a small bipartite graph with a cospectral mate without changing the spectrum of the entire graph. We also consider a related result for swapping out biregular bipartite graphs for the matrix $A+tD$.\n  We produce (exponentially) large families of non-bipartite, non-regular graphs which are mutually cospectral, and also give an example of a graph which is cospectral with its complement but is not self-com"},"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":"1008.3646","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-21T17:04:00Z","cross_cats_sorted":[],"title_canon_sha256":"b3c2a7059827daf4ee6f20ffd305416f905bc510e2762cb73d11362453229800","abstract_canon_sha256":"2fd52c18cfa0e2490c64dd3b3083d2001c0cfa6a29ef80f29ad57d6fd2f8d3a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:54.688747Z","signature_b64":"NHwsxBymTOErb35+zCydHYZxnB4KFRyIrCkcsZXsCYtpaLR7GhiCmVsfGmLuskldVTVzCYENBdaTgeuJuw1fAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b3140cb3568cc255074fdd451a9240ab503383db44194c6f07c2e1c492c8302","last_reissued_at":"2026-05-18T04:03:54.688253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:54.688253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A construction of cospectral graphs for the normalized Laplacian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jason Grout, Steve Butler","submitted_at":"2010-08-21T17:04:00Z","abstract_excerpt":"We give a method to construct cospectral graphs for the normalized Laplacian by a local modification in some graphs with special structure. Namely, under some simple assumptions, we can replace a small bipartite graph with a cospectral mate without changing the spectrum of the entire graph. We also consider a related result for swapping out biregular bipartite graphs for the matrix $A+tD$.\n  We produce (exponentially) large families of non-bipartite, non-regular graphs which are mutually cospectral, and also give an example of a graph which is cospectral with its complement but is not self-com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3646","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":""},"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":"1008.3646","created_at":"2026-05-18T04:03:54.688333+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.3646v2","created_at":"2026-05-18T04:03:54.688333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3646","created_at":"2026-05-18T04:03:54.688333+00:00"},{"alias_kind":"pith_short_12","alias_value":"BMYUBSZVNDGC","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"BMYUBSZVNDGCKUDU","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"BMYUBSZV","created_at":"2026-05-18T12:26:05.355336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2601.13334","citing_title":"SEER: Spectral Entropy Encoding of Roles for Context-Aware Attention-Based Design Pattern Detection","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BMYUBSZVNDGCKUDU7XKFDKJEBK","json":"https://pith.science/pith/BMYUBSZVNDGCKUDU7XKFDKJEBK.json","graph_json":"https://pith.science/api/pith-number/BMYUBSZVNDGCKUDU7XKFDKJEBK/graph.json","events_json":"https://pith.science/api/pith-number/BMYUBSZVNDGCKUDU7XKFDKJEBK/events.json","paper":"https://pith.science/paper/BMYUBSZV"},"agent_actions":{"view_html":"https://pith.science/pith/BMYUBSZVNDGCKUDU7XKFDKJEBK","download_json":"https://pith.science/pith/BMYUBSZVNDGCKUDU7XKFDKJEBK.json","view_paper":"https://pith.science/paper/BMYUBSZV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.3646&json=true","fetch_graph":"https://pith.science/api/pith-number/BMYUBSZVNDGCKUDU7XKFDKJEBK/graph.json","fetch_events":"https://pith.science/api/pith-number/BMYUBSZVNDGCKUDU7XKFDKJEBK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BMYUBSZVNDGCKUDU7XKFDKJEBK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BMYUBSZVNDGCKUDU7XKFDKJEBK/action/storage_attestation","attest_author":"https://pith.science/pith/BMYUBSZVNDGCKUDU7XKFDKJEBK/action/author_attestation","sign_citation":"https://pith.science/pith/BMYUBSZVNDGCKUDU7XKFDKJEBK/action/citation_signature","submit_replication":"https://pith.science/pith/BMYUBSZVNDGCKUDU7XKFDKJEBK/action/replication_record"}},"created_at":"2026-05-18T04:03:54.688333+00:00","updated_at":"2026-05-18T04:03:54.688333+00:00"}