{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:R7SU3NHE6IH47O6HJHW4JKZBU6","short_pith_number":"pith:R7SU3NHE","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"},"canonical_sha256":"8fe54db4e4f20fcfbbc749edc4ab21a78c7138c17f85edd865dfacf72f42d810","source":{"kind":"arxiv","id":"1406.7490","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7490","created_at":"2026-05-18T02:19:08Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7490v1","created_at":"2026-05-18T02:19:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7490","created_at":"2026-05-18T02:19:08Z"},{"alias_kind":"pith_short_12","alias_value":"R7SU3NHE6IH4","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"R7SU3NHE6IH47O6H","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"R7SU3NHE","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:R7SU3NHE6IH47O6HJHW4JKZBU6","target":"record","payload":{"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"},"canonical_sha256":"8fe54db4e4f20fcfbbc749edc4ab21a78c7138c17f85edd865dfacf72f42d810","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"},"source_kind":"arxiv","source_id":"1406.7490","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-18T02:19:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0fLcD+LpoFnluGAwj1de++N0Hz8peYeG1Y0uQwizDvFICi87h8UL/BbPx6IYLXwjLchRxPb/2XRKoJglS39jDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T15:40:56.669955Z"},"content_sha256":"a527de8b96558e1223fed2f29830afcc764aba7335059d5bb08f03d6c8870aaf","schema_version":"1.0","event_id":"sha256:a527de8b96558e1223fed2f29830afcc764aba7335059d5bb08f03d6c8870aaf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:R7SU3NHE6IH47O6HJHW4JKZBU6","target":"graph","payload":{"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"},"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-18T02:19:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mR3vyG2w6pOxO19FnPwqIvEcuOknBZC3fW3k2lnH3xcJwXKZ6U9fITEiaMha41LKX17y47tz3FIxpbi01YyuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T15:40:56.670353Z"},"content_sha256":"25198126d8be1b7273ec341b4f281296a532ae371ddf2867a5345b594037e450","schema_version":"1.0","event_id":"sha256:25198126d8be1b7273ec341b4f281296a532ae371ddf2867a5345b594037e450"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R7SU3NHE6IH47O6HJHW4JKZBU6/bundle.json","state_url":"https://pith.science/pith/R7SU3NHE6IH47O6HJHW4JKZBU6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R7SU3NHE6IH47O6HJHW4JKZBU6/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-26T15:40:56Z","links":{"resolver":"https://pith.science/pith/R7SU3NHE6IH47O6HJHW4JKZBU6","bundle":"https://pith.science/pith/R7SU3NHE6IH47O6HJHW4JKZBU6/bundle.json","state":"https://pith.science/pith/R7SU3NHE6IH47O6HJHW4JKZBU6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R7SU3NHE6IH47O6HJHW4JKZBU6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:R7SU3NHE6IH47O6HJHW4JKZBU6","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":"eae7ed1d15efba49d3146b35770d87b80b7125188c8d4d9ed1ad61127ae8404c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-29T11:03:40Z","title_canon_sha256":"787f076f6b99dfb20cd519ade5c1aa373a07c6747f5ab4701eafde6906ecddfb"},"schema_version":"1.0","source":{"id":"1406.7490","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.7490","created_at":"2026-05-18T02:19:08Z"},{"alias_kind":"arxiv_version","alias_value":"1406.7490v1","created_at":"2026-05-18T02:19:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.7490","created_at":"2026-05-18T02:19:08Z"},{"alias_kind":"pith_short_12","alias_value":"R7SU3NHE6IH4","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"R7SU3NHE6IH47O6H","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"R7SU3NHE","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:25198126d8be1b7273ec341b4f281296a532ae371ddf2867a5345b594037e450","target":"graph","created_at":"2026-05-18T02:19:08Z","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":"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","authors_text":"Florent Foucaud, Peter J. Slater, Ralf Klasing","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-29T11:03:40Z","title":"Centroidal bases in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.7490","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:a527de8b96558e1223fed2f29830afcc764aba7335059d5bb08f03d6c8870aaf","target":"record","created_at":"2026-05-18T02:19:08Z","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":"eae7ed1d15efba49d3146b35770d87b80b7125188c8d4d9ed1ad61127ae8404c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-29T11:03:40Z","title_canon_sha256":"787f076f6b99dfb20cd519ade5c1aa373a07c6747f5ab4701eafde6906ecddfb"},"schema_version":"1.0","source":{"id":"1406.7490","kind":"arxiv","version":1}},"canonical_sha256":"8fe54db4e4f20fcfbbc749edc4ab21a78c7138c17f85edd865dfacf72f42d810","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fe54db4e4f20fcfbbc749edc4ab21a78c7138c17f85edd865dfacf72f42d810","first_computed_at":"2026-05-18T02:19:08.422453Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:08.422453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QlXIsvnTp0C8YOfGnsgXhkPAx7wovmAbnhcbivbcHFLlEx2q4l7EE9evcUFH3SEs7cn3XSjCzweyTNMTdoZQAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:08.422972Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.7490","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a527de8b96558e1223fed2f29830afcc764aba7335059d5bb08f03d6c8870aaf","sha256:25198126d8be1b7273ec341b4f281296a532ae371ddf2867a5345b594037e450"],"state_sha256":"f3be85e2069f83906f02e0020fe3d4878b157adf3d2ebcaec4060a62234b66a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/uPgyaICMCo1ee7FzMPMTH8HhoWlztTcAdas9nCI4XeqKLubHduFlve7DKZb8y3FF/4uuaBXHr5OV2sUV/GCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T15:40:56.672485Z","bundle_sha256":"f0482aa59011b7e9ab15d8d1d45326fc108d43a17915bf578321279723d94a83"}}