{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6ZI2FSDHCP2NBZTSVJCWB66HXN","short_pith_number":"pith:6ZI2FSDH","schema_version":"1.0","canonical_sha256":"f651a2c86713f4d0e672aa4560fbc7bb7c451577a46545f83fa50c6e9ab3dad7","source":{"kind":"arxiv","id":"2507.11686","version":1},"attestation_state":"computed","paper":{"title":"Multiset Metric Dimension of Binomial Random Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Austin Eide, Pawel Pralat","submitted_at":"2025-07-15T19:41:23Z","abstract_excerpt":"For a graph $G = (V,E)$ and a subset $R \\subseteq V$, we say that $R$ is \\textit{multiset resolving} for $G$ if for every pair of vertices $v,w$, the \\textit{multisets} $\\{d(v,r): r \\in R\\}$ and $\\{d(w,r):r \\in R\\}$ are distinct, where $d(x,y)$ is the graph distance between vertices $x$ and $y$. The \\textit{multiset metric dimension} of $G$ is the size of a smallest set $R \\subseteq V$ that is multiset resolving (or $\\infty$ if no such set exists). This graph parameter was introduced by Simanjuntak, Siagian, and Vitr\\'{i}k in 2017~\\cite{simanjuntak2017multiset}, and has since been studied for "},"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":"2507.11686","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-15T19:41:23Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9b6364125f41cb0a2f446592ad08e5fec8d062a72ffb282e00c4d3c587693baf","abstract_canon_sha256":"19b8919d179351362690c9d2c1efd2449a00340962b0572de5c7b7d16a1eb5a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:37:48.638461Z","signature_b64":"ZgJiKo/PRc/6wu4P87nsx7xVnsAknyIrIBw43W96piOWvcwMmiwOmROhTNJSsmzNlD1vWMzj7cWmbn9QOM/9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f651a2c86713f4d0e672aa4560fbc7bb7c451577a46545f83fa50c6e9ab3dad7","last_reissued_at":"2026-07-05T11:37:48.637932Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:37:48.637932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiset Metric Dimension of Binomial Random Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Austin Eide, Pawel Pralat","submitted_at":"2025-07-15T19:41:23Z","abstract_excerpt":"For a graph $G = (V,E)$ and a subset $R \\subseteq V$, we say that $R$ is \\textit{multiset resolving} for $G$ if for every pair of vertices $v,w$, the \\textit{multisets} $\\{d(v,r): r \\in R\\}$ and $\\{d(w,r):r \\in R\\}$ are distinct, where $d(x,y)$ is the graph distance between vertices $x$ and $y$. The \\textit{multiset metric dimension} of $G$ is the size of a smallest set $R \\subseteq V$ that is multiset resolving (or $\\infty$ if no such set exists). This graph parameter was introduced by Simanjuntak, Siagian, and Vitr\\'{i}k in 2017~\\cite{simanjuntak2017multiset}, and has since been studied for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11686","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/2507.11686/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":"2507.11686","created_at":"2026-07-05T11:37:48.637992+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.11686v1","created_at":"2026-07-05T11:37:48.637992+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11686","created_at":"2026-07-05T11:37:48.637992+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ZI2FSDHCP2N","created_at":"2026-07-05T11:37:48.637992+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ZI2FSDHCP2NBZTS","created_at":"2026-07-05T11:37:48.637992+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ZI2FSDH","created_at":"2026-07-05T11:37:48.637992+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/6ZI2FSDHCP2NBZTSVJCWB66HXN","json":"https://pith.science/pith/6ZI2FSDHCP2NBZTSVJCWB66HXN.json","graph_json":"https://pith.science/api/pith-number/6ZI2FSDHCP2NBZTSVJCWB66HXN/graph.json","events_json":"https://pith.science/api/pith-number/6ZI2FSDHCP2NBZTSVJCWB66HXN/events.json","paper":"https://pith.science/paper/6ZI2FSDH"},"agent_actions":{"view_html":"https://pith.science/pith/6ZI2FSDHCP2NBZTSVJCWB66HXN","download_json":"https://pith.science/pith/6ZI2FSDHCP2NBZTSVJCWB66HXN.json","view_paper":"https://pith.science/paper/6ZI2FSDH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.11686&json=true","fetch_graph":"https://pith.science/api/pith-number/6ZI2FSDHCP2NBZTSVJCWB66HXN/graph.json","fetch_events":"https://pith.science/api/pith-number/6ZI2FSDHCP2NBZTSVJCWB66HXN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ZI2FSDHCP2NBZTSVJCWB66HXN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ZI2FSDHCP2NBZTSVJCWB66HXN/action/storage_attestation","attest_author":"https://pith.science/pith/6ZI2FSDHCP2NBZTSVJCWB66HXN/action/author_attestation","sign_citation":"https://pith.science/pith/6ZI2FSDHCP2NBZTSVJCWB66HXN/action/citation_signature","submit_replication":"https://pith.science/pith/6ZI2FSDHCP2NBZTSVJCWB66HXN/action/replication_record"}},"created_at":"2026-07-05T11:37:48.637992+00:00","updated_at":"2026-07-05T11:37:48.637992+00:00"}