{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:J3DFIEID2SQVEQG3ACIBRHXYTR","short_pith_number":"pith:J3DFIEID","schema_version":"1.0","canonical_sha256":"4ec6541103d4a15240db0090189ef89c65c04df320d66a90bc60d50f12054262","source":{"kind":"arxiv","id":"1501.00204","version":1},"attestation_state":"computed","paper":{"title":"On the Euclidean dimension of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Dan Ismailescu, Jin Hyup Hong","submitted_at":"2014-12-31T20:40:31Z","abstract_excerpt":"The Euclidean dimension a graph $G$ is defined to be the smallest integer $d$ such that the vertices of $G$ can be located in $\\mathbb{R}^d$ in such a way that two vertices are unit distance apart if and only if they are adjacent in $G$. In this paper we determine the Euclidean dimension for twelve well known graphs. Five of these graphs, D\\\"{u}rer, Franklin, Desargues, Heawood and Tietze can be embedded in the plane, while the remaining graphs, Chv\\'{a}tal, Goldner-Harrary, Herschel, Fritsch, Gr\\\"{o}tzsch, Hoffman and Soifer have Euclidean dimension $3$. We also present explicit embeddings fo"},"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":"1501.00204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-12-31T20:40:31Z","cross_cats_sorted":[],"title_canon_sha256":"68e777d9189208426d2536a6ce6e3729306a6f299c326e7aede335e4ccad15a1","abstract_canon_sha256":"6386de5ea9813f24550cfaf3d73b20cb15e473d4eddb1de5854c028ebbca628c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:09.863447Z","signature_b64":"ji76erR5gnR22wRjMhDdidwSGM03Pf1fP4yWjupt24s4yCbrEPN64jo8Zvk0XFPMZvQKe27YEHbrObosOZZsCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ec6541103d4a15240db0090189ef89c65c04df320d66a90bc60d50f12054262","last_reissued_at":"2026-05-18T02:30:09.863019Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:09.863019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Euclidean dimension of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Dan Ismailescu, Jin Hyup Hong","submitted_at":"2014-12-31T20:40:31Z","abstract_excerpt":"The Euclidean dimension a graph $G$ is defined to be the smallest integer $d$ such that the vertices of $G$ can be located in $\\mathbb{R}^d$ in such a way that two vertices are unit distance apart if and only if they are adjacent in $G$. In this paper we determine the Euclidean dimension for twelve well known graphs. Five of these graphs, D\\\"{u}rer, Franklin, Desargues, Heawood and Tietze can be embedded in the plane, while the remaining graphs, Chv\\'{a}tal, Goldner-Harrary, Herschel, Fritsch, Gr\\\"{o}tzsch, Hoffman and Soifer have Euclidean dimension $3$. We also present explicit embeddings fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00204","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":"1501.00204","created_at":"2026-05-18T02:30:09.863086+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00204v1","created_at":"2026-05-18T02:30:09.863086+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00204","created_at":"2026-05-18T02:30:09.863086+00:00"},{"alias_kind":"pith_short_12","alias_value":"J3DFIEID2SQV","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"J3DFIEID2SQVEQG3","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"J3DFIEID","created_at":"2026-05-18T12:28:33.132498+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/J3DFIEID2SQVEQG3ACIBRHXYTR","json":"https://pith.science/pith/J3DFIEID2SQVEQG3ACIBRHXYTR.json","graph_json":"https://pith.science/api/pith-number/J3DFIEID2SQVEQG3ACIBRHXYTR/graph.json","events_json":"https://pith.science/api/pith-number/J3DFIEID2SQVEQG3ACIBRHXYTR/events.json","paper":"https://pith.science/paper/J3DFIEID"},"agent_actions":{"view_html":"https://pith.science/pith/J3DFIEID2SQVEQG3ACIBRHXYTR","download_json":"https://pith.science/pith/J3DFIEID2SQVEQG3ACIBRHXYTR.json","view_paper":"https://pith.science/paper/J3DFIEID","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00204&json=true","fetch_graph":"https://pith.science/api/pith-number/J3DFIEID2SQVEQG3ACIBRHXYTR/graph.json","fetch_events":"https://pith.science/api/pith-number/J3DFIEID2SQVEQG3ACIBRHXYTR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J3DFIEID2SQVEQG3ACIBRHXYTR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J3DFIEID2SQVEQG3ACIBRHXYTR/action/storage_attestation","attest_author":"https://pith.science/pith/J3DFIEID2SQVEQG3ACIBRHXYTR/action/author_attestation","sign_citation":"https://pith.science/pith/J3DFIEID2SQVEQG3ACIBRHXYTR/action/citation_signature","submit_replication":"https://pith.science/pith/J3DFIEID2SQVEQG3ACIBRHXYTR/action/replication_record"}},"created_at":"2026-05-18T02:30:09.863086+00:00","updated_at":"2026-05-18T02:30:09.863086+00:00"}