{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4ZOGPHSSV6HSJZJDBBFRORGCBR","short_pith_number":"pith:4ZOGPHSS","schema_version":"1.0","canonical_sha256":"e65c679e52af8f24e523084b1744c20c5ba6183e5c3a3e2e3aba951252ccbb1c","source":{"kind":"arxiv","id":"1610.06425","version":2},"attestation_state":"computed","paper":{"title":"A classification of polyhedral graph by combinatorially rigid vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"Seonhwa Kim, Yunhi Cho","submitted_at":"2016-10-18T19:18:12Z","abstract_excerpt":"When the number of non-triangular faces adjacent to a vertex $v$ is less than or equal to three, the vertex $v$ will be called (\\emph{combinatorially}) \\emph{rigid}.\n  We study the number of rigid vertices and suggest a conjecture on a classification of polyhedra."},"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":"1610.06425","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2016-10-18T19:18:12Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"fd326daea3859fa0dc33bd14eff64e61044ba7f09db349c95cb1ec7463b2784f","abstract_canon_sha256":"7d659e2eef32a59f61c18e6ba610e30642d37e6613c40d89fbbe804f5d00a5ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:42.243523Z","signature_b64":"E76uf2SWhnbug2pgWSfQvedH8ztgmehpXnTCX/ntM+d/K2RMN9Jub9Abto4r2fRZAuJ3k7A/tOjzRSSa4R2TCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e65c679e52af8f24e523084b1744c20c5ba6183e5c3a3e2e3aba951252ccbb1c","last_reissued_at":"2026-05-18T00:48:42.242857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:42.242857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A classification of polyhedral graph by combinatorially rigid vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"Seonhwa Kim, Yunhi Cho","submitted_at":"2016-10-18T19:18:12Z","abstract_excerpt":"When the number of non-triangular faces adjacent to a vertex $v$ is less than or equal to three, the vertex $v$ will be called (\\emph{combinatorially}) \\emph{rigid}.\n  We study the number of rigid vertices and suggest a conjecture on a classification of polyhedra."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06425","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":"1610.06425","created_at":"2026-05-18T00:48:42.242949+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.06425v2","created_at":"2026-05-18T00:48:42.242949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06425","created_at":"2026-05-18T00:48:42.242949+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ZOGPHSSV6HS","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ZOGPHSSV6HSJZJD","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ZOGPHSS","created_at":"2026-05-18T12:29:58.707656+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/4ZOGPHSSV6HSJZJDBBFRORGCBR","json":"https://pith.science/pith/4ZOGPHSSV6HSJZJDBBFRORGCBR.json","graph_json":"https://pith.science/api/pith-number/4ZOGPHSSV6HSJZJDBBFRORGCBR/graph.json","events_json":"https://pith.science/api/pith-number/4ZOGPHSSV6HSJZJDBBFRORGCBR/events.json","paper":"https://pith.science/paper/4ZOGPHSS"},"agent_actions":{"view_html":"https://pith.science/pith/4ZOGPHSSV6HSJZJDBBFRORGCBR","download_json":"https://pith.science/pith/4ZOGPHSSV6HSJZJDBBFRORGCBR.json","view_paper":"https://pith.science/paper/4ZOGPHSS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.06425&json=true","fetch_graph":"https://pith.science/api/pith-number/4ZOGPHSSV6HSJZJDBBFRORGCBR/graph.json","fetch_events":"https://pith.science/api/pith-number/4ZOGPHSSV6HSJZJDBBFRORGCBR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ZOGPHSSV6HSJZJDBBFRORGCBR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ZOGPHSSV6HSJZJDBBFRORGCBR/action/storage_attestation","attest_author":"https://pith.science/pith/4ZOGPHSSV6HSJZJDBBFRORGCBR/action/author_attestation","sign_citation":"https://pith.science/pith/4ZOGPHSSV6HSJZJDBBFRORGCBR/action/citation_signature","submit_replication":"https://pith.science/pith/4ZOGPHSSV6HSJZJDBBFRORGCBR/action/replication_record"}},"created_at":"2026-05-18T00:48:42.242949+00:00","updated_at":"2026-05-18T00:48:42.242949+00:00"}