{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SQ64K77NR7VT7KW7M7FJHUAC7W","short_pith_number":"pith:SQ64K77N","schema_version":"1.0","canonical_sha256":"943dc57fed8feb3faadf67ca93d002fdb39f195636a294b43600e52afe8e35d8","source":{"kind":"arxiv","id":"1602.08907","version":3},"attestation_state":"computed","paper":{"title":"On the Partition Dimension and the Twin Number of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carmen Hernando, Ignacio M Pelayo, Merce Mora","submitted_at":"2016-02-29T11:16:38Z","abstract_excerpt":"A partition P of the vertex set of a connected graph G is a locating partition of G if every vertex is uniquely determined by its vector of distances to the elements of P. The partition dimension of G is the minimum cardinality of a locating partition of G. A pair of vertices u,v of a graph G are called twins if they have exactly the same set of neighbors other than u and v. A twin class is a maximal set of pairwise twin vertices. The twin number of a graph G is the maximum cardinality of a twin class of G.\n  In this paper we undertake the study of the partition dimension of a graph by also co"},"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":"1602.08907","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-29T11:16:38Z","cross_cats_sorted":[],"title_canon_sha256":"9c32f3702db0e33f4dbefa4ba9c36a5fcd686cb317efaf6b81eecb2aa89f3174","abstract_canon_sha256":"171e58d1b8ebaac698234eb56e62916056bf410fd7bbe92a473823d3114d450c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:35.137096Z","signature_b64":"LUUxTZGTdfxcjg4vQNKXqiHvpOI2pJHF09pN6tOA83ZWIA3Dce06EXJJXo8ES3qZBwFx7CY6IBQ0GIjHVoowDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"943dc57fed8feb3faadf67ca93d002fdb39f195636a294b43600e52afe8e35d8","last_reissued_at":"2026-05-18T01:19:35.136670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:35.136670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Partition Dimension and the Twin Number of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carmen Hernando, Ignacio M Pelayo, Merce Mora","submitted_at":"2016-02-29T11:16:38Z","abstract_excerpt":"A partition P of the vertex set of a connected graph G is a locating partition of G if every vertex is uniquely determined by its vector of distances to the elements of P. The partition dimension of G is the minimum cardinality of a locating partition of G. A pair of vertices u,v of a graph G are called twins if they have exactly the same set of neighbors other than u and v. A twin class is a maximal set of pairwise twin vertices. The twin number of a graph G is the maximum cardinality of a twin class of G.\n  In this paper we undertake the study of the partition dimension of a graph by also co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08907","kind":"arxiv","version":3},"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":"1602.08907","created_at":"2026-05-18T01:19:35.136748+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.08907v3","created_at":"2026-05-18T01:19:35.136748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08907","created_at":"2026-05-18T01:19:35.136748+00:00"},{"alias_kind":"pith_short_12","alias_value":"SQ64K77NR7VT","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SQ64K77NR7VT7KW7","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SQ64K77N","created_at":"2026-05-18T12:30:44.179134+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/SQ64K77NR7VT7KW7M7FJHUAC7W","json":"https://pith.science/pith/SQ64K77NR7VT7KW7M7FJHUAC7W.json","graph_json":"https://pith.science/api/pith-number/SQ64K77NR7VT7KW7M7FJHUAC7W/graph.json","events_json":"https://pith.science/api/pith-number/SQ64K77NR7VT7KW7M7FJHUAC7W/events.json","paper":"https://pith.science/paper/SQ64K77N"},"agent_actions":{"view_html":"https://pith.science/pith/SQ64K77NR7VT7KW7M7FJHUAC7W","download_json":"https://pith.science/pith/SQ64K77NR7VT7KW7M7FJHUAC7W.json","view_paper":"https://pith.science/paper/SQ64K77N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.08907&json=true","fetch_graph":"https://pith.science/api/pith-number/SQ64K77NR7VT7KW7M7FJHUAC7W/graph.json","fetch_events":"https://pith.science/api/pith-number/SQ64K77NR7VT7KW7M7FJHUAC7W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SQ64K77NR7VT7KW7M7FJHUAC7W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SQ64K77NR7VT7KW7M7FJHUAC7W/action/storage_attestation","attest_author":"https://pith.science/pith/SQ64K77NR7VT7KW7M7FJHUAC7W/action/author_attestation","sign_citation":"https://pith.science/pith/SQ64K77NR7VT7KW7M7FJHUAC7W/action/citation_signature","submit_replication":"https://pith.science/pith/SQ64K77NR7VT7KW7M7FJHUAC7W/action/replication_record"}},"created_at":"2026-05-18T01:19:35.136748+00:00","updated_at":"2026-05-18T01:19:35.136748+00:00"}