{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DJ3FNW4I6VIWTHXZH44CZS7467","short_pith_number":"pith:DJ3FNW4I","schema_version":"1.0","canonical_sha256":"1a7656db88f551699ef93f382ccbfcf7c3ea808f5283eb1fa9fba5be05578ef2","source":{"kind":"arxiv","id":"2607.28813","version":1},"attestation_state":"computed","paper":{"title":"The Multiset Dimension of Graphs: Extremal Values and King Grids","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jaan Allikvere","submitted_at":"2026-07-30T20:15:44Z","abstract_excerpt":"We present three results on the multiset dimension of graphs, resolving one conjecture and two open questions from the literature. First, we disprove the conjecture of Simanjuntak, Siagian and Vetr\\'ik (2017) that every graph $G$ of order $n(G)$ with finite multiset dimension satisfies $\\dim_m(G) \\le n(G)-1$: an exhaustive computation over all 1,018,690,328 connected graphs of orders 2 through 11 shows that exactly eight graphs attain $\\dim_m(G)=n(G)$, all of order 11, so 11 is the smallest order at which the trivial upper bound is attained. This also answers a question from the recent survey "},"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":"2607.28813","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-07-30T20:15:44Z","cross_cats_sorted":[],"title_canon_sha256":"e91a2fbbcb4d3ad1108ac43236f9cdbe69314782519d413cda286146f13b01f6","abstract_canon_sha256":"fd6f40f838cb33a4307c8d3b863ad2b3a2b68d5d3bcd22f44de5c13a25d5727f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-03T00:13:06.026713Z","signature_b64":"shnXZrqBb/8yW80kKcLoWojfDriFJXaESQtT67wbmNa2hlaHOQuq7WLTaJf2fcblcpmZLf+nkB3k3bswpnb3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a7656db88f551699ef93f382ccbfcf7c3ea808f5283eb1fa9fba5be05578ef2","last_reissued_at":"2026-08-03T00:13:06.024362Z","signature_status":"signed_v1","first_computed_at":"2026-08-03T00:13:06.024362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Multiset Dimension of Graphs: Extremal Values and King Grids","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jaan Allikvere","submitted_at":"2026-07-30T20:15:44Z","abstract_excerpt":"We present three results on the multiset dimension of graphs, resolving one conjecture and two open questions from the literature. First, we disprove the conjecture of Simanjuntak, Siagian and Vetr\\'ik (2017) that every graph $G$ of order $n(G)$ with finite multiset dimension satisfies $\\dim_m(G) \\le n(G)-1$: an exhaustive computation over all 1,018,690,328 connected graphs of orders 2 through 11 shows that exactly eight graphs attain $\\dim_m(G)=n(G)$, all of order 11, so 11 is the smallest order at which the trivial upper bound is attained. This also answers a question from the recent survey "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28813","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/2607.28813/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":"2607.28813","created_at":"2026-08-03T00:13:06.025923+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.28813v1","created_at":"2026-08-03T00:13:06.025923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28813","created_at":"2026-08-03T00:13:06.025923+00:00"},{"alias_kind":"pith_short_12","alias_value":"DJ3FNW4I6VIW","created_at":"2026-08-03T00:13:06.025923+00:00"},{"alias_kind":"pith_short_16","alias_value":"DJ3FNW4I6VIWTHXZ","created_at":"2026-08-03T00:13:06.025923+00:00"},{"alias_kind":"pith_short_8","alias_value":"DJ3FNW4I","created_at":"2026-08-03T00:13:06.025923+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/DJ3FNW4I6VIWTHXZH44CZS7467","json":"https://pith.science/pith/DJ3FNW4I6VIWTHXZH44CZS7467.json","graph_json":"https://pith.science/api/pith-number/DJ3FNW4I6VIWTHXZH44CZS7467/graph.json","events_json":"https://pith.science/api/pith-number/DJ3FNW4I6VIWTHXZH44CZS7467/events.json","paper":"https://pith.science/paper/DJ3FNW4I"},"agent_actions":{"view_html":"https://pith.science/pith/DJ3FNW4I6VIWTHXZH44CZS7467","download_json":"https://pith.science/pith/DJ3FNW4I6VIWTHXZH44CZS7467.json","view_paper":"https://pith.science/paper/DJ3FNW4I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.28813&json=true","fetch_graph":"https://pith.science/api/pith-number/DJ3FNW4I6VIWTHXZH44CZS7467/graph.json","fetch_events":"https://pith.science/api/pith-number/DJ3FNW4I6VIWTHXZH44CZS7467/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DJ3FNW4I6VIWTHXZH44CZS7467/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DJ3FNW4I6VIWTHXZH44CZS7467/action/storage_attestation","attest_author":"https://pith.science/pith/DJ3FNW4I6VIWTHXZH44CZS7467/action/author_attestation","sign_citation":"https://pith.science/pith/DJ3FNW4I6VIWTHXZH44CZS7467/action/citation_signature","submit_replication":"https://pith.science/pith/DJ3FNW4I6VIWTHXZH44CZS7467/action/replication_record"}},"created_at":"2026-08-03T00:13:06.025923+00:00","updated_at":"2026-08-03T00:13:06.025923+00:00"}