{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VYDB34WVGAK4YCEAQHIRNKE2XB","short_pith_number":"pith:VYDB34WV","schema_version":"1.0","canonical_sha256":"ae061df2d53015cc088081d116a89ab84645336105575b1d9c229151127ebb22","source":{"kind":"arxiv","id":"1803.00245","version":1},"attestation_state":"computed","paper":{"title":"Vertex types in threshold and chain graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"E. Ghorbani, M. An{\\dj}eli\\'c, S.K. Simi\\'c","submitted_at":"2018-03-01T08:32:44Z","abstract_excerpt":"A graph is called a chain graph if it is bipartite and the neighborhoods of the vertices in each color class form a chain with respect to inclusion. A threshold graph can be obtained from a chain graph by making adjacent all pairs of vertices in one color class. Given a graph $G$, let $\\lambda$ be an eigenvalue (of the adjacency matrix) of $G$ with multiplicity $k \\geq 1$. A vertex $v$ of $G$ is a downer, or neutral, or Parter depending whether the multiplicity of $\\lambda$ in $G-v$ is $k-1$, or $k$, or $k+1$, respectively. We consider vertex types in the above sense in threshold and chain gra"},"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.00245","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-01T08:32:44Z","cross_cats_sorted":[],"title_canon_sha256":"6260f289811aaa65dd0f1268d20d35efc504b9926504a93c2e7944f8626907af","abstract_canon_sha256":"739a36012da9a6404c6b0619c91d1f1a4ad056774b666576dd9235d9734e8143"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:12.866304Z","signature_b64":"n7i3uu9lHn1kxh7Wyy/XUqnViGUz3m5410M+sNjZIxx+Wz4jmnxLUxiUtDqvAhxA/tnUOBlDSydi/S9HXeoSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae061df2d53015cc088081d116a89ab84645336105575b1d9c229151127ebb22","last_reissued_at":"2026-05-18T00:22:12.865557Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:12.865557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vertex types in threshold and chain graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"E. Ghorbani, M. An{\\dj}eli\\'c, S.K. Simi\\'c","submitted_at":"2018-03-01T08:32:44Z","abstract_excerpt":"A graph is called a chain graph if it is bipartite and the neighborhoods of the vertices in each color class form a chain with respect to inclusion. A threshold graph can be obtained from a chain graph by making adjacent all pairs of vertices in one color class. Given a graph $G$, let $\\lambda$ be an eigenvalue (of the adjacency matrix) of $G$ with multiplicity $k \\geq 1$. A vertex $v$ of $G$ is a downer, or neutral, or Parter depending whether the multiplicity of $\\lambda$ in $G-v$ is $k-1$, or $k$, or $k+1$, respectively. We consider vertex types in the above sense in threshold and chain gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00245","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":"1803.00245","created_at":"2026-05-18T00:22:12.865666+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.00245v1","created_at":"2026-05-18T00:22:12.865666+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00245","created_at":"2026-05-18T00:22:12.865666+00:00"},{"alias_kind":"pith_short_12","alias_value":"VYDB34WVGAK4","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VYDB34WVGAK4YCEA","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VYDB34WV","created_at":"2026-05-18T12:32:59.047623+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/VYDB34WVGAK4YCEAQHIRNKE2XB","json":"https://pith.science/pith/VYDB34WVGAK4YCEAQHIRNKE2XB.json","graph_json":"https://pith.science/api/pith-number/VYDB34WVGAK4YCEAQHIRNKE2XB/graph.json","events_json":"https://pith.science/api/pith-number/VYDB34WVGAK4YCEAQHIRNKE2XB/events.json","paper":"https://pith.science/paper/VYDB34WV"},"agent_actions":{"view_html":"https://pith.science/pith/VYDB34WVGAK4YCEAQHIRNKE2XB","download_json":"https://pith.science/pith/VYDB34WVGAK4YCEAQHIRNKE2XB.json","view_paper":"https://pith.science/paper/VYDB34WV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.00245&json=true","fetch_graph":"https://pith.science/api/pith-number/VYDB34WVGAK4YCEAQHIRNKE2XB/graph.json","fetch_events":"https://pith.science/api/pith-number/VYDB34WVGAK4YCEAQHIRNKE2XB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VYDB34WVGAK4YCEAQHIRNKE2XB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VYDB34WVGAK4YCEAQHIRNKE2XB/action/storage_attestation","attest_author":"https://pith.science/pith/VYDB34WVGAK4YCEAQHIRNKE2XB/action/author_attestation","sign_citation":"https://pith.science/pith/VYDB34WVGAK4YCEAQHIRNKE2XB/action/citation_signature","submit_replication":"https://pith.science/pith/VYDB34WVGAK4YCEAQHIRNKE2XB/action/replication_record"}},"created_at":"2026-05-18T00:22:12.865666+00:00","updated_at":"2026-05-18T00:22:12.865666+00:00"}