{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7Z6KAVJVZCVOXCNYZOFXH7YD2S","short_pith_number":"pith:7Z6KAVJV","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"},"canonical_sha256":"fe7ca05535c8aaeb89b8cb8b73ff03d4842a1322de2f942a59b84cdde8dea59b","source":{"kind":"arxiv","id":"1407.5075","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5075","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5075v1","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5075","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"pith_short_12","alias_value":"7Z6KAVJVZCVO","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7Z6KAVJVZCVOXCNY","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7Z6KAVJV","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7Z6KAVJVZCVOXCNYZOFXH7YD2S","target":"record","payload":{"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"},"canonical_sha256":"fe7ca05535c8aaeb89b8cb8b73ff03d4842a1322de2f942a59b84cdde8dea59b","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"},"source_kind":"arxiv","source_id":"1407.5075","source_version":1,"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-18T02:47:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DS/T65REy/S84k46+W7fgLDWHvJubVTrHP355XILbrUx4UTWLk0dWdElVpSmGWHo3P8Ui6jLC7tPXXBW6jJFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:47:13.333228Z"},"content_sha256":"3de52792e3306741e9d29805b3ea15c5b0b8a5771200c381e13d916911e9b003","schema_version":"1.0","event_id":"sha256:3de52792e3306741e9d29805b3ea15c5b0b8a5771200c381e13d916911e9b003"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7Z6KAVJVZCVOXCNYZOFXH7YD2S","target":"graph","payload":{"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"},"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-18T02:47:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6zHH2CtiUHjHTuDIBnm9Ss7bPnMhNkCKfuH25owOnbucPTmXCQ/7z7lkqGF7gPleOVM0FjXqkH6n5NMaUR4CBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:47:13.333684Z"},"content_sha256":"b06f1cf2e426709f66667962287669264aa87bcfc22dd5032c8187e5ec9dda53","schema_version":"1.0","event_id":"sha256:b06f1cf2e426709f66667962287669264aa87bcfc22dd5032c8187e5ec9dda53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7Z6KAVJVZCVOXCNYZOFXH7YD2S/bundle.json","state_url":"https://pith.science/pith/7Z6KAVJVZCVOXCNYZOFXH7YD2S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7Z6KAVJVZCVOXCNYZOFXH7YD2S/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-01T01:47:13Z","links":{"resolver":"https://pith.science/pith/7Z6KAVJVZCVOXCNYZOFXH7YD2S","bundle":"https://pith.science/pith/7Z6KAVJVZCVOXCNYZOFXH7YD2S/bundle.json","state":"https://pith.science/pith/7Z6KAVJVZCVOXCNYZOFXH7YD2S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7Z6KAVJVZCVOXCNYZOFXH7YD2S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7Z6KAVJVZCVOXCNYZOFXH7YD2S","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":"0330cba46af0913252eabdcae42710ec28974eea8dc4a665de371c036e9ad457","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-18T18:23:39Z","title_canon_sha256":"ecb6675f098f5522d0295f075e7f2977c58cd30c0c67765762378fad6d0fa369"},"schema_version":"1.0","source":{"id":"1407.5075","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5075","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5075v1","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5075","created_at":"2026-05-18T02:47:22Z"},{"alias_kind":"pith_short_12","alias_value":"7Z6KAVJVZCVO","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7Z6KAVJVZCVOXCNY","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7Z6KAVJV","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:b06f1cf2e426709f66667962287669264aa87bcfc22dd5032c8187e5ec9dda53","target":"graph","created_at":"2026-05-18T02:47:22Z","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":"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","authors_text":"Deepak Rajendraprasad, L. Sunil Chandran, Manu Basavaraju, Noga Alon, Rogers Mathew","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-18T18:23:39Z","title":"Separation dimension of bounded degree graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5075","kind":"arxiv","version":1},"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:3de52792e3306741e9d29805b3ea15c5b0b8a5771200c381e13d916911e9b003","target":"record","created_at":"2026-05-18T02:47:22Z","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":"0330cba46af0913252eabdcae42710ec28974eea8dc4a665de371c036e9ad457","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-18T18:23:39Z","title_canon_sha256":"ecb6675f098f5522d0295f075e7f2977c58cd30c0c67765762378fad6d0fa369"},"schema_version":"1.0","source":{"id":"1407.5075","kind":"arxiv","version":1}},"canonical_sha256":"fe7ca05535c8aaeb89b8cb8b73ff03d4842a1322de2f942a59b84cdde8dea59b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe7ca05535c8aaeb89b8cb8b73ff03d4842a1322de2f942a59b84cdde8dea59b","first_computed_at":"2026-05-18T02:47:22.033756Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:22.033756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SQuoFfkhHd2bMYkJIOwyzcMTALrgU9E5DSoU7ccnZGat3JcE+nGv13tvO2gLDv9pjAc8YXbanDp+RBHrpMVOAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:22.034436Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.5075","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3de52792e3306741e9d29805b3ea15c5b0b8a5771200c381e13d916911e9b003","sha256:b06f1cf2e426709f66667962287669264aa87bcfc22dd5032c8187e5ec9dda53"],"state_sha256":"1e754dfdd88d3d141be1517cfde88499871c263c73a408cebf21bc9fb98d9542"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DV2BHtzjkooSD1EYoDLv0bsKxkitJJpBXyBZnZDmzjzoue9q/Tv5y+VZAmFnvbvgHN9Ki3vhurrPTSvGt5LKBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:47:13.336988Z","bundle_sha256":"47f35fc5f5ce0435f567d8c2b61ddcef1e692ea61626500260096632b3423c53"}}