{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VYDB34WVGAK4YCEAQHIRNKE2XB","short_pith_number":"pith:VYDB34WV","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"},"canonical_sha256":"ae061df2d53015cc088081d116a89ab84645336105575b1d9c229151127ebb22","source":{"kind":"arxiv","id":"1803.00245","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00245","created_at":"2026-05-18T00:22:12Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00245v1","created_at":"2026-05-18T00:22:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00245","created_at":"2026-05-18T00:22:12Z"},{"alias_kind":"pith_short_12","alias_value":"VYDB34WVGAK4","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VYDB34WVGAK4YCEA","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VYDB34WV","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VYDB34WVGAK4YCEAQHIRNKE2XB","target":"record","payload":{"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"},"canonical_sha256":"ae061df2d53015cc088081d116a89ab84645336105575b1d9c229151127ebb22","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"},"source_kind":"arxiv","source_id":"1803.00245","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:22:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GRm5MAqEKgNJZxqWO5Qb9YGdfjA+p0RtAYsiAI6MjvnF4NKnLxYjTG5KVw4XXV1RMDThv4PHMKnfABZNRiYtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T18:32:38.320999Z"},"content_sha256":"35716c9d32212924f19c47040e8f30ff4105ee9c90330dda23f0e3dda9f35031","schema_version":"1.0","event_id":"sha256:35716c9d32212924f19c47040e8f30ff4105ee9c90330dda23f0e3dda9f35031"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VYDB34WVGAK4YCEAQHIRNKE2XB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:22:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AzbIb2lXGYxkGpiXX4pvvX0qUmFvZtE4zdSvhz8D+/gqJ2CPv0L8D7MLJ3om2XSNuR5HpFQIlhshZ2xRS132DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T18:32:38.321363Z"},"content_sha256":"525568dbd072f7bab9b2ac5a2071add5598c8ed614a3dab13dd6ca50b111e778","schema_version":"1.0","event_id":"sha256:525568dbd072f7bab9b2ac5a2071add5598c8ed614a3dab13dd6ca50b111e778"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VYDB34WVGAK4YCEAQHIRNKE2XB/bundle.json","state_url":"https://pith.science/pith/VYDB34WVGAK4YCEAQHIRNKE2XB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VYDB34WVGAK4YCEAQHIRNKE2XB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T18:32:38Z","links":{"resolver":"https://pith.science/pith/VYDB34WVGAK4YCEAQHIRNKE2XB","bundle":"https://pith.science/pith/VYDB34WVGAK4YCEAQHIRNKE2XB/bundle.json","state":"https://pith.science/pith/VYDB34WVGAK4YCEAQHIRNKE2XB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VYDB34WVGAK4YCEAQHIRNKE2XB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VYDB34WVGAK4YCEAQHIRNKE2XB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"739a36012da9a6404c6b0619c91d1f1a4ad056774b666576dd9235d9734e8143","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-01T08:32:44Z","title_canon_sha256":"6260f289811aaa65dd0f1268d20d35efc504b9926504a93c2e7944f8626907af"},"schema_version":"1.0","source":{"id":"1803.00245","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00245","created_at":"2026-05-18T00:22:12Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00245v1","created_at":"2026-05-18T00:22:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00245","created_at":"2026-05-18T00:22:12Z"},{"alias_kind":"pith_short_12","alias_value":"VYDB34WVGAK4","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VYDB34WVGAK4YCEA","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VYDB34WV","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:525568dbd072f7bab9b2ac5a2071add5598c8ed614a3dab13dd6ca50b111e778","target":"graph","created_at":"2026-05-18T00:22:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"E. Ghorbani, M. An{\\dj}eli\\'c, S.K. Simi\\'c","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-01T08:32:44Z","title":"Vertex types in threshold and chain graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00245","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:35716c9d32212924f19c47040e8f30ff4105ee9c90330dda23f0e3dda9f35031","target":"record","created_at":"2026-05-18T00:22:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"739a36012da9a6404c6b0619c91d1f1a4ad056774b666576dd9235d9734e8143","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-01T08:32:44Z","title_canon_sha256":"6260f289811aaa65dd0f1268d20d35efc504b9926504a93c2e7944f8626907af"},"schema_version":"1.0","source":{"id":"1803.00245","kind":"arxiv","version":1}},"canonical_sha256":"ae061df2d53015cc088081d116a89ab84645336105575b1d9c229151127ebb22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae061df2d53015cc088081d116a89ab84645336105575b1d9c229151127ebb22","first_computed_at":"2026-05-18T00:22:12.865557Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:12.865557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n7i3uu9lHn1kxh7Wyy/XUqnViGUz3m5410M+sNjZIxx+Wz4jmnxLUxiUtDqvAhxA/tnUOBlDSydi/S9HXeoSDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:12.866304Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.00245","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35716c9d32212924f19c47040e8f30ff4105ee9c90330dda23f0e3dda9f35031","sha256:525568dbd072f7bab9b2ac5a2071add5598c8ed614a3dab13dd6ca50b111e778"],"state_sha256":"dfce2fb248efc5f8a242e4fc18d9e342afaf20c07f28adc6b3cecf04327c5512"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y1PYAmziwUXWj0ZSBBay5KFdkkeQUbZZm7LM2rDXdcjNywiTCNqtO19xEucOQzd2U6MbPWPOUadqQC3OlTVrCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T18:32:38.323214Z","bundle_sha256":"441f1d7aff49e7395162d1c86bc53593121a04c014e3b1c2d2cff8ff355838fb"}}