{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7Z6KAVJVZCVOXCNYZOFXH7YD2S","short_pith_number":"pith:7Z6KAVJV","schema_version":"1.0","canonical_sha256":"fe7ca05535c8aaeb89b8cb8b73ff03d4842a1322de2f942a59b84cdde8dea59b","source":{"kind":"arxiv","id":"1407.5075","version":1},"attestation_state":"computed","paper":{"title":"Separation dimension of bounded degree graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Deepak Rajendraprasad, L. Sunil Chandran, Manu Basavaraju, Noga Alon, Rogers Mathew","submitted_at":"2014-07-18T18:23:39Z","abstract_excerpt":"The 'separation dimension' of a graph $G$ is the smallest natural number $k$ for which the vertices of $G$ can be embedded in $\\mathbb{R}^k$ such that any pair of disjoint edges in $G$ can be separated by a hyperplane normal to one of the axes. Equivalently, it is the smallest possible cardinality of a family $\\mathcal{F}$ of total orders of the vertices of $G$ such that for any two disjoint edges of $G$, there exists at least one total order in $\\mathcal{F}$ in which all the vertices in one edge precede those in the other. In general, the maximum separation dimension of a graph on $n$ vertice"},"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":"1407.5075","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-18T18:23:39Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ecb6675f098f5522d0295f075e7f2977c58cd30c0c67765762378fad6d0fa369","abstract_canon_sha256":"0330cba46af0913252eabdcae42710ec28974eea8dc4a665de371c036e9ad457"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:22.034436Z","signature_b64":"SQuoFfkhHd2bMYkJIOwyzcMTALrgU9E5DSoU7ccnZGat3JcE+nGv13tvO2gLDv9pjAc8YXbanDp+RBHrpMVOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe7ca05535c8aaeb89b8cb8b73ff03d4842a1322de2f942a59b84cdde8dea59b","last_reissued_at":"2026-05-18T02:47:22.033756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:22.033756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Separation dimension of bounded degree graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Deepak Rajendraprasad, L. Sunil Chandran, Manu Basavaraju, Noga Alon, Rogers Mathew","submitted_at":"2014-07-18T18:23:39Z","abstract_excerpt":"The 'separation dimension' of a graph $G$ is the smallest natural number $k$ for which the vertices of $G$ can be embedded in $\\mathbb{R}^k$ such that any pair of disjoint edges in $G$ can be separated by a hyperplane normal to one of the axes. Equivalently, it is the smallest possible cardinality of a family $\\mathcal{F}$ of total orders of the vertices of $G$ such that for any two disjoint edges of $G$, there exists at least one total order in $\\mathcal{F}$ in which all the vertices in one edge precede those in the other. In general, the maximum separation dimension of a graph on $n$ vertice"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5075","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":"1407.5075","created_at":"2026-05-18T02:47:22.033852+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.5075v1","created_at":"2026-05-18T02:47:22.033852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5075","created_at":"2026-05-18T02:47:22.033852+00:00"},{"alias_kind":"pith_short_12","alias_value":"7Z6KAVJVZCVO","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7Z6KAVJVZCVOXCNY","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7Z6KAVJV","created_at":"2026-05-18T12:28:19.803747+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/7Z6KAVJVZCVOXCNYZOFXH7YD2S","json":"https://pith.science/pith/7Z6KAVJVZCVOXCNYZOFXH7YD2S.json","graph_json":"https://pith.science/api/pith-number/7Z6KAVJVZCVOXCNYZOFXH7YD2S/graph.json","events_json":"https://pith.science/api/pith-number/7Z6KAVJVZCVOXCNYZOFXH7YD2S/events.json","paper":"https://pith.science/paper/7Z6KAVJV"},"agent_actions":{"view_html":"https://pith.science/pith/7Z6KAVJVZCVOXCNYZOFXH7YD2S","download_json":"https://pith.science/pith/7Z6KAVJVZCVOXCNYZOFXH7YD2S.json","view_paper":"https://pith.science/paper/7Z6KAVJV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.5075&json=true","fetch_graph":"https://pith.science/api/pith-number/7Z6KAVJVZCVOXCNYZOFXH7YD2S/graph.json","fetch_events":"https://pith.science/api/pith-number/7Z6KAVJVZCVOXCNYZOFXH7YD2S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7Z6KAVJVZCVOXCNYZOFXH7YD2S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7Z6KAVJVZCVOXCNYZOFXH7YD2S/action/storage_attestation","attest_author":"https://pith.science/pith/7Z6KAVJVZCVOXCNYZOFXH7YD2S/action/author_attestation","sign_citation":"https://pith.science/pith/7Z6KAVJVZCVOXCNYZOFXH7YD2S/action/citation_signature","submit_replication":"https://pith.science/pith/7Z6KAVJVZCVOXCNYZOFXH7YD2S/action/replication_record"}},"created_at":"2026-05-18T02:47:22.033852+00:00","updated_at":"2026-05-18T02:47:22.033852+00:00"}