{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:VS3ALAA5YXNDNWIKEFV54OXWB4","short_pith_number":"pith:VS3ALAA5","schema_version":"1.0","canonical_sha256":"acb605801dc5da36d90a216bde3af60f06c859596fe38d5a7271283a8dbd09a8","source":{"kind":"arxiv","id":"1407.4562","version":2},"attestation_state":"computed","paper":{"title":"Linear programming bounds for regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hiroshi Nozaki","submitted_at":"2014-07-17T05:29:37Z","abstract_excerpt":"Delsarte, Goethals, and Seidel (1977) used the linear programming method in order to find bounds for the size of spherical codes endowed with prescribed inner products between distinct points in the code. In this paper, we develop the linear programming method to obtain bounds for the number of vertices of connected regular graphs endowed with given distinct eigenvalues. This method is proved by some \"dual\" technique of the spherical case, motivated from the theory of association scheme. As an application of this bound, we prove that a connected $k$-regular graph satisfying $g>2d-1$ has the mi"},"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":"1407.4562","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-17T05:29:37Z","cross_cats_sorted":[],"title_canon_sha256":"e10605170208f7b6dbde118bee96188e47e2ed58fe3c545c157d4fdc153fa745","abstract_canon_sha256":"57057e7e77196ded34069a1574d03d612dbae2677f6789522717107fb0b3184f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:51.655408Z","signature_b64":"0+Lod9zjewcgytkScC4MG87MN0/jsGWtofZckblh4JWfyrmD2EnlJNZws2hCi1ME37JuxkzF1HcqEoc8KXvADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acb605801dc5da36d90a216bde3af60f06c859596fe38d5a7271283a8dbd09a8","last_reissued_at":"2026-05-18T01:36:51.654740Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:51.654740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear programming bounds for regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hiroshi Nozaki","submitted_at":"2014-07-17T05:29:37Z","abstract_excerpt":"Delsarte, Goethals, and Seidel (1977) used the linear programming method in order to find bounds for the size of spherical codes endowed with prescribed inner products between distinct points in the code. In this paper, we develop the linear programming method to obtain bounds for the number of vertices of connected regular graphs endowed with given distinct eigenvalues. This method is proved by some \"dual\" technique of the spherical case, motivated from the theory of association scheme. As an application of this bound, we prove that a connected $k$-regular graph satisfying $g>2d-1$ has the mi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4562","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":"1407.4562","created_at":"2026-05-18T01:36:51.654832+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.4562v2","created_at":"2026-05-18T01:36:51.654832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4562","created_at":"2026-05-18T01:36:51.654832+00:00"},{"alias_kind":"pith_short_12","alias_value":"VS3ALAA5YXND","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"VS3ALAA5YXNDNWIK","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"VS3ALAA5","created_at":"2026-05-18T12:28:54.890064+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/VS3ALAA5YXNDNWIKEFV54OXWB4","json":"https://pith.science/pith/VS3ALAA5YXNDNWIKEFV54OXWB4.json","graph_json":"https://pith.science/api/pith-number/VS3ALAA5YXNDNWIKEFV54OXWB4/graph.json","events_json":"https://pith.science/api/pith-number/VS3ALAA5YXNDNWIKEFV54OXWB4/events.json","paper":"https://pith.science/paper/VS3ALAA5"},"agent_actions":{"view_html":"https://pith.science/pith/VS3ALAA5YXNDNWIKEFV54OXWB4","download_json":"https://pith.science/pith/VS3ALAA5YXNDNWIKEFV54OXWB4.json","view_paper":"https://pith.science/paper/VS3ALAA5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.4562&json=true","fetch_graph":"https://pith.science/api/pith-number/VS3ALAA5YXNDNWIKEFV54OXWB4/graph.json","fetch_events":"https://pith.science/api/pith-number/VS3ALAA5YXNDNWIKEFV54OXWB4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VS3ALAA5YXNDNWIKEFV54OXWB4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VS3ALAA5YXNDNWIKEFV54OXWB4/action/storage_attestation","attest_author":"https://pith.science/pith/VS3ALAA5YXNDNWIKEFV54OXWB4/action/author_attestation","sign_citation":"https://pith.science/pith/VS3ALAA5YXNDNWIKEFV54OXWB4/action/citation_signature","submit_replication":"https://pith.science/pith/VS3ALAA5YXNDNWIKEFV54OXWB4/action/replication_record"}},"created_at":"2026-05-18T01:36:51.654832+00:00","updated_at":"2026-05-18T01:36:51.654832+00:00"}