{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:E6N4HZZFLA54K5GDXR7U4S4KH5","short_pith_number":"pith:E6N4HZZF","schema_version":"1.0","canonical_sha256":"279bc3e725583bc574c3bc7f4e4b8a3f6549a9dea1b508d335651606078b8c12","source":{"kind":"arxiv","id":"1705.09540","version":1},"attestation_state":"computed","paper":{"title":"On vertex types of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pu Qiao, Xingzhi Zhan","submitted_at":"2017-05-26T11:43:21Z","abstract_excerpt":"The vertices of a graph are classified into seven types by J.T. Hedetniemi, S.M. Hedetniemi, S.T. Hedetniemi and T.M. Lewis and they ask the following questions: 1) What is the smallest order $n$ of a graph having $n-2$ very typical vertices or $n-2$ typical vertices? 2) What is the smallest order of a pantypical graph? We answer these two questions in this paper."},"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":"1705.09540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-26T11:43:21Z","cross_cats_sorted":[],"title_canon_sha256":"b1b19c9ab7c8ab8d85c816035a9a12549ef51616516b71ccf3685f65472aef5c","abstract_canon_sha256":"f7582d6d30d481a2c6c9c36d13bd77491a16baa861b8ffc92095bf46476b7521"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:38.419698Z","signature_b64":"o/Mktxx94p0YeJheOAR0NPEDymVUKuVVBleGH1Ci/bJRatZ5Hi7KhPpsbwGvGpPCbngL8Q62neYqIpxVVaweCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"279bc3e725583bc574c3bc7f4e4b8a3f6549a9dea1b508d335651606078b8c12","last_reissued_at":"2026-05-18T00:43:38.419259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:38.419259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On vertex types of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pu Qiao, Xingzhi Zhan","submitted_at":"2017-05-26T11:43:21Z","abstract_excerpt":"The vertices of a graph are classified into seven types by J.T. Hedetniemi, S.M. Hedetniemi, S.T. Hedetniemi and T.M. Lewis and they ask the following questions: 1) What is the smallest order $n$ of a graph having $n-2$ very typical vertices or $n-2$ typical vertices? 2) What is the smallest order of a pantypical graph? We answer these two questions in this paper."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09540","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":"1705.09540","created_at":"2026-05-18T00:43:38.419328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.09540v1","created_at":"2026-05-18T00:43:38.419328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09540","created_at":"2026-05-18T00:43:38.419328+00:00"},{"alias_kind":"pith_short_12","alias_value":"E6N4HZZFLA54","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"E6N4HZZFLA54K5GD","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"E6N4HZZF","created_at":"2026-05-18T12:31:12.930513+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/E6N4HZZFLA54K5GDXR7U4S4KH5","json":"https://pith.science/pith/E6N4HZZFLA54K5GDXR7U4S4KH5.json","graph_json":"https://pith.science/api/pith-number/E6N4HZZFLA54K5GDXR7U4S4KH5/graph.json","events_json":"https://pith.science/api/pith-number/E6N4HZZFLA54K5GDXR7U4S4KH5/events.json","paper":"https://pith.science/paper/E6N4HZZF"},"agent_actions":{"view_html":"https://pith.science/pith/E6N4HZZFLA54K5GDXR7U4S4KH5","download_json":"https://pith.science/pith/E6N4HZZFLA54K5GDXR7U4S4KH5.json","view_paper":"https://pith.science/paper/E6N4HZZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.09540&json=true","fetch_graph":"https://pith.science/api/pith-number/E6N4HZZFLA54K5GDXR7U4S4KH5/graph.json","fetch_events":"https://pith.science/api/pith-number/E6N4HZZFLA54K5GDXR7U4S4KH5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E6N4HZZFLA54K5GDXR7U4S4KH5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E6N4HZZFLA54K5GDXR7U4S4KH5/action/storage_attestation","attest_author":"https://pith.science/pith/E6N4HZZFLA54K5GDXR7U4S4KH5/action/author_attestation","sign_citation":"https://pith.science/pith/E6N4HZZFLA54K5GDXR7U4S4KH5/action/citation_signature","submit_replication":"https://pith.science/pith/E6N4HZZFLA54K5GDXR7U4S4KH5/action/replication_record"}},"created_at":"2026-05-18T00:43:38.419328+00:00","updated_at":"2026-05-18T00:43:38.419328+00:00"}