{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:EL5BZ7O5QIPE2EPGAUMNXVPWO2","short_pith_number":"pith:EL5BZ7O5","schema_version":"1.0","canonical_sha256":"22fa1cfddd821e4d11e60518dbd5f676b6dff69d6a6a2ad2ac86423dfa32c6fd","source":{"kind":"arxiv","id":"1211.3929","version":4},"attestation_state":"computed","paper":{"title":"Fat Hoffman graphs with smallest eigenvalue greater than -3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Akihiro Munemasa, Tetsuji Taniguchi, Yoshio Sano","submitted_at":"2012-11-16T15:49:59Z","abstract_excerpt":"In this paper, we give a combinatorial characterization of the special graphs of fat Hoffman graphs containing $\\mathfrak{K}_{1,2}$ with smallest eigenvalue greater than -3, where $\\mathfrak{K}_{1,2}$ is the Hoffman graph having one slim vertex and two fat vertices."},"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":"1211.3929","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-16T15:49:59Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"118f07b28a6b9c7675207372a04887b489d31bc17c1250db911ca46171ad1535","abstract_canon_sha256":"5f775332f63e80e44094946683e9f2f3c53459d4beac10bff611f9a12faaa26b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:32.221555Z","signature_b64":"VyqXoR37oX0+UNKhLwN8nPmLldkEe0rNl3H625Rz9eSTFQcZJ7y3ZcDwaDO1+fcav9BznfEcLjKWAulm+THODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22fa1cfddd821e4d11e60518dbd5f676b6dff69d6a6a2ad2ac86423dfa32c6fd","last_reissued_at":"2026-05-18T02:45:32.220845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:32.220845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fat Hoffman graphs with smallest eigenvalue greater than -3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Akihiro Munemasa, Tetsuji Taniguchi, Yoshio Sano","submitted_at":"2012-11-16T15:49:59Z","abstract_excerpt":"In this paper, we give a combinatorial characterization of the special graphs of fat Hoffman graphs containing $\\mathfrak{K}_{1,2}$ with smallest eigenvalue greater than -3, where $\\mathfrak{K}_{1,2}$ is the Hoffman graph having one slim vertex and two fat vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3929","kind":"arxiv","version":4},"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":"1211.3929","created_at":"2026-05-18T02:45:32.220964+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.3929v4","created_at":"2026-05-18T02:45:32.220964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3929","created_at":"2026-05-18T02:45:32.220964+00:00"},{"alias_kind":"pith_short_12","alias_value":"EL5BZ7O5QIPE","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"EL5BZ7O5QIPE2EPG","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"EL5BZ7O5","created_at":"2026-05-18T12:27:04.183437+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/EL5BZ7O5QIPE2EPGAUMNXVPWO2","json":"https://pith.science/pith/EL5BZ7O5QIPE2EPGAUMNXVPWO2.json","graph_json":"https://pith.science/api/pith-number/EL5BZ7O5QIPE2EPGAUMNXVPWO2/graph.json","events_json":"https://pith.science/api/pith-number/EL5BZ7O5QIPE2EPGAUMNXVPWO2/events.json","paper":"https://pith.science/paper/EL5BZ7O5"},"agent_actions":{"view_html":"https://pith.science/pith/EL5BZ7O5QIPE2EPGAUMNXVPWO2","download_json":"https://pith.science/pith/EL5BZ7O5QIPE2EPGAUMNXVPWO2.json","view_paper":"https://pith.science/paper/EL5BZ7O5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.3929&json=true","fetch_graph":"https://pith.science/api/pith-number/EL5BZ7O5QIPE2EPGAUMNXVPWO2/graph.json","fetch_events":"https://pith.science/api/pith-number/EL5BZ7O5QIPE2EPGAUMNXVPWO2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EL5BZ7O5QIPE2EPGAUMNXVPWO2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EL5BZ7O5QIPE2EPGAUMNXVPWO2/action/storage_attestation","attest_author":"https://pith.science/pith/EL5BZ7O5QIPE2EPGAUMNXVPWO2/action/author_attestation","sign_citation":"https://pith.science/pith/EL5BZ7O5QIPE2EPGAUMNXVPWO2/action/citation_signature","submit_replication":"https://pith.science/pith/EL5BZ7O5QIPE2EPGAUMNXVPWO2/action/replication_record"}},"created_at":"2026-05-18T02:45:32.220964+00:00","updated_at":"2026-05-18T02:45:32.220964+00:00"}