{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2C72QYYGW24IEW2G5ODPK52KRE","short_pith_number":"pith:2C72QYYG","schema_version":"1.0","canonical_sha256":"d0bfa86306b6b8825b46eb86f5774a892b0314d19903e64fdd6ede43429f9902","source":{"kind":"arxiv","id":"1908.05879","version":1},"attestation_state":"computed","paper":{"title":"Multiset Dimensions of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Rinovia Simanjuntak, Rizki Kurniawan, Saladin Uttunggadewa, Steven Tanujaya, Suhadi Saputro, Yusuf Hafidh","submitted_at":"2019-08-16T08:08:06Z","abstract_excerpt":"Let $G$ be a connected graph and $W$ be a set of vertices of $G$. The representation multiset of a vertex $v$ with respect to $W$, $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)$; otherwise, we say that $md(G) = \\infty$.\n  In this paper, we show that for a tree $T$ of diameter at least 2, if "},"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":"1908.05879","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-16T08:08:06Z","cross_cats_sorted":[],"title_canon_sha256":"bf065732000db2935e2221a6d043764823975f0d42241358119a35128e78099d","abstract_canon_sha256":"0890d6b078bf6f5b533a6724427ebb37dc6c11048b330fc5058a5a6a58cfee42"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:57:53.980684Z","signature_b64":"NYxya/7GMUJH4WQzAKYb8tpKdPQ6s4yVYh44Kt0oy+MPokumca9RmLpHvdh9QwtTWYn9pBLFANuC0yMMOCjJCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0bfa86306b6b8825b46eb86f5774a892b0314d19903e64fdd6ede43429f9902","last_reissued_at":"2026-07-04T23:57:53.980347Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:57:53.980347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiset Dimensions of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Rinovia Simanjuntak, Rizki Kurniawan, Saladin Uttunggadewa, Steven Tanujaya, Suhadi Saputro, Yusuf Hafidh","submitted_at":"2019-08-16T08:08:06Z","abstract_excerpt":"Let $G$ be a connected graph and $W$ be a set of vertices of $G$. The representation multiset of a vertex $v$ with respect to $W$, $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)$; otherwise, we say that $md(G) = \\infty$.\n  In this paper, we show that for a tree $T$ of diameter at least 2, if "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05879","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.05879/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":"1908.05879","created_at":"2026-07-04T23:57:53.980403+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.05879v1","created_at":"2026-07-04T23:57:53.980403+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05879","created_at":"2026-07-04T23:57:53.980403+00:00"},{"alias_kind":"pith_short_12","alias_value":"2C72QYYGW24I","created_at":"2026-07-04T23:57:53.980403+00:00"},{"alias_kind":"pith_short_16","alias_value":"2C72QYYGW24IEW2G","created_at":"2026-07-04T23:57:53.980403+00:00"},{"alias_kind":"pith_short_8","alias_value":"2C72QYYG","created_at":"2026-07-04T23:57:53.980403+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08128","citing_title":"A Survey on Multiset Dimension and Its Variations","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2C72QYYGW24IEW2G5ODPK52KRE","json":"https://pith.science/pith/2C72QYYGW24IEW2G5ODPK52KRE.json","graph_json":"https://pith.science/api/pith-number/2C72QYYGW24IEW2G5ODPK52KRE/graph.json","events_json":"https://pith.science/api/pith-number/2C72QYYGW24IEW2G5ODPK52KRE/events.json","paper":"https://pith.science/paper/2C72QYYG"},"agent_actions":{"view_html":"https://pith.science/pith/2C72QYYGW24IEW2G5ODPK52KRE","download_json":"https://pith.science/pith/2C72QYYGW24IEW2G5ODPK52KRE.json","view_paper":"https://pith.science/paper/2C72QYYG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.05879&json=true","fetch_graph":"https://pith.science/api/pith-number/2C72QYYGW24IEW2G5ODPK52KRE/graph.json","fetch_events":"https://pith.science/api/pith-number/2C72QYYGW24IEW2G5ODPK52KRE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2C72QYYGW24IEW2G5ODPK52KRE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2C72QYYGW24IEW2G5ODPK52KRE/action/storage_attestation","attest_author":"https://pith.science/pith/2C72QYYGW24IEW2G5ODPK52KRE/action/author_attestation","sign_citation":"https://pith.science/pith/2C72QYYGW24IEW2G5ODPK52KRE/action/citation_signature","submit_replication":"https://pith.science/pith/2C72QYYGW24IEW2G5ODPK52KRE/action/replication_record"}},"created_at":"2026-07-04T23:57:53.980403+00:00","updated_at":"2026-07-04T23:57:53.980403+00:00"}