{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MG3P27N33FM5ICH2VKH6522FYT","short_pith_number":"pith:MG3P27N3","schema_version":"1.0","canonical_sha256":"61b6fd7dbbd959d408faaa8feeeb45c4f8a9f03e4d55bad8df81c2d1deb54e04","source":{"kind":"arxiv","id":"1611.01904","version":2},"attestation_state":"computed","paper":{"title":"On Edge Dimension of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nina Zubrilina","submitted_at":"2016-11-07T06:31:42Z","abstract_excerpt":"Given a connected graph $G(V, E)$, the edge dimension, denoted $\\mathrm{edim}(G)$, is the least size of a set $S \\subseteq V$ that distinguishes every pair of edges of $G$, in the sense that the edges have pairwise distinct tuples of distances to the vertices of $S$. The notation was introduced by Kelenc, Tratnik, and Yero, and in their paper, they asked several questions about properties of $\\mathrm{edim}$. In this article we answer two of these questions: we classify the graphs for which $\\mathrm{edim}(G) = n-1$ and show that $\\frac{\\mathrm{edim}(G)}{\\dim(G)}$ isn't bounded from above (here "},"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":"1611.01904","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-07T06:31:42Z","cross_cats_sorted":[],"title_canon_sha256":"1cd082fe44be830b8141011abf89e61efe408bec8d1304b9d341693abd191db7","abstract_canon_sha256":"4e2ca8c816980a703d67ff200fdd57d7eccb337b392efac4a5eaa51d176d3a0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:39.179614Z","signature_b64":"S6lBX6F9P+a3pfcsGuZPf19+h2t6iUwpcjTeuetqaqW2+e9MEXUawSmjXleGy8DFxdPautKvpRvzrV0pCDuOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61b6fd7dbbd959d408faaa8feeeb45c4f8a9f03e4d55bad8df81c2d1deb54e04","last_reissued_at":"2026-05-18T00:46:39.178904Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:39.178904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Edge Dimension of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nina Zubrilina","submitted_at":"2016-11-07T06:31:42Z","abstract_excerpt":"Given a connected graph $G(V, E)$, the edge dimension, denoted $\\mathrm{edim}(G)$, is the least size of a set $S \\subseteq V$ that distinguishes every pair of edges of $G$, in the sense that the edges have pairwise distinct tuples of distances to the vertices of $S$. The notation was introduced by Kelenc, Tratnik, and Yero, and in their paper, they asked several questions about properties of $\\mathrm{edim}$. In this article we answer two of these questions: we classify the graphs for which $\\mathrm{edim}(G) = n-1$ and show that $\\frac{\\mathrm{edim}(G)}{\\dim(G)}$ isn't bounded from above (here "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01904","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1611.01904","created_at":"2026-05-18T00:46:39.179036+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.01904v2","created_at":"2026-05-18T00:46:39.179036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01904","created_at":"2026-05-18T00:46:39.179036+00:00"},{"alias_kind":"pith_short_12","alias_value":"MG3P27N33FM5","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MG3P27N33FM5ICH2","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MG3P27N3","created_at":"2026-05-18T12:30:32.724797+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/MG3P27N33FM5ICH2VKH6522FYT","json":"https://pith.science/pith/MG3P27N33FM5ICH2VKH6522FYT.json","graph_json":"https://pith.science/api/pith-number/MG3P27N33FM5ICH2VKH6522FYT/graph.json","events_json":"https://pith.science/api/pith-number/MG3P27N33FM5ICH2VKH6522FYT/events.json","paper":"https://pith.science/paper/MG3P27N3"},"agent_actions":{"view_html":"https://pith.science/pith/MG3P27N33FM5ICH2VKH6522FYT","download_json":"https://pith.science/pith/MG3P27N33FM5ICH2VKH6522FYT.json","view_paper":"https://pith.science/paper/MG3P27N3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.01904&json=true","fetch_graph":"https://pith.science/api/pith-number/MG3P27N33FM5ICH2VKH6522FYT/graph.json","fetch_events":"https://pith.science/api/pith-number/MG3P27N33FM5ICH2VKH6522FYT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MG3P27N33FM5ICH2VKH6522FYT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MG3P27N33FM5ICH2VKH6522FYT/action/storage_attestation","attest_author":"https://pith.science/pith/MG3P27N33FM5ICH2VKH6522FYT/action/author_attestation","sign_citation":"https://pith.science/pith/MG3P27N33FM5ICH2VKH6522FYT/action/citation_signature","submit_replication":"https://pith.science/pith/MG3P27N33FM5ICH2VKH6522FYT/action/replication_record"}},"created_at":"2026-05-18T00:46:39.179036+00:00","updated_at":"2026-05-18T00:46:39.179036+00:00"}