{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:R7SU3NHE6IH47O6HJHW4JKZBU6","short_pith_number":"pith:R7SU3NHE","schema_version":"1.0","canonical_sha256":"8fe54db4e4f20fcfbbc749edc4ab21a78c7138c17f85edd865dfacf72f42d810","source":{"kind":"arxiv","id":"1406.7490","version":1},"attestation_state":"computed","paper":{"title":"Centroidal bases in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Florent Foucaud, Peter J. Slater, Ralf Klasing","submitted_at":"2014-06-29T11:03:40Z","abstract_excerpt":"We introduce the notion of a centroidal locating set of a graph $G$, that is, a set $L$ of vertices such that all vertices in $G$ are uniquely determined by their relative distances to the vertices of $L$. A centroidal locating set of $G$ of minimum size is called a centroidal basis, and its size is the centroidal dimension $CD(G)$. This notion, which is related to previous concepts, gives a new way of identifying the vertices of a graph. The centroidal dimension of a graph $G$ is lower- and upper-bounded by the metric dimension and twice the location-domination number of $G$, respectively. Th"},"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":"1406.7490","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-29T11:03:40Z","cross_cats_sorted":[],"title_canon_sha256":"787f076f6b99dfb20cd519ade5c1aa373a07c6747f5ab4701eafde6906ecddfb","abstract_canon_sha256":"eae7ed1d15efba49d3146b35770d87b80b7125188c8d4d9ed1ad61127ae8404c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:08.422972Z","signature_b64":"QlXIsvnTp0C8YOfGnsgXhkPAx7wovmAbnhcbivbcHFLlEx2q4l7EE9evcUFH3SEs7cn3XSjCzweyTNMTdoZQAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fe54db4e4f20fcfbbc749edc4ab21a78c7138c17f85edd865dfacf72f42d810","last_reissued_at":"2026-05-18T02:19:08.422453Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:08.422453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Centroidal bases in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Florent Foucaud, Peter J. Slater, Ralf Klasing","submitted_at":"2014-06-29T11:03:40Z","abstract_excerpt":"We introduce the notion of a centroidal locating set of a graph $G$, that is, a set $L$ of vertices such that all vertices in $G$ are uniquely determined by their relative distances to the vertices of $L$. A centroidal locating set of $G$ of minimum size is called a centroidal basis, and its size is the centroidal dimension $CD(G)$. This notion, which is related to previous concepts, gives a new way of identifying the vertices of a graph. The centroidal dimension of a graph $G$ is lower- and upper-bounded by the metric dimension and twice the location-domination number of $G$, respectively. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7490","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":"1406.7490","created_at":"2026-05-18T02:19:08.422530+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.7490v1","created_at":"2026-05-18T02:19:08.422530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7490","created_at":"2026-05-18T02:19:08.422530+00:00"},{"alias_kind":"pith_short_12","alias_value":"R7SU3NHE6IH4","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"R7SU3NHE6IH47O6H","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"R7SU3NHE","created_at":"2026-05-18T12:28:46.137349+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/R7SU3NHE6IH47O6HJHW4JKZBU6","json":"https://pith.science/pith/R7SU3NHE6IH47O6HJHW4JKZBU6.json","graph_json":"https://pith.science/api/pith-number/R7SU3NHE6IH47O6HJHW4JKZBU6/graph.json","events_json":"https://pith.science/api/pith-number/R7SU3NHE6IH47O6HJHW4JKZBU6/events.json","paper":"https://pith.science/paper/R7SU3NHE"},"agent_actions":{"view_html":"https://pith.science/pith/R7SU3NHE6IH47O6HJHW4JKZBU6","download_json":"https://pith.science/pith/R7SU3NHE6IH47O6HJHW4JKZBU6.json","view_paper":"https://pith.science/paper/R7SU3NHE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.7490&json=true","fetch_graph":"https://pith.science/api/pith-number/R7SU3NHE6IH47O6HJHW4JKZBU6/graph.json","fetch_events":"https://pith.science/api/pith-number/R7SU3NHE6IH47O6HJHW4JKZBU6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R7SU3NHE6IH47O6HJHW4JKZBU6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R7SU3NHE6IH47O6HJHW4JKZBU6/action/storage_attestation","attest_author":"https://pith.science/pith/R7SU3NHE6IH47O6HJHW4JKZBU6/action/author_attestation","sign_citation":"https://pith.science/pith/R7SU3NHE6IH47O6HJHW4JKZBU6/action/citation_signature","submit_replication":"https://pith.science/pith/R7SU3NHE6IH47O6HJHW4JKZBU6/action/replication_record"}},"created_at":"2026-05-18T02:19:08.422530+00:00","updated_at":"2026-05-18T02:19:08.422530+00:00"}