{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:W4CP5IDXLC33GLS5Q4HLGRSOY4","short_pith_number":"pith:W4CP5IDX","schema_version":"1.0","canonical_sha256":"b704fea07758b7b32e5d870eb3464ec70c937cff89832c96ae7ace5336ca4a1b","source":{"kind":"arxiv","id":"1312.0191","version":2},"attestation_state":"computed","paper":{"title":"Metric Dimension of Amalgamation of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Rinovia Simanjuntak, Saladin Uttunggadewa, Suhadi Wido Saputro","submitted_at":"2013-12-01T08:44:15Z","abstract_excerpt":"A set of vertices $S$ resolves a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of $G$ is the minimum cardinality of a resolving set of $G$.\n  Let $\\{G_1, G_2, \\ldots, G_n\\}$ be a finite collection of graphs and each $G_i$ has a fixed vertex $v_{0_i}$ or a fixed edge $e_{0_i}$ called a terminal vertex or edge, respectively. The \\emph{vertex-amalgamation} of $G_1, G_2, \\ldots, G_n$, denoted by $Vertex-Amal\\{G_i;v_{0_i}\\}$, is formed by taking all the $G_i$'s and identifying their terminal vertices. Similarly, the \\emph{ed"},"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":"1312.0191","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-01T08:44:15Z","cross_cats_sorted":[],"title_canon_sha256":"29e2cd46bad975d91cb41b577822461cbb9035847b074daa1e1e72fec6ac1ea1","abstract_canon_sha256":"848976aab83a0e68ba4e91b38ee37c64a221d367c2d904245e760345326a02df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:50.990784Z","signature_b64":"VdS2jPh6XsVHXr9g8+kI/u9On6t5zsCI1TX/EBeE+tvL4DUMoIDdpPf2ybC5HDzFW0CYI52O9pVUnn589a6sBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b704fea07758b7b32e5d870eb3464ec70c937cff89832c96ae7ace5336ca4a1b","last_reissued_at":"2026-05-18T01:23:50.990204Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:50.990204Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Metric Dimension of Amalgamation of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Rinovia Simanjuntak, Saladin Uttunggadewa, Suhadi Wido Saputro","submitted_at":"2013-12-01T08:44:15Z","abstract_excerpt":"A set of vertices $S$ resolves a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of $G$ is the minimum cardinality of a resolving set of $G$.\n  Let $\\{G_1, G_2, \\ldots, G_n\\}$ be a finite collection of graphs and each $G_i$ has a fixed vertex $v_{0_i}$ or a fixed edge $e_{0_i}$ called a terminal vertex or edge, respectively. The \\emph{vertex-amalgamation} of $G_1, G_2, \\ldots, G_n$, denoted by $Vertex-Amal\\{G_i;v_{0_i}\\}$, is formed by taking all the $G_i$'s and identifying their terminal vertices. Similarly, the \\emph{ed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0191","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":"1312.0191","created_at":"2026-05-18T01:23:50.990304+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.0191v2","created_at":"2026-05-18T01:23:50.990304+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0191","created_at":"2026-05-18T01:23:50.990304+00:00"},{"alias_kind":"pith_short_12","alias_value":"W4CP5IDXLC33","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"W4CP5IDXLC33GLS5","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"W4CP5IDX","created_at":"2026-05-18T12:28:04.890932+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/W4CP5IDXLC33GLS5Q4HLGRSOY4","json":"https://pith.science/pith/W4CP5IDXLC33GLS5Q4HLGRSOY4.json","graph_json":"https://pith.science/api/pith-number/W4CP5IDXLC33GLS5Q4HLGRSOY4/graph.json","events_json":"https://pith.science/api/pith-number/W4CP5IDXLC33GLS5Q4HLGRSOY4/events.json","paper":"https://pith.science/paper/W4CP5IDX"},"agent_actions":{"view_html":"https://pith.science/pith/W4CP5IDXLC33GLS5Q4HLGRSOY4","download_json":"https://pith.science/pith/W4CP5IDXLC33GLS5Q4HLGRSOY4.json","view_paper":"https://pith.science/paper/W4CP5IDX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.0191&json=true","fetch_graph":"https://pith.science/api/pith-number/W4CP5IDXLC33GLS5Q4HLGRSOY4/graph.json","fetch_events":"https://pith.science/api/pith-number/W4CP5IDXLC33GLS5Q4HLGRSOY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W4CP5IDXLC33GLS5Q4HLGRSOY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W4CP5IDXLC33GLS5Q4HLGRSOY4/action/storage_attestation","attest_author":"https://pith.science/pith/W4CP5IDXLC33GLS5Q4HLGRSOY4/action/author_attestation","sign_citation":"https://pith.science/pith/W4CP5IDXLC33GLS5Q4HLGRSOY4/action/citation_signature","submit_replication":"https://pith.science/pith/W4CP5IDXLC33GLS5Q4HLGRSOY4/action/replication_record"}},"created_at":"2026-05-18T01:23:50.990304+00:00","updated_at":"2026-05-18T01:23:50.990304+00:00"}