{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DIKUUXX7HINFBFM3B4SWQMII73","short_pith_number":"pith:DIKUUXX7","schema_version":"1.0","canonical_sha256":"1a154a5eff3a1a50959b0f25683108fee9e2246d69f72cc2866892a13fac0520","source":{"kind":"arxiv","id":"1512.07420","version":1},"attestation_state":"computed","paper":{"title":"The local metric dimension of subgraph-amalgamation of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gabriel A. Barragan-Ramirez, Rinovia Simanjuntak, Saladin Uttunggadewa, Suhadi W. Saputro","submitted_at":"2015-12-23T10:26:42Z","abstract_excerpt":"A vertex $v$ is said to distinguish two other vertices $x$ and $y$ of a nontrivial connected graph G if the distance from $v$ to $x$ is different from the distance from $v$ to $y$. A set $S\\subseteq V(G)$ is a local metric set for $G$ if every two adjacent vertices of $G$ are distinguished by some vertex of $S$. A local metric set with minimum cardinality is called a local metric basis for $G$ and its cardinality, the local metric dimension of $G$, denoted by $\\dim_l(G)$. In this paper we present tight bounds for the local metric dimension of subgraph-amalgamation of graphs with special emphas"},"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":"1512.07420","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-23T10:26:42Z","cross_cats_sorted":[],"title_canon_sha256":"10f61c481b1a7fd4d895860dc5ccd063e4af737d333ac728269ee76a478bfa3c","abstract_canon_sha256":"5d9dfeb81428234a204efce0af49b596687fcfefd100dcd13622ea6a32e89338"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:49.727699Z","signature_b64":"82X6PwltoAl7bjGJ/76keXetlr4UdJxJrDmgtTgDZEr5pfC+R5SyXArzKn3X/0gv7MEbqduiAwNP1ORXNk6KCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a154a5eff3a1a50959b0f25683108fee9e2246d69f72cc2866892a13fac0520","last_reissued_at":"2026-05-18T01:23:49.727126Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:49.727126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The local metric dimension of subgraph-amalgamation of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gabriel A. Barragan-Ramirez, Rinovia Simanjuntak, Saladin Uttunggadewa, Suhadi W. Saputro","submitted_at":"2015-12-23T10:26:42Z","abstract_excerpt":"A vertex $v$ is said to distinguish two other vertices $x$ and $y$ of a nontrivial connected graph G if the distance from $v$ to $x$ is different from the distance from $v$ to $y$. A set $S\\subseteq V(G)$ is a local metric set for $G$ if every two adjacent vertices of $G$ are distinguished by some vertex of $S$. A local metric set with minimum cardinality is called a local metric basis for $G$ and its cardinality, the local metric dimension of $G$, denoted by $\\dim_l(G)$. In this paper we present tight bounds for the local metric dimension of subgraph-amalgamation of graphs with special emphas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.07420","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":"1512.07420","created_at":"2026-05-18T01:23:49.727236+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.07420v1","created_at":"2026-05-18T01:23:49.727236+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.07420","created_at":"2026-05-18T01:23:49.727236+00:00"},{"alias_kind":"pith_short_12","alias_value":"DIKUUXX7HINF","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DIKUUXX7HINFBFM3","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DIKUUXX7","created_at":"2026-05-18T12:29:17.054201+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/DIKUUXX7HINFBFM3B4SWQMII73","json":"https://pith.science/pith/DIKUUXX7HINFBFM3B4SWQMII73.json","graph_json":"https://pith.science/api/pith-number/DIKUUXX7HINFBFM3B4SWQMII73/graph.json","events_json":"https://pith.science/api/pith-number/DIKUUXX7HINFBFM3B4SWQMII73/events.json","paper":"https://pith.science/paper/DIKUUXX7"},"agent_actions":{"view_html":"https://pith.science/pith/DIKUUXX7HINFBFM3B4SWQMII73","download_json":"https://pith.science/pith/DIKUUXX7HINFBFM3B4SWQMII73.json","view_paper":"https://pith.science/paper/DIKUUXX7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.07420&json=true","fetch_graph":"https://pith.science/api/pith-number/DIKUUXX7HINFBFM3B4SWQMII73/graph.json","fetch_events":"https://pith.science/api/pith-number/DIKUUXX7HINFBFM3B4SWQMII73/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DIKUUXX7HINFBFM3B4SWQMII73/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DIKUUXX7HINFBFM3B4SWQMII73/action/storage_attestation","attest_author":"https://pith.science/pith/DIKUUXX7HINFBFM3B4SWQMII73/action/author_attestation","sign_citation":"https://pith.science/pith/DIKUUXX7HINFBFM3B4SWQMII73/action/citation_signature","submit_replication":"https://pith.science/pith/DIKUUXX7HINFBFM3B4SWQMII73/action/replication_record"}},"created_at":"2026-05-18T01:23:49.727236+00:00","updated_at":"2026-05-18T01:23:49.727236+00:00"}