{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BIXMD2W32TWPMT6XO6Z6VXQS2K","short_pith_number":"pith:BIXMD2W3","schema_version":"1.0","canonical_sha256":"0a2ec1eadbd4ecf64fd777b3eade12d286a2f29027b689a0bc1394323f99ccba","source":{"kind":"arxiv","id":"1711.00225","version":2},"attestation_state":"computed","paper":{"title":"The multiset dimension of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Presli Siagian, Rinovia Simanjuntak, Tomas Vetrik","submitted_at":"2017-11-01T07:01:49Z","abstract_excerpt":"We introduce a variation of metric dimension, called the multiset dimension. The representation multiset of a vertex $v$ with respect to $W$ (which is a subset of the vertex set of a graph $G$), $r_m (v|W)$, is defined as a multiset of distances between $v$ and the vertices in $W$. If $r_m (u |W) \\neq r_m(v|W)$ for every pair of distinct vertices $u$ and $v$, then $W$ is called an m-resolving set of $G$. If $G$ has an m-resolving set, then the cardinality of a smallest m-resolving set is called the multiset dimension of $G$, denoted by $md(G)$. If $G$ does not contain an m-resolving set, we wr"},"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":"1711.00225","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-01T07:01:49Z","cross_cats_sorted":[],"title_canon_sha256":"f26c353763fab802a4767ba9f6914b1cdc1451bf8af4499dda00762396504a86","abstract_canon_sha256":"5fdb9b64a53e774983e65ab16bb4b061a4826ed2d706f6c3ec08c111ea70d49d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:03:53.267094Z","signature_b64":"S7lVeoC9hdNqd/8UJi+5N0qZbQJWs+0y8c52FpW8/GTO7IoXTsHYSTkQW0LANtU1OKC8gGf1fwyf/sAUV4wDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a2ec1eadbd4ecf64fd777b3eade12d286a2f29027b689a0bc1394323f99ccba","last_reissued_at":"2026-07-05T00:03:53.266689Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:03:53.266689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The multiset dimension of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Presli Siagian, Rinovia Simanjuntak, Tomas Vetrik","submitted_at":"2017-11-01T07:01:49Z","abstract_excerpt":"We introduce a variation of metric dimension, called the multiset dimension. The representation multiset of a vertex $v$ with respect to $W$ (which is a subset of the vertex set of a graph $G$), $r_m (v|W)$, is defined as a multiset of distances between $v$ and the vertices in $W$. If $r_m (u |W) \\neq r_m(v|W)$ for every pair of distinct vertices $u$ and $v$, then $W$ is called an m-resolving set of $G$. If $G$ has an m-resolving set, then the cardinality of a smallest m-resolving set is called the multiset dimension of $G$, denoted by $md(G)$. If $G$ does not contain an m-resolving set, we wr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00225","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1711.00225/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1711.00225","created_at":"2026-07-05T00:03:53.266746+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.00225v2","created_at":"2026-07-05T00:03:53.266746+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00225","created_at":"2026-07-05T00:03:53.266746+00:00"},{"alias_kind":"pith_short_12","alias_value":"BIXMD2W32TWP","created_at":"2026-07-05T00:03:53.266746+00:00"},{"alias_kind":"pith_short_16","alias_value":"BIXMD2W32TWPMT6X","created_at":"2026-07-05T00:03:53.266746+00:00"},{"alias_kind":"pith_short_8","alias_value":"BIXMD2W3","created_at":"2026-07-05T00:03:53.266746+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2607.08128","citing_title":"A Survey on Multiset Dimension and Its Variations","ref_index":30,"is_internal_anchor":true},{"citing_arxiv_id":"2607.07407","citing_title":"Multiset Partition Dimension of Graphs","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2303.06986","citing_title":"Complexity and equivalency of multiset dimension and ID-colorings","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BIXMD2W32TWPMT6XO6Z6VXQS2K","json":"https://pith.science/pith/BIXMD2W32TWPMT6XO6Z6VXQS2K.json","graph_json":"https://pith.science/api/pith-number/BIXMD2W32TWPMT6XO6Z6VXQS2K/graph.json","events_json":"https://pith.science/api/pith-number/BIXMD2W32TWPMT6XO6Z6VXQS2K/events.json","paper":"https://pith.science/paper/BIXMD2W3"},"agent_actions":{"view_html":"https://pith.science/pith/BIXMD2W32TWPMT6XO6Z6VXQS2K","download_json":"https://pith.science/pith/BIXMD2W32TWPMT6XO6Z6VXQS2K.json","view_paper":"https://pith.science/paper/BIXMD2W3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.00225&json=true","fetch_graph":"https://pith.science/api/pith-number/BIXMD2W32TWPMT6XO6Z6VXQS2K/graph.json","fetch_events":"https://pith.science/api/pith-number/BIXMD2W32TWPMT6XO6Z6VXQS2K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BIXMD2W32TWPMT6XO6Z6VXQS2K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BIXMD2W32TWPMT6XO6Z6VXQS2K/action/storage_attestation","attest_author":"https://pith.science/pith/BIXMD2W32TWPMT6XO6Z6VXQS2K/action/author_attestation","sign_citation":"https://pith.science/pith/BIXMD2W32TWPMT6XO6Z6VXQS2K/action/citation_signature","submit_replication":"https://pith.science/pith/BIXMD2W32TWPMT6XO6Z6VXQS2K/action/replication_record"}},"created_at":"2026-07-05T00:03:53.266746+00:00","updated_at":"2026-07-05T00:03:53.266746+00:00"}