{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OTH2CUFZLLSVWBIEKDIWSI2D7S","short_pith_number":"pith:OTH2CUFZ","schema_version":"1.0","canonical_sha256":"74cfa150b95ae55b050450d1692343fcb9976527f5350c3ffeec61b50d8b7779","source":{"kind":"arxiv","id":"1804.00369","version":1},"attestation_state":"computed","paper":{"title":"On graphs with smallest eigenvalue at least -3 and their lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jack H. Koolen, Jae Young Yang, Qianqian Yang","submitted_at":"2018-04-02T01:37:30Z","abstract_excerpt":"In this paper, we show that a connected graph with smallest eigenvalue at least -3 and large enough minimal degree is 2-integrable. This result generalizes a 1977 result of Hoffman for connected graphs with smallest eigenvalue at least -2."},"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":"1804.00369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-02T01:37:30Z","cross_cats_sorted":[],"title_canon_sha256":"18e3f78d7f5c37c90963534df3e587a092379a344427727e8523ec88634eafe7","abstract_canon_sha256":"8a838c5cc618bcae5393e715b9b2b21b333b4dc69923943a125218ee601c3721"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:37.466620Z","signature_b64":"qbG9vaZs/54czv2pw5pOI7D9UpZ3Z/86b8LZdZ//yjQa19WYdeXmYIM7e+EnzjbvcbBYgxvbuMlHb48GRbPoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74cfa150b95ae55b050450d1692343fcb9976527f5350c3ffeec61b50d8b7779","last_reissued_at":"2026-05-18T00:19:37.465731Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:37.465731Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On graphs with smallest eigenvalue at least -3 and their lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jack H. Koolen, Jae Young Yang, Qianqian Yang","submitted_at":"2018-04-02T01:37:30Z","abstract_excerpt":"In this paper, we show that a connected graph with smallest eigenvalue at least -3 and large enough minimal degree is 2-integrable. This result generalizes a 1977 result of Hoffman for connected graphs with smallest eigenvalue at least -2."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00369","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":"1804.00369","created_at":"2026-05-18T00:19:37.465879+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.00369v1","created_at":"2026-05-18T00:19:37.465879+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00369","created_at":"2026-05-18T00:19:37.465879+00:00"},{"alias_kind":"pith_short_12","alias_value":"OTH2CUFZLLSV","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OTH2CUFZLLSVWBIE","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OTH2CUFZ","created_at":"2026-05-18T12:32:43.782077+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/OTH2CUFZLLSVWBIEKDIWSI2D7S","json":"https://pith.science/pith/OTH2CUFZLLSVWBIEKDIWSI2D7S.json","graph_json":"https://pith.science/api/pith-number/OTH2CUFZLLSVWBIEKDIWSI2D7S/graph.json","events_json":"https://pith.science/api/pith-number/OTH2CUFZLLSVWBIEKDIWSI2D7S/events.json","paper":"https://pith.science/paper/OTH2CUFZ"},"agent_actions":{"view_html":"https://pith.science/pith/OTH2CUFZLLSVWBIEKDIWSI2D7S","download_json":"https://pith.science/pith/OTH2CUFZLLSVWBIEKDIWSI2D7S.json","view_paper":"https://pith.science/paper/OTH2CUFZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.00369&json=true","fetch_graph":"https://pith.science/api/pith-number/OTH2CUFZLLSVWBIEKDIWSI2D7S/graph.json","fetch_events":"https://pith.science/api/pith-number/OTH2CUFZLLSVWBIEKDIWSI2D7S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OTH2CUFZLLSVWBIEKDIWSI2D7S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OTH2CUFZLLSVWBIEKDIWSI2D7S/action/storage_attestation","attest_author":"https://pith.science/pith/OTH2CUFZLLSVWBIEKDIWSI2D7S/action/author_attestation","sign_citation":"https://pith.science/pith/OTH2CUFZLLSVWBIEKDIWSI2D7S/action/citation_signature","submit_replication":"https://pith.science/pith/OTH2CUFZLLSVWBIEKDIWSI2D7S/action/replication_record"}},"created_at":"2026-05-18T00:19:37.465879+00:00","updated_at":"2026-05-18T00:19:37.465879+00:00"}