{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YCT2XJ2DFWFJHBJJO6MJUZ5HEN","short_pith_number":"pith:YCT2XJ2D","schema_version":"1.0","canonical_sha256":"c0a7aba7432d8a93852977989a67a723645f3483058a6551cc8238bde1909103","source":{"kind":"arxiv","id":"2608.09983","version":1},"attestation_state":"computed","paper":{"title":"The edge multiset dimension of hypercubes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jaan Allikvere","submitted_at":"2026-08-05T13:05:09Z","abstract_excerpt":"For a graph G and a nonempty set S of vertices, the edge multiset representation of an edge e is the multiset of distances from e to the elements of S, where d(uv,s)=min{d(u,s),d(v,s)}. The edge multiset dimension edim_m(G) is the minimum cardinality of a set whose edge representations are pairwise distinct, and is infinite if no such set exists. A recent survey asked whether edim_m(Q_d) is infinite for every d >= 3. We answer this question negatively and determine the finite-infinite transition completely: edim_m(Q_d) is infinite if and only if 2 <= d <= 5. An exhaustive computation proves ed"},"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":"2608.09983","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-05T13:05:09Z","cross_cats_sorted":[],"title_canon_sha256":"1eb07277f1bbcd38c07262652425f3341fba632b365fd17917f69bd65975fa2f","abstract_canon_sha256":"124aade3459c4541bec8e53e557721354c13235a1fc32037e7985d53213f2abc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-12T00:22:32.015838Z","signature_b64":"B9U06t6bCVsw7RmzKjXFumhoi8pQMnJO6Zg9O8KzmmdfpE5zuk19loE8JE8+P5EGpjzmojyAZ2658iFzO12wBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0a7aba7432d8a93852977989a67a723645f3483058a6551cc8238bde1909103","last_reissued_at":"2026-08-12T00:22:32.014222Z","signature_status":"signed_v1","first_computed_at":"2026-08-12T00:22:32.014222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The edge multiset dimension of hypercubes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jaan Allikvere","submitted_at":"2026-08-05T13:05:09Z","abstract_excerpt":"For a graph G and a nonempty set S of vertices, the edge multiset representation of an edge e is the multiset of distances from e to the elements of S, where d(uv,s)=min{d(u,s),d(v,s)}. The edge multiset dimension edim_m(G) is the minimum cardinality of a set whose edge representations are pairwise distinct, and is infinite if no such set exists. A recent survey asked whether edim_m(Q_d) is infinite for every d >= 3. We answer this question negatively and determine the finite-infinite transition completely: edim_m(Q_d) is infinite if and only if 2 <= d <= 5. An exhaustive computation proves ed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.09983","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/2608.09983/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":"2608.09983","created_at":"2026-08-12T00:22:32.016873+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.09983v1","created_at":"2026-08-12T00:22:32.016873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.09983","created_at":"2026-08-12T00:22:32.016873+00:00"},{"alias_kind":"pith_short_12","alias_value":"YCT2XJ2DFWFJ","created_at":"2026-08-12T00:22:32.016873+00:00"},{"alias_kind":"pith_short_16","alias_value":"YCT2XJ2DFWFJHBJJ","created_at":"2026-08-12T00:22:32.016873+00:00"},{"alias_kind":"pith_short_8","alias_value":"YCT2XJ2D","created_at":"2026-08-12T00:22:32.016873+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/YCT2XJ2DFWFJHBJJO6MJUZ5HEN","json":"https://pith.science/pith/YCT2XJ2DFWFJHBJJO6MJUZ5HEN.json","graph_json":"https://pith.science/api/pith-number/YCT2XJ2DFWFJHBJJO6MJUZ5HEN/graph.json","events_json":"https://pith.science/api/pith-number/YCT2XJ2DFWFJHBJJO6MJUZ5HEN/events.json","paper":"https://pith.science/paper/YCT2XJ2D"},"agent_actions":{"view_html":"https://pith.science/pith/YCT2XJ2DFWFJHBJJO6MJUZ5HEN","download_json":"https://pith.science/pith/YCT2XJ2DFWFJHBJJO6MJUZ5HEN.json","view_paper":"https://pith.science/paper/YCT2XJ2D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.09983&json=true","fetch_graph":"https://pith.science/api/pith-number/YCT2XJ2DFWFJHBJJO6MJUZ5HEN/graph.json","fetch_events":"https://pith.science/api/pith-number/YCT2XJ2DFWFJHBJJO6MJUZ5HEN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YCT2XJ2DFWFJHBJJO6MJUZ5HEN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YCT2XJ2DFWFJHBJJO6MJUZ5HEN/action/storage_attestation","attest_author":"https://pith.science/pith/YCT2XJ2DFWFJHBJJO6MJUZ5HEN/action/author_attestation","sign_citation":"https://pith.science/pith/YCT2XJ2DFWFJHBJJO6MJUZ5HEN/action/citation_signature","submit_replication":"https://pith.science/pith/YCT2XJ2DFWFJHBJJO6MJUZ5HEN/action/replication_record"}},"created_at":"2026-08-12T00:22:32.016873+00:00","updated_at":"2026-08-12T00:22:32.016873+00:00"}