{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HBNFUMLOWBCCMDALFHU7VWWS34","short_pith_number":"pith:HBNFUMLO","schema_version":"1.0","canonical_sha256":"385a5a316eb044260c0b29e9fadad2df2f2b8aaab0ebff7cb784c19a3e83ae6a","source":{"kind":"arxiv","id":"1310.6529","version":1},"attestation_state":"computed","paper":{"title":"The graphs with all but two eigenvalues equal to $\\pm 1$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jason Vermette, Sebastian M. Cioab\\u{a}, Willem H. Haemers, Wiseley Wong","submitted_at":"2013-10-24T08:49:58Z","abstract_excerpt":"We determine all graphs whose adjacency matrix has at most two eigenvalues (multiplicities included) different from $\\pm 1$ and decide which of these graphs are determined by their spectrum. This includes the so-called friendship graphs, which consist of a number of edge-disjoint triangles meeting in one vertex. It turns out that the friendship graph is determined by its spectrum, except when the number of triangles equals sixteen."},"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":"1310.6529","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-24T08:49:58Z","cross_cats_sorted":[],"title_canon_sha256":"fb4118e7c7508d1b956170028b607a747cb1661640fd6ecb0112c7c727603880","abstract_canon_sha256":"db9f8b9938752847f565afc286f025ab4a204e48a4ba8808cb1cdd85690625d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:09.707987Z","signature_b64":"3x1XKifO7obdExGBf+mmDokJsNvTP05W8udaRKzGX0Y6jcmKctm/Sb3ITf0lsLqDMMy5WkS1lq97KPNBz3NXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"385a5a316eb044260c0b29e9fadad2df2f2b8aaab0ebff7cb784c19a3e83ae6a","last_reissued_at":"2026-05-18T03:09:09.707291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:09.707291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The graphs with all but two eigenvalues equal to $\\pm 1$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jason Vermette, Sebastian M. Cioab\\u{a}, Willem H. Haemers, Wiseley Wong","submitted_at":"2013-10-24T08:49:58Z","abstract_excerpt":"We determine all graphs whose adjacency matrix has at most two eigenvalues (multiplicities included) different from $\\pm 1$ and decide which of these graphs are determined by their spectrum. This includes the so-called friendship graphs, which consist of a number of edge-disjoint triangles meeting in one vertex. It turns out that the friendship graph is determined by its spectrum, except when the number of triangles equals sixteen."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6529","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":"1310.6529","created_at":"2026-05-18T03:09:09.707414+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.6529v1","created_at":"2026-05-18T03:09:09.707414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6529","created_at":"2026-05-18T03:09:09.707414+00:00"},{"alias_kind":"pith_short_12","alias_value":"HBNFUMLOWBCC","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HBNFUMLOWBCCMDAL","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HBNFUMLO","created_at":"2026-05-18T12:27:46.883200+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/HBNFUMLOWBCCMDALFHU7VWWS34","json":"https://pith.science/pith/HBNFUMLOWBCCMDALFHU7VWWS34.json","graph_json":"https://pith.science/api/pith-number/HBNFUMLOWBCCMDALFHU7VWWS34/graph.json","events_json":"https://pith.science/api/pith-number/HBNFUMLOWBCCMDALFHU7VWWS34/events.json","paper":"https://pith.science/paper/HBNFUMLO"},"agent_actions":{"view_html":"https://pith.science/pith/HBNFUMLOWBCCMDALFHU7VWWS34","download_json":"https://pith.science/pith/HBNFUMLOWBCCMDALFHU7VWWS34.json","view_paper":"https://pith.science/paper/HBNFUMLO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.6529&json=true","fetch_graph":"https://pith.science/api/pith-number/HBNFUMLOWBCCMDALFHU7VWWS34/graph.json","fetch_events":"https://pith.science/api/pith-number/HBNFUMLOWBCCMDALFHU7VWWS34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HBNFUMLOWBCCMDALFHU7VWWS34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HBNFUMLOWBCCMDALFHU7VWWS34/action/storage_attestation","attest_author":"https://pith.science/pith/HBNFUMLOWBCCMDALFHU7VWWS34/action/author_attestation","sign_citation":"https://pith.science/pith/HBNFUMLOWBCCMDALFHU7VWWS34/action/citation_signature","submit_replication":"https://pith.science/pith/HBNFUMLOWBCCMDALFHU7VWWS34/action/replication_record"}},"created_at":"2026-05-18T03:09:09.707414+00:00","updated_at":"2026-05-18T03:09:09.707414+00:00"}