{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:IQ5EXGEYHOTYALVL63VRXXW3GQ","short_pith_number":"pith:IQ5EXGEY","schema_version":"1.0","canonical_sha256":"443a4b98983ba7802eabf6eb1bdedb3401825995cf8ff0bc13df9fc9bb61da8c","source":{"kind":"arxiv","id":"1009.0045","version":1},"attestation_state":"computed","paper":{"title":"Optimal 3D Angular Resolution for Low-Degree Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"David Eppstein, Elena Mumford, Maarten L\\\"offler, Martin N\\\"ollenburg","submitted_at":"2010-08-31T22:50:32Z","abstract_excerpt":"We show that every graph of maximum degree three can be drawn in three dimensions with at most two bends per edge, and with 120-degree angles between any two edge segments meeting at a vertex or a bend. We show that every graph of maximum degree four can be drawn in three dimensions with at most three bends per edge, and with 109.5-degree angles, i.e., the angular resolution of the diamond lattice, between any two edge segments meeting at a vertex or bend."},"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":"1009.0045","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-08-31T22:50:32Z","cross_cats_sorted":[],"title_canon_sha256":"7e9e1d04efe15d1a79ed1ac4b042b5d69681809b7f281dd4021a686eecebe899","abstract_canon_sha256":"155fa9bc069ad428c8330c807f33f77524f5176f1f41b5ca6243e385d9fc5132"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:52.019408Z","signature_b64":"c0XNjvnp0RzeUAvZGfsWWT3xoT/2PD50qAa+zrC1YjqmqLO2gkn/+lG6nU0P4DeW4uYciWox/mzOOSkqKjoBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"443a4b98983ba7802eabf6eb1bdedb3401825995cf8ff0bc13df9fc9bb61da8c","last_reissued_at":"2026-05-18T01:36:52.018730Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:52.018730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal 3D Angular Resolution for Low-Degree Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"David Eppstein, Elena Mumford, Maarten L\\\"offler, Martin N\\\"ollenburg","submitted_at":"2010-08-31T22:50:32Z","abstract_excerpt":"We show that every graph of maximum degree three can be drawn in three dimensions with at most two bends per edge, and with 120-degree angles between any two edge segments meeting at a vertex or a bend. We show that every graph of maximum degree four can be drawn in three dimensions with at most three bends per edge, and with 109.5-degree angles, i.e., the angular resolution of the diamond lattice, between any two edge segments meeting at a vertex or bend."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.0045","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":"1009.0045","created_at":"2026-05-18T01:36:52.018831+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.0045v1","created_at":"2026-05-18T01:36:52.018831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.0045","created_at":"2026-05-18T01:36:52.018831+00:00"},{"alias_kind":"pith_short_12","alias_value":"IQ5EXGEYHOTY","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"IQ5EXGEYHOTYALVL","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"IQ5EXGEY","created_at":"2026-05-18T12:26:09.077623+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/IQ5EXGEYHOTYALVL63VRXXW3GQ","json":"https://pith.science/pith/IQ5EXGEYHOTYALVL63VRXXW3GQ.json","graph_json":"https://pith.science/api/pith-number/IQ5EXGEYHOTYALVL63VRXXW3GQ/graph.json","events_json":"https://pith.science/api/pith-number/IQ5EXGEYHOTYALVL63VRXXW3GQ/events.json","paper":"https://pith.science/paper/IQ5EXGEY"},"agent_actions":{"view_html":"https://pith.science/pith/IQ5EXGEYHOTYALVL63VRXXW3GQ","download_json":"https://pith.science/pith/IQ5EXGEYHOTYALVL63VRXXW3GQ.json","view_paper":"https://pith.science/paper/IQ5EXGEY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.0045&json=true","fetch_graph":"https://pith.science/api/pith-number/IQ5EXGEYHOTYALVL63VRXXW3GQ/graph.json","fetch_events":"https://pith.science/api/pith-number/IQ5EXGEYHOTYALVL63VRXXW3GQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IQ5EXGEYHOTYALVL63VRXXW3GQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IQ5EXGEYHOTYALVL63VRXXW3GQ/action/storage_attestation","attest_author":"https://pith.science/pith/IQ5EXGEYHOTYALVL63VRXXW3GQ/action/author_attestation","sign_citation":"https://pith.science/pith/IQ5EXGEYHOTYALVL63VRXXW3GQ/action/citation_signature","submit_replication":"https://pith.science/pith/IQ5EXGEYHOTYALVL63VRXXW3GQ/action/replication_record"}},"created_at":"2026-05-18T01:36:52.018831+00:00","updated_at":"2026-05-18T01:36:52.018831+00:00"}