{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GFFJH24ZKXHC3RAIWCNCZHMQZP","short_pith_number":"pith:GFFJH24Z","schema_version":"1.0","canonical_sha256":"314a93eb9955ce2dc408b09a2c9d90cbc0e81297a1d16647e92c53e8b9cde45e","source":{"kind":"arxiv","id":"1803.00246","version":2},"attestation_state":"computed","paper":{"title":"Cographs: Eigenvalues and Dilworth Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ebrahim Ghorbani","submitted_at":"2018-03-01T08:35:49Z","abstract_excerpt":"A cograph is a simple graph which contains no path on 4 vertices as an induced subgraph. The vicinal preorder on the vertex set of a graph is defined in terms of inclusions among the neighborhoods of vertices. The minimum number of chains with respect to the vicinal preorder required to cover the vertex set of a graph $G$ is called the Dilworth number of $G$. We prove that for any cograph $G$, the multiplicity of any eigenvalue $\\lambda\\ne0,-1$, does not exceed the Dilworth number of $G$ and show that this bound is tight. G. F. Royle [The rank of a cograph, Electron. J. Combin. 10 (2003), Note"},"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":"1803.00246","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-01T08:35:49Z","cross_cats_sorted":[],"title_canon_sha256":"2280543cd5de7b1346950aa710dc7771af4a2886e4a5c340aa7ef2fd7ec9ce3a","abstract_canon_sha256":"439024b0237d66acf63542f588d71a298963a5fb68d8e50de38b8cb32ddd0d99"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:22.016424Z","signature_b64":"sLt57AD8bz98ex3NZWw075Wbks+cg707C6/9lZB487Kw3k5LiixXteGiKYMNlvyYgnkYsVeJljWoKOEQHMdqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"314a93eb9955ce2dc408b09a2c9d90cbc0e81297a1d16647e92c53e8b9cde45e","last_reissued_at":"2026-05-18T00:10:22.015742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:22.015742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cographs: Eigenvalues and Dilworth Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ebrahim Ghorbani","submitted_at":"2018-03-01T08:35:49Z","abstract_excerpt":"A cograph is a simple graph which contains no path on 4 vertices as an induced subgraph. The vicinal preorder on the vertex set of a graph is defined in terms of inclusions among the neighborhoods of vertices. The minimum number of chains with respect to the vicinal preorder required to cover the vertex set of a graph $G$ is called the Dilworth number of $G$. We prove that for any cograph $G$, the multiplicity of any eigenvalue $\\lambda\\ne0,-1$, does not exceed the Dilworth number of $G$ and show that this bound is tight. G. F. Royle [The rank of a cograph, Electron. J. Combin. 10 (2003), Note"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00246","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":"1803.00246","created_at":"2026-05-18T00:10:22.015837+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.00246v2","created_at":"2026-05-18T00:10:22.015837+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00246","created_at":"2026-05-18T00:10:22.015837+00:00"},{"alias_kind":"pith_short_12","alias_value":"GFFJH24ZKXHC","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GFFJH24ZKXHC3RAI","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GFFJH24Z","created_at":"2026-05-18T12:32:25.280505+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/GFFJH24ZKXHC3RAIWCNCZHMQZP","json":"https://pith.science/pith/GFFJH24ZKXHC3RAIWCNCZHMQZP.json","graph_json":"https://pith.science/api/pith-number/GFFJH24ZKXHC3RAIWCNCZHMQZP/graph.json","events_json":"https://pith.science/api/pith-number/GFFJH24ZKXHC3RAIWCNCZHMQZP/events.json","paper":"https://pith.science/paper/GFFJH24Z"},"agent_actions":{"view_html":"https://pith.science/pith/GFFJH24ZKXHC3RAIWCNCZHMQZP","download_json":"https://pith.science/pith/GFFJH24ZKXHC3RAIWCNCZHMQZP.json","view_paper":"https://pith.science/paper/GFFJH24Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.00246&json=true","fetch_graph":"https://pith.science/api/pith-number/GFFJH24ZKXHC3RAIWCNCZHMQZP/graph.json","fetch_events":"https://pith.science/api/pith-number/GFFJH24ZKXHC3RAIWCNCZHMQZP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GFFJH24ZKXHC3RAIWCNCZHMQZP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GFFJH24ZKXHC3RAIWCNCZHMQZP/action/storage_attestation","attest_author":"https://pith.science/pith/GFFJH24ZKXHC3RAIWCNCZHMQZP/action/author_attestation","sign_citation":"https://pith.science/pith/GFFJH24ZKXHC3RAIWCNCZHMQZP/action/citation_signature","submit_replication":"https://pith.science/pith/GFFJH24ZKXHC3RAIWCNCZHMQZP/action/replication_record"}},"created_at":"2026-05-18T00:10:22.015837+00:00","updated_at":"2026-05-18T00:10:22.015837+00:00"}