{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MG3P27N33FM5ICH2VKH6522FYT","short_pith_number":"pith:MG3P27N3","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"},"canonical_sha256":"61b6fd7dbbd959d408faaa8feeeb45c4f8a9f03e4d55bad8df81c2d1deb54e04","source":{"kind":"arxiv","id":"1611.01904","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01904","created_at":"2026-05-18T00:46:39Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01904v2","created_at":"2026-05-18T00:46:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01904","created_at":"2026-05-18T00:46:39Z"},{"alias_kind":"pith_short_12","alias_value":"MG3P27N33FM5","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MG3P27N33FM5ICH2","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MG3P27N3","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MG3P27N33FM5ICH2VKH6522FYT","target":"record","payload":{"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"},"canonical_sha256":"61b6fd7dbbd959d408faaa8feeeb45c4f8a9f03e4d55bad8df81c2d1deb54e04","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"},"source_kind":"arxiv","source_id":"1611.01904","source_version":2,"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-05-18T00:46:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JMkL/K3YT1p9ux1oI2pHM+Ab8I9kJvncm2fj6hB6hTDUTV5OFinHiQ+LFZK4aQlkmJQ2V/IQjBcujTrqhA14Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:39:41.179787Z"},"content_sha256":"3675ea9f2cae9520aa8f262d952719c5ff42500c302a2e81fd8914ae5a9de3fe","schema_version":"1.0","event_id":"sha256:3675ea9f2cae9520aa8f262d952719c5ff42500c302a2e81fd8914ae5a9de3fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MG3P27N33FM5ICH2VKH6522FYT","target":"graph","payload":{"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"},"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-05-18T00:46:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AtkuaYX/Xayxh6sVXJBxOR0YJ6ij9XSqsY11leKZZi7voqzH1Od0YC6BHg//wgo3A+80h7e6Dycl5SI2+p51AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:39:41.180369Z"},"content_sha256":"195141d409597223fb933f28489e6620ee1eb1df0c41c018c9a0816a2f4c58ac","schema_version":"1.0","event_id":"sha256:195141d409597223fb933f28489e6620ee1eb1df0c41c018c9a0816a2f4c58ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MG3P27N33FM5ICH2VKH6522FYT/bundle.json","state_url":"https://pith.science/pith/MG3P27N33FM5ICH2VKH6522FYT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MG3P27N33FM5ICH2VKH6522FYT/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-06-11T06:39:41Z","links":{"resolver":"https://pith.science/pith/MG3P27N33FM5ICH2VKH6522FYT","bundle":"https://pith.science/pith/MG3P27N33FM5ICH2VKH6522FYT/bundle.json","state":"https://pith.science/pith/MG3P27N33FM5ICH2VKH6522FYT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MG3P27N33FM5ICH2VKH6522FYT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MG3P27N33FM5ICH2VKH6522FYT","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":"4e2ca8c816980a703d67ff200fdd57d7eccb337b392efac4a5eaa51d176d3a0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-07T06:31:42Z","title_canon_sha256":"1cd082fe44be830b8141011abf89e61efe408bec8d1304b9d341693abd191db7"},"schema_version":"1.0","source":{"id":"1611.01904","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01904","created_at":"2026-05-18T00:46:39Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01904v2","created_at":"2026-05-18T00:46:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01904","created_at":"2026-05-18T00:46:39Z"},{"alias_kind":"pith_short_12","alias_value":"MG3P27N33FM5","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MG3P27N33FM5ICH2","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MG3P27N3","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:195141d409597223fb933f28489e6620ee1eb1df0c41c018c9a0816a2f4c58ac","target":"graph","created_at":"2026-05-18T00:46:39Z","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"},"paper":{"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 ","authors_text":"Nina Zubrilina","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-07T06:31:42Z","title":"On Edge Dimension of a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01904","kind":"arxiv","version":2},"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:3675ea9f2cae9520aa8f262d952719c5ff42500c302a2e81fd8914ae5a9de3fe","target":"record","created_at":"2026-05-18T00:46:39Z","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":"4e2ca8c816980a703d67ff200fdd57d7eccb337b392efac4a5eaa51d176d3a0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-07T06:31:42Z","title_canon_sha256":"1cd082fe44be830b8141011abf89e61efe408bec8d1304b9d341693abd191db7"},"schema_version":"1.0","source":{"id":"1611.01904","kind":"arxiv","version":2}},"canonical_sha256":"61b6fd7dbbd959d408faaa8feeeb45c4f8a9f03e4d55bad8df81c2d1deb54e04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61b6fd7dbbd959d408faaa8feeeb45c4f8a9f03e4d55bad8df81c2d1deb54e04","first_computed_at":"2026-05-18T00:46:39.178904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:39.178904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S6lBX6F9P+a3pfcsGuZPf19+h2t6iUwpcjTeuetqaqW2+e9MEXUawSmjXleGy8DFxdPautKvpRvzrV0pCDuOAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:39.179614Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01904","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3675ea9f2cae9520aa8f262d952719c5ff42500c302a2e81fd8914ae5a9de3fe","sha256:195141d409597223fb933f28489e6620ee1eb1df0c41c018c9a0816a2f4c58ac"],"state_sha256":"85aed34f63df1a6da6eaeb395edad80fcb28413ecba267a70ec1d61cee6da5dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4i446O6KsigzPRl1FgEPTJXSw4HQ+XHmXhguMB8ywJL6MwVlgMAFF+oXGBfV4K8ZwCU1iDoHn913Y8/NxHULCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:39:41.182893Z","bundle_sha256":"fc597ce07423d5310b6d831c82ac4970ac207c1ff7c760f032dd9803e0e48146"}}