{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:AW2U4CLO2Y3S5MBICJRHQ57FSB","short_pith_number":"pith:AW2U4CLO","schema_version":"1.0","canonical_sha256":"05b54e096ed6372eb02812627877e590771d315f686436bb20747f07875e2bf6","source":{"kind":"arxiv","id":"1612.06936","version":1},"attestation_state":"computed","paper":{"title":"On the edge metric dimension for the random graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nina Zubrilina","submitted_at":"2016-12-21T01:11:11Z","abstract_excerpt":"Let $G(V, E)$ be a connected simple undirected graph. In this paper we prove that the edge metric dimension (introduced by Kelenc, Tratnik and Yero) of the Erd\\H{o}s-R\\'enyi random graph $G(n, p)$ is given by: $$\\textrm{edim}(G(n, p)) = (1 + o(1))\\frac{4\\log(n)}{\\log(1/q)},$$ where $q = 1 - 2p(1-p)^2(2-p)$."},"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":"1612.06936","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-21T01:11:11Z","cross_cats_sorted":[],"title_canon_sha256":"4a1a4ed25347f0cf7151b371e6d01e99323df5c47174769a186d57538053b47d","abstract_canon_sha256":"b3ad5d3754463f92ba6ea48255e932b4b6bf1e784b2ccf2df64ac84336a4c67a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:15.023044Z","signature_b64":"09E6bp/HmdzH80IIuUe8yh3SDpZDikO+4ubDRFPEcE6DlIRk4tVCQUZGy/8CcrHzms+Cn6LRjVoaEw+8IkGVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05b54e096ed6372eb02812627877e590771d315f686436bb20747f07875e2bf6","last_reissued_at":"2026-05-18T00:54:15.022625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:15.022625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the edge metric dimension for the random graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nina Zubrilina","submitted_at":"2016-12-21T01:11:11Z","abstract_excerpt":"Let $G(V, E)$ be a connected simple undirected graph. In this paper we prove that the edge metric dimension (introduced by Kelenc, Tratnik and Yero) of the Erd\\H{o}s-R\\'enyi random graph $G(n, p)$ is given by: $$\\textrm{edim}(G(n, p)) = (1 + o(1))\\frac{4\\log(n)}{\\log(1/q)},$$ where $q = 1 - 2p(1-p)^2(2-p)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06936","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":""},"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":"1612.06936","created_at":"2026-05-18T00:54:15.022707+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.06936v1","created_at":"2026-05-18T00:54:15.022707+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06936","created_at":"2026-05-18T00:54:15.022707+00:00"},{"alias_kind":"pith_short_12","alias_value":"AW2U4CLO2Y3S","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"AW2U4CLO2Y3S5MBI","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"AW2U4CLO","created_at":"2026-05-18T12:30:07.202191+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/AW2U4CLO2Y3S5MBICJRHQ57FSB","json":"https://pith.science/pith/AW2U4CLO2Y3S5MBICJRHQ57FSB.json","graph_json":"https://pith.science/api/pith-number/AW2U4CLO2Y3S5MBICJRHQ57FSB/graph.json","events_json":"https://pith.science/api/pith-number/AW2U4CLO2Y3S5MBICJRHQ57FSB/events.json","paper":"https://pith.science/paper/AW2U4CLO"},"agent_actions":{"view_html":"https://pith.science/pith/AW2U4CLO2Y3S5MBICJRHQ57FSB","download_json":"https://pith.science/pith/AW2U4CLO2Y3S5MBICJRHQ57FSB.json","view_paper":"https://pith.science/paper/AW2U4CLO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.06936&json=true","fetch_graph":"https://pith.science/api/pith-number/AW2U4CLO2Y3S5MBICJRHQ57FSB/graph.json","fetch_events":"https://pith.science/api/pith-number/AW2U4CLO2Y3S5MBICJRHQ57FSB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AW2U4CLO2Y3S5MBICJRHQ57FSB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AW2U4CLO2Y3S5MBICJRHQ57FSB/action/storage_attestation","attest_author":"https://pith.science/pith/AW2U4CLO2Y3S5MBICJRHQ57FSB/action/author_attestation","sign_citation":"https://pith.science/pith/AW2U4CLO2Y3S5MBICJRHQ57FSB/action/citation_signature","submit_replication":"https://pith.science/pith/AW2U4CLO2Y3S5MBICJRHQ57FSB/action/replication_record"}},"created_at":"2026-05-18T00:54:15.022707+00:00","updated_at":"2026-05-18T00:54:15.022707+00:00"}