{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:6ZI2FSDHCP2NBZTSVJCWB66HXN","short_pith_number":"pith:6ZI2FSDH","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"},"canonical_sha256":"f651a2c86713f4d0e672aa4560fbc7bb7c451577a46545f83fa50c6e9ab3dad7","source":{"kind":"arxiv","id":"2507.11686","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11686","created_at":"2026-07-05T11:37:48Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11686v1","created_at":"2026-07-05T11:37:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11686","created_at":"2026-07-05T11:37:48Z"},{"alias_kind":"pith_short_12","alias_value":"6ZI2FSDHCP2N","created_at":"2026-07-05T11:37:48Z"},{"alias_kind":"pith_short_16","alias_value":"6ZI2FSDHCP2NBZTS","created_at":"2026-07-05T11:37:48Z"},{"alias_kind":"pith_short_8","alias_value":"6ZI2FSDH","created_at":"2026-07-05T11:37:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:6ZI2FSDHCP2NBZTSVJCWB66HXN","target":"record","payload":{"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"},"canonical_sha256":"f651a2c86713f4d0e672aa4560fbc7bb7c451577a46545f83fa50c6e9ab3dad7","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"},"source_kind":"arxiv","source_id":"2507.11686","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:37:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S40aGgLORiYpIUkwCAcHwfwS6dQqiMwHnKAwrAuvPIwJGSwgzjI535rz7QotKVkawnRtXKNjowHMItzPWyBtDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T23:32:40.065616Z"},"content_sha256":"633aae07aa4ef699ab8d231bdceda140f727a9de7379f069b7d1651062d81978","schema_version":"1.0","event_id":"sha256:633aae07aa4ef699ab8d231bdceda140f727a9de7379f069b7d1651062d81978"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:6ZI2FSDHCP2NBZTSVJCWB66HXN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:37:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lg0CP05K+HBdoLg3IvBgfJ98VipNVY9GO4RlcN/dW1zYeConx9tvowsIB9wIXO4Zk1ZDyym7N8sfqsiQ0tu7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T23:32:40.066195Z"},"content_sha256":"e460628b25e2970817db8bf313018ed80f1b6c4f0da247f399711eabe7e46945","schema_version":"1.0","event_id":"sha256:e460628b25e2970817db8bf313018ed80f1b6c4f0da247f399711eabe7e46945"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6ZI2FSDHCP2NBZTSVJCWB66HXN/bundle.json","state_url":"https://pith.science/pith/6ZI2FSDHCP2NBZTSVJCWB66HXN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6ZI2FSDHCP2NBZTSVJCWB66HXN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T23:32:40Z","links":{"resolver":"https://pith.science/pith/6ZI2FSDHCP2NBZTSVJCWB66HXN","bundle":"https://pith.science/pith/6ZI2FSDHCP2NBZTSVJCWB66HXN/bundle.json","state":"https://pith.science/pith/6ZI2FSDHCP2NBZTSVJCWB66HXN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6ZI2FSDHCP2NBZTSVJCWB66HXN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:6ZI2FSDHCP2NBZTSVJCWB66HXN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"19b8919d179351362690c9d2c1efd2449a00340962b0572de5c7b7d16a1eb5a3","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-15T19:41:23Z","title_canon_sha256":"9b6364125f41cb0a2f446592ad08e5fec8d062a72ffb282e00c4d3c587693baf"},"schema_version":"1.0","source":{"id":"2507.11686","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11686","created_at":"2026-07-05T11:37:48Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11686v1","created_at":"2026-07-05T11:37:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11686","created_at":"2026-07-05T11:37:48Z"},{"alias_kind":"pith_short_12","alias_value":"6ZI2FSDHCP2N","created_at":"2026-07-05T11:37:48Z"},{"alias_kind":"pith_short_16","alias_value":"6ZI2FSDHCP2NBZTS","created_at":"2026-07-05T11:37:48Z"},{"alias_kind":"pith_short_8","alias_value":"6ZI2FSDH","created_at":"2026-07-05T11:37:48Z"}],"graph_snapshots":[{"event_id":"sha256:e460628b25e2970817db8bf313018ed80f1b6c4f0da247f399711eabe7e46945","target":"graph","created_at":"2026-07-05T11:37:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.11686/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Austin Eide, Pawel Pralat","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-15T19:41:23Z","title":"Multiset Metric Dimension of Binomial Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11686","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:633aae07aa4ef699ab8d231bdceda140f727a9de7379f069b7d1651062d81978","target":"record","created_at":"2026-07-05T11:37:48Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"19b8919d179351362690c9d2c1efd2449a00340962b0572de5c7b7d16a1eb5a3","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-15T19:41:23Z","title_canon_sha256":"9b6364125f41cb0a2f446592ad08e5fec8d062a72ffb282e00c4d3c587693baf"},"schema_version":"1.0","source":{"id":"2507.11686","kind":"arxiv","version":1}},"canonical_sha256":"f651a2c86713f4d0e672aa4560fbc7bb7c451577a46545f83fa50c6e9ab3dad7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f651a2c86713f4d0e672aa4560fbc7bb7c451577a46545f83fa50c6e9ab3dad7","first_computed_at":"2026-07-05T11:37:48.637932Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:37:48.637932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZgJiKo/PRc/6wu4P87nsx7xVnsAknyIrIBw43W96piOWvcwMmiwOmROhTNJSsmzNlD1vWMzj7cWmbn9QOM/9BA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:37:48.638461Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.11686","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:633aae07aa4ef699ab8d231bdceda140f727a9de7379f069b7d1651062d81978","sha256:e460628b25e2970817db8bf313018ed80f1b6c4f0da247f399711eabe7e46945"],"state_sha256":"bae8ed805e1bcd68b68f79aa784b8fa9d3569aa6e70c6230a5f832370ad082f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EA1h/rPrBURX/+DLGbTtaL3WtvMEU0YzN+N9OcT1lMtSvbXs2P28Q/XH/CFGbj3K12ADVhAttJjvOMv0UJNZCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T23:32:40.070256Z","bundle_sha256":"7dc865fc71c0649088c22ab5d51999f38c95e60b5021240300012073dcb62092"}}