{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VFH3XE7O57UCABN24YHARYO3DT","short_pith_number":"pith:VFH3XE7O","schema_version":"1.0","canonical_sha256":"a94fbb93eeefe82005bae60e08e1db1cc60a92269cc2f6dc1b6b1031d8c0bab7","source":{"kind":"arxiv","id":"1304.1205","version":1},"attestation_state":"computed","paper":{"title":"Minimum number of distinct eigenvalues of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bahman Ahmadi, Fatemeh Alinaghipour, Karen Meagher, Michael S. Cavers, Shahla Nasserasr, Shaun Fallat","submitted_at":"2013-04-03T22:37:38Z","abstract_excerpt":"The minimum number of distinct eigenvalues, taken over all real symmetric matrices compatible with a given graph $G$, is denoted by $q(G)$. Using other parameters related to $G$, bounds for $q(G)$ are proven and then applied to deduce further properties of $q(G)$. It is shown that there is a great number of graphs $G$ for which $q(G)=2$. For some families of graphs, such as the join of a graph with itself, complete bipartite graphs, and cycles, this minimum value is obtained. Moreover, examples of graphs $G$ are provided to show that adding and deleting edges or vertices can dramatically chang"},"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":"1304.1205","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-03T22:37:38Z","cross_cats_sorted":[],"title_canon_sha256":"52467f4a440a4d9d7ed6cac8ac8d9265ba93f61cf45158f396a6cec2d209a991","abstract_canon_sha256":"aa0141f27d30ad39d64b3bbf2c2ea78c3ca7eafe96ab43d7b825daeedabd44a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:04.259952Z","signature_b64":"pnPaNBaWAqItWteskDMp1fNmwGvqqQ7l8GtnksMzCzbojVlKbPtBXsAYHAUh2VJb16B8xNudKdV0x8QFfAKfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a94fbb93eeefe82005bae60e08e1db1cc60a92269cc2f6dc1b6b1031d8c0bab7","last_reissued_at":"2026-05-18T03:29:04.259260Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:04.259260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum number of distinct eigenvalues of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bahman Ahmadi, Fatemeh Alinaghipour, Karen Meagher, Michael S. Cavers, Shahla Nasserasr, Shaun Fallat","submitted_at":"2013-04-03T22:37:38Z","abstract_excerpt":"The minimum number of distinct eigenvalues, taken over all real symmetric matrices compatible with a given graph $G$, is denoted by $q(G)$. Using other parameters related to $G$, bounds for $q(G)$ are proven and then applied to deduce further properties of $q(G)$. It is shown that there is a great number of graphs $G$ for which $q(G)=2$. For some families of graphs, such as the join of a graph with itself, complete bipartite graphs, and cycles, this minimum value is obtained. Moreover, examples of graphs $G$ are provided to show that adding and deleting edges or vertices can dramatically chang"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1205","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":"1304.1205","created_at":"2026-05-18T03:29:04.259354+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.1205v1","created_at":"2026-05-18T03:29:04.259354+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1205","created_at":"2026-05-18T03:29:04.259354+00:00"},{"alias_kind":"pith_short_12","alias_value":"VFH3XE7O57UC","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VFH3XE7O57UCABN2","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VFH3XE7O","created_at":"2026-05-18T12:28:04.890932+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/VFH3XE7O57UCABN24YHARYO3DT","json":"https://pith.science/pith/VFH3XE7O57UCABN24YHARYO3DT.json","graph_json":"https://pith.science/api/pith-number/VFH3XE7O57UCABN24YHARYO3DT/graph.json","events_json":"https://pith.science/api/pith-number/VFH3XE7O57UCABN24YHARYO3DT/events.json","paper":"https://pith.science/paper/VFH3XE7O"},"agent_actions":{"view_html":"https://pith.science/pith/VFH3XE7O57UCABN24YHARYO3DT","download_json":"https://pith.science/pith/VFH3XE7O57UCABN24YHARYO3DT.json","view_paper":"https://pith.science/paper/VFH3XE7O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.1205&json=true","fetch_graph":"https://pith.science/api/pith-number/VFH3XE7O57UCABN24YHARYO3DT/graph.json","fetch_events":"https://pith.science/api/pith-number/VFH3XE7O57UCABN24YHARYO3DT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VFH3XE7O57UCABN24YHARYO3DT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VFH3XE7O57UCABN24YHARYO3DT/action/storage_attestation","attest_author":"https://pith.science/pith/VFH3XE7O57UCABN24YHARYO3DT/action/author_attestation","sign_citation":"https://pith.science/pith/VFH3XE7O57UCABN24YHARYO3DT/action/citation_signature","submit_replication":"https://pith.science/pith/VFH3XE7O57UCABN24YHARYO3DT/action/replication_record"}},"created_at":"2026-05-18T03:29:04.259354+00:00","updated_at":"2026-05-18T03:29:04.259354+00:00"}