{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:WMMOBVRX62L3EICK2DPJIBMHLB","short_pith_number":"pith:WMMOBVRX","canonical_record":{"source":{"id":"2404.02369","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-03T00:02:23Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"791a20f00d6fbc7d0f5f025002e2065e1b85b3a6b562c6c95b9e2fa4891e7b62","abstract_canon_sha256":"3352fc9fad676e620584a2ab3e3a2c81864a9f34e1889ce20e9b2196213d102b"},"schema_version":"1.0"},"canonical_sha256":"b318e0d637f697b2204ad0de94058758624768cf1bcb762cda0d7426e8c18e77","source":{"kind":"arxiv","id":"2404.02369","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.02369","created_at":"2026-07-05T08:32:12Z"},{"alias_kind":"arxiv_version","alias_value":"2404.02369v2","created_at":"2026-07-05T08:32:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.02369","created_at":"2026-07-05T08:32:12Z"},{"alias_kind":"pith_short_12","alias_value":"WMMOBVRX62L3","created_at":"2026-07-05T08:32:12Z"},{"alias_kind":"pith_short_16","alias_value":"WMMOBVRX62L3EICK","created_at":"2026-07-05T08:32:12Z"},{"alias_kind":"pith_short_8","alias_value":"WMMOBVRX","created_at":"2026-07-05T08:32:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:WMMOBVRX62L3EICK2DPJIBMHLB","target":"record","payload":{"canonical_record":{"source":{"id":"2404.02369","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-03T00:02:23Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"791a20f00d6fbc7d0f5f025002e2065e1b85b3a6b562c6c95b9e2fa4891e7b62","abstract_canon_sha256":"3352fc9fad676e620584a2ab3e3a2c81864a9f34e1889ce20e9b2196213d102b"},"schema_version":"1.0"},"canonical_sha256":"b318e0d637f697b2204ad0de94058758624768cf1bcb762cda0d7426e8c18e77","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:32:12.407643Z","signature_b64":"vBJJkYDuk4RsQHB1WsdgNyG6UwBTvrnU5NP1hC9EVk6t2z4nVXyZCAVlJ2NrbtNWaXm2skqucDO/s+UDA1KQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b318e0d637f697b2204ad0de94058758624768cf1bcb762cda0d7426e8c18e77","last_reissued_at":"2026-07-05T08:32:12.407147Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:32:12.407147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.02369","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-07-05T08:32:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LZLYzsmDoCSi1nIEug9Zx05+OCOxfyKZ8ZmzMm0Vhttn9JEJUHiW00kNjUkX9j6TVPsSofLem+t08L2IU95oBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:20:32.241522Z"},"content_sha256":"a373d2945550d5edc7adf5ff6cc6e5e1606535f400ab43d2c50662a1dc4f1db6","schema_version":"1.0","event_id":"sha256:a373d2945550d5edc7adf5ff6cc6e5e1606535f400ab43d2c50662a1dc4f1db6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:WMMOBVRX62L3EICK2DPJIBMHLB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Grid-drawings of graphs in three-dimensions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ethan Patrick White, Jozsef Balogh","submitted_at":"2024-04-03T00:02:23Z","abstract_excerpt":"Using probabilistic methods, we obtain grid-drawings of graphs without crossings with low volume and small aspect ratio. We show that every $D$-degenerate graph on $n$ vertices can be drawn in $[m]^3$ where $m^3 = O(D^2 n\\log n)$. In particular, every graph of bounded maximum degree can be drawn in a grid with volume $O(n \\log n)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.02369","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.02369/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:32:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R2ulI6gZKRPNS/tDPuBB29L4zkO8wTJTSk72rAkJq1yzeyZEm9HcmUkXn/ZCrmrAOmqFA/JwV6n0jwqMg6u9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T17:20:32.241891Z"},"content_sha256":"e165b7728637766fc24b48e6aed56602eb39e625599f4ec2a46b1b3495221ab2","schema_version":"1.0","event_id":"sha256:e165b7728637766fc24b48e6aed56602eb39e625599f4ec2a46b1b3495221ab2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WMMOBVRX62L3EICK2DPJIBMHLB/bundle.json","state_url":"https://pith.science/pith/WMMOBVRX62L3EICK2DPJIBMHLB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WMMOBVRX62L3EICK2DPJIBMHLB/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-07-06T17:20:32Z","links":{"resolver":"https://pith.science/pith/WMMOBVRX62L3EICK2DPJIBMHLB","bundle":"https://pith.science/pith/WMMOBVRX62L3EICK2DPJIBMHLB/bundle.json","state":"https://pith.science/pith/WMMOBVRX62L3EICK2DPJIBMHLB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WMMOBVRX62L3EICK2DPJIBMHLB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WMMOBVRX62L3EICK2DPJIBMHLB","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":"3352fc9fad676e620584a2ab3e3a2c81864a9f34e1889ce20e9b2196213d102b","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-03T00:02:23Z","title_canon_sha256":"791a20f00d6fbc7d0f5f025002e2065e1b85b3a6b562c6c95b9e2fa4891e7b62"},"schema_version":"1.0","source":{"id":"2404.02369","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.02369","created_at":"2026-07-05T08:32:12Z"},{"alias_kind":"arxiv_version","alias_value":"2404.02369v2","created_at":"2026-07-05T08:32:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.02369","created_at":"2026-07-05T08:32:12Z"},{"alias_kind":"pith_short_12","alias_value":"WMMOBVRX62L3","created_at":"2026-07-05T08:32:12Z"},{"alias_kind":"pith_short_16","alias_value":"WMMOBVRX62L3EICK","created_at":"2026-07-05T08:32:12Z"},{"alias_kind":"pith_short_8","alias_value":"WMMOBVRX","created_at":"2026-07-05T08:32:12Z"}],"graph_snapshots":[{"event_id":"sha256:e165b7728637766fc24b48e6aed56602eb39e625599f4ec2a46b1b3495221ab2","target":"graph","created_at":"2026-07-05T08:32:12Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2404.02369/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Using probabilistic methods, we obtain grid-drawings of graphs without crossings with low volume and small aspect ratio. We show that every $D$-degenerate graph on $n$ vertices can be drawn in $[m]^3$ where $m^3 = O(D^2 n\\log n)$. In particular, every graph of bounded maximum degree can be drawn in a grid with volume $O(n \\log n)$.","authors_text":"Ethan Patrick White, Jozsef Balogh","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-03T00:02:23Z","title":"Grid-drawings of graphs in three-dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.02369","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:a373d2945550d5edc7adf5ff6cc6e5e1606535f400ab43d2c50662a1dc4f1db6","target":"record","created_at":"2026-07-05T08:32:12Z","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":"3352fc9fad676e620584a2ab3e3a2c81864a9f34e1889ce20e9b2196213d102b","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-03T00:02:23Z","title_canon_sha256":"791a20f00d6fbc7d0f5f025002e2065e1b85b3a6b562c6c95b9e2fa4891e7b62"},"schema_version":"1.0","source":{"id":"2404.02369","kind":"arxiv","version":2}},"canonical_sha256":"b318e0d637f697b2204ad0de94058758624768cf1bcb762cda0d7426e8c18e77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b318e0d637f697b2204ad0de94058758624768cf1bcb762cda0d7426e8c18e77","first_computed_at":"2026-07-05T08:32:12.407147Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:32:12.407147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vBJJkYDuk4RsQHB1WsdgNyG6UwBTvrnU5NP1hC9EVk6t2z4nVXyZCAVlJ2NrbtNWaXm2skqucDO/s+UDA1KQAg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:32:12.407643Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.02369","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a373d2945550d5edc7adf5ff6cc6e5e1606535f400ab43d2c50662a1dc4f1db6","sha256:e165b7728637766fc24b48e6aed56602eb39e625599f4ec2a46b1b3495221ab2"],"state_sha256":"add1ef3d7550633c6a1af8e4ca74a77bacac0d68889cd5a8075dcd525eff176d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8f8jrYqCJaPZgo/HT5ULpnajYSU8z2nRc9hzqi0TH7QS3cyvrJtHsBhOEF9Dxp7BcH2nn+Oo+MlFguGbaS0OBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T17:20:32.243865Z","bundle_sha256":"076aa636c637d2e64a67a4c838ed18d760afd7acf8cbf3ea92d2bd8d2e0a3362"}}