{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EJZBGLGHZ4ZUAK4MGCMZ2DYO5Z","short_pith_number":"pith:EJZBGLGH","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"},"canonical_sha256":"2272132cc7cf33402b8c30999d0f0eee60df4d92d5e939f52202cb48f068e5bf","source":{"kind":"arxiv","id":"1303.4517","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4517","created_at":"2026-05-18T03:11:57Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4517v2","created_at":"2026-05-18T03:11:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4517","created_at":"2026-05-18T03:11:57Z"},{"alias_kind":"pith_short_12","alias_value":"EJZBGLGHZ4ZU","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EJZBGLGHZ4ZUAK4M","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EJZBGLGH","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EJZBGLGHZ4ZUAK4MGCMZ2DYO5Z","target":"record","payload":{"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"},"canonical_sha256":"2272132cc7cf33402b8c30999d0f0eee60df4d92d5e939f52202cb48f068e5bf","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"},"source_kind":"arxiv","source_id":"1303.4517","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:11:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4e1NYCiDCVVm0AnoS+v/S7ts8XiClsawE5naDz5Oi1QfScUSO7zCNRarR2jazVobmCOZnfc/MNmswTx9uYfbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:04:02.357508Z"},"content_sha256":"be24a895049ee29e295b3c7aac5a0b060274b698cae8ba5ecfe7f4aae7a145e1","schema_version":"1.0","event_id":"sha256:be24a895049ee29e295b3c7aac5a0b060274b698cae8ba5ecfe7f4aae7a145e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EJZBGLGHZ4ZUAK4MGCMZ2DYO5Z","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:11:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z7JXZqEn5P5zK1uYbjfgausUrJoc1b7zI8VyYeXJFpYixIkJj6xe/OBqf4u/sBfpCCG4yNvsHkfbdrbjmzZjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T06:04:02.358217Z"},"content_sha256":"d68edf6a092e5eb228cb564834933322d6f098ddb367ec1405ec75127b1f288c","schema_version":"1.0","event_id":"sha256:d68edf6a092e5eb228cb564834933322d6f098ddb367ec1405ec75127b1f288c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EJZBGLGHZ4ZUAK4MGCMZ2DYO5Z/bundle.json","state_url":"https://pith.science/pith/EJZBGLGHZ4ZUAK4MGCMZ2DYO5Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EJZBGLGHZ4ZUAK4MGCMZ2DYO5Z/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T06:04:02Z","links":{"resolver":"https://pith.science/pith/EJZBGLGHZ4ZUAK4MGCMZ2DYO5Z","bundle":"https://pith.science/pith/EJZBGLGHZ4ZUAK4MGCMZ2DYO5Z/bundle.json","state":"https://pith.science/pith/EJZBGLGHZ4ZUAK4MGCMZ2DYO5Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EJZBGLGHZ4ZUAK4MGCMZ2DYO5Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EJZBGLGHZ4ZUAK4MGCMZ2DYO5Z","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e0f8c4ba6b4bc92cb8194b518387092e5a0e878d293cb45012745f18bc8867e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-19T09:14:08Z","title_canon_sha256":"81234e7d7d600f9aa3f5edc82413df2156d63aa9c7ca51ce970f8bb652f9c985"},"schema_version":"1.0","source":{"id":"1303.4517","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4517","created_at":"2026-05-18T03:11:57Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4517v2","created_at":"2026-05-18T03:11:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4517","created_at":"2026-05-18T03:11:57Z"},{"alias_kind":"pith_short_12","alias_value":"EJZBGLGHZ4ZU","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EJZBGLGHZ4ZUAK4M","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EJZBGLGH","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:d68edf6a092e5eb228cb564834933322d6f098ddb367ec1405ec75127b1f288c","target":"graph","created_at":"2026-05-18T03:11:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Jernej Azarija","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-19T09:14:08Z","title":"A short note on a short remark of Graham and Lov\\'{a}sz"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4517","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:be24a895049ee29e295b3c7aac5a0b060274b698cae8ba5ecfe7f4aae7a145e1","target":"record","created_at":"2026-05-18T03:11:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e0f8c4ba6b4bc92cb8194b518387092e5a0e878d293cb45012745f18bc8867e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-19T09:14:08Z","title_canon_sha256":"81234e7d7d600f9aa3f5edc82413df2156d63aa9c7ca51ce970f8bb652f9c985"},"schema_version":"1.0","source":{"id":"1303.4517","kind":"arxiv","version":2}},"canonical_sha256":"2272132cc7cf33402b8c30999d0f0eee60df4d92d5e939f52202cb48f068e5bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2272132cc7cf33402b8c30999d0f0eee60df4d92d5e939f52202cb48f068e5bf","first_computed_at":"2026-05-18T03:11:57.649133Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:57.649133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hf8rlQnF06lV+HtbKDJt7Xtvk+NIh2kS+UbIkpXqe+8SvBa4uyQ6J+KVphb60SsCGXtRHMIo+Ht6j1iw7keLBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:57.650020Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.4517","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be24a895049ee29e295b3c7aac5a0b060274b698cae8ba5ecfe7f4aae7a145e1","sha256:d68edf6a092e5eb228cb564834933322d6f098ddb367ec1405ec75127b1f288c"],"state_sha256":"dbc85121a058d7d89b6390d1d44f8cdbde9047ba259938e13cd937b7004215bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z2fRMDQblIsEDnefeAWWaWt6lfM2k70oe/ROFURg/AC4IE8prJNXYLb2JTD8NueJMdPcBNjXOoeRhTqHFF5UCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T06:04:02.361493Z","bundle_sha256":"8d9c3388bcefe2a86d77d1db55de52a9c31743acee9ac7eda27a371a4c959085"}}