{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EJZBGLGHZ4ZUAK4MGCMZ2DYO5Z","short_pith_number":"pith:EJZBGLGH","schema_version":"1.0","canonical_sha256":"2272132cc7cf33402b8c30999d0f0eee60df4d92d5e939f52202cb48f068e5bf","source":{"kind":"arxiv","id":"1303.4517","version":2},"attestation_state":"computed","paper":{"title":"A short note on a short remark of Graham and Lov\\'{a}sz","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jernej Azarija","submitted_at":"2013-03-19T09:14:08Z","abstract_excerpt":"Let D be the distance matrix of a connected graph G and let nn(G), np(G) be the number of strictly negative and positive eigenvalues of D respectively. It was remarked in [1] that it is not known whether there is a graph for which np(G) > nn (G). In this note we show that there exists an infinite number of graphs satisfying the stated inequality, namely the conference graphs of order> 9. A large representative of this class being the Paley graphs.The result is obtained by derving the eigenvalues of the distance matrix of a strongly-regular graph."},"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":"1303.4517","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-19T09:14:08Z","cross_cats_sorted":[],"title_canon_sha256":"81234e7d7d600f9aa3f5edc82413df2156d63aa9c7ca51ce970f8bb652f9c985","abstract_canon_sha256":"e0f8c4ba6b4bc92cb8194b518387092e5a0e878d293cb45012745f18bc8867e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:57.650020Z","signature_b64":"hf8rlQnF06lV+HtbKDJt7Xtvk+NIh2kS+UbIkpXqe+8SvBa4uyQ6J+KVphb60SsCGXtRHMIo+Ht6j1iw7keLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2272132cc7cf33402b8c30999d0f0eee60df4d92d5e939f52202cb48f068e5bf","last_reissued_at":"2026-05-18T03:11:57.649133Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:57.649133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A short note on a short remark of Graham and Lov\\'{a}sz","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jernej Azarija","submitted_at":"2013-03-19T09:14:08Z","abstract_excerpt":"Let D be the distance matrix of a connected graph G and let nn(G), np(G) be the number of strictly negative and positive eigenvalues of D respectively. It was remarked in [1] that it is not known whether there is a graph for which np(G) > nn (G). In this note we show that there exists an infinite number of graphs satisfying the stated inequality, namely the conference graphs of order> 9. A large representative of this class being the Paley graphs.The result is obtained by derving the eigenvalues of the distance matrix of a strongly-regular graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4517","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":"1303.4517","created_at":"2026-05-18T03:11:57.649258+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.4517v2","created_at":"2026-05-18T03:11:57.649258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4517","created_at":"2026-05-18T03:11:57.649258+00:00"},{"alias_kind":"pith_short_12","alias_value":"EJZBGLGHZ4ZU","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EJZBGLGHZ4ZUAK4M","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EJZBGLGH","created_at":"2026-05-18T12:27:43.054852+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/EJZBGLGHZ4ZUAK4MGCMZ2DYO5Z","json":"https://pith.science/pith/EJZBGLGHZ4ZUAK4MGCMZ2DYO5Z.json","graph_json":"https://pith.science/api/pith-number/EJZBGLGHZ4ZUAK4MGCMZ2DYO5Z/graph.json","events_json":"https://pith.science/api/pith-number/EJZBGLGHZ4ZUAK4MGCMZ2DYO5Z/events.json","paper":"https://pith.science/paper/EJZBGLGH"},"agent_actions":{"view_html":"https://pith.science/pith/EJZBGLGHZ4ZUAK4MGCMZ2DYO5Z","download_json":"https://pith.science/pith/EJZBGLGHZ4ZUAK4MGCMZ2DYO5Z.json","view_paper":"https://pith.science/paper/EJZBGLGH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.4517&json=true","fetch_graph":"https://pith.science/api/pith-number/EJZBGLGHZ4ZUAK4MGCMZ2DYO5Z/graph.json","fetch_events":"https://pith.science/api/pith-number/EJZBGLGHZ4ZUAK4MGCMZ2DYO5Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EJZBGLGHZ4ZUAK4MGCMZ2DYO5Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EJZBGLGHZ4ZUAK4MGCMZ2DYO5Z/action/storage_attestation","attest_author":"https://pith.science/pith/EJZBGLGHZ4ZUAK4MGCMZ2DYO5Z/action/author_attestation","sign_citation":"https://pith.science/pith/EJZBGLGHZ4ZUAK4MGCMZ2DYO5Z/action/citation_signature","submit_replication":"https://pith.science/pith/EJZBGLGHZ4ZUAK4MGCMZ2DYO5Z/action/replication_record"}},"created_at":"2026-05-18T03:11:57.649258+00:00","updated_at":"2026-05-18T03:11:57.649258+00:00"}