{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NNFT7OJJTJWLM57JCGC46M6JVQ","short_pith_number":"pith:NNFT7OJJ","schema_version":"1.0","canonical_sha256":"6b4b3fb9299a6cb677e91185cf33c9ac1326ae4916ecdd0088bc05211a7aa308","source":{"kind":"arxiv","id":"1303.5958","version":1},"attestation_state":"computed","paper":{"title":"A Faster Algorithm for Computing Motorcycle Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Antoine Vigneron, Lie Yan","submitted_at":"2013-03-24T15:12:27Z","abstract_excerpt":"We present a new algorithm for computing motorcycle graphs that runs in O(n^(4/3+e)) time for any e>0, improving on all previously known algorithms. The main application of this result is to computing the straight skeleton of a polygon. It allows us to compute the straight skeleton of a non-degenerate polygon with h holes in O(n.sqrt(h+1)log^2(n)+n^(4/3+e)) expected time. If all input coordinates are O(log n)-bit rational numbers, we can compute the straight skeleton of a (possibly degenerate) polygon with h holes in O(n.sqrt(h+1)log^3(n)) expected time.\n  In particular, it means that we can c"},"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":"1303.5958","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-03-24T15:12:27Z","cross_cats_sorted":[],"title_canon_sha256":"2be4b0aaebac2a3ae4c2733f2d3fcc4207be14c227f33f4eb9ba13fc75628d8d","abstract_canon_sha256":"ffc025087c6a66ba9eab090935c9116ea7e23be21012cfe3970e539f9cc636c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:52.386615Z","signature_b64":"BFW/hU6pKqJ0YPcGZnLauqKL0xjulbcJPAgiax+ruGRqpaz6Gpi+/MqbT6J2FHh1XIOry+ns0VdoP8EuDKFrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b4b3fb9299a6cb677e91185cf33c9ac1326ae4916ecdd0088bc05211a7aa308","last_reissued_at":"2026-05-18T03:29:52.386080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:52.386080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Faster Algorithm for Computing Motorcycle Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Antoine Vigneron, Lie Yan","submitted_at":"2013-03-24T15:12:27Z","abstract_excerpt":"We present a new algorithm for computing motorcycle graphs that runs in O(n^(4/3+e)) time for any e>0, improving on all previously known algorithms. The main application of this result is to computing the straight skeleton of a polygon. It allows us to compute the straight skeleton of a non-degenerate polygon with h holes in O(n.sqrt(h+1)log^2(n)+n^(4/3+e)) expected time. If all input coordinates are O(log n)-bit rational numbers, we can compute the straight skeleton of a (possibly degenerate) polygon with h holes in O(n.sqrt(h+1)log^3(n)) expected time.\n  In particular, it means that we can c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5958","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":"1303.5958","created_at":"2026-05-18T03:29:52.386155+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.5958v1","created_at":"2026-05-18T03:29:52.386155+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5958","created_at":"2026-05-18T03:29:52.386155+00:00"},{"alias_kind":"pith_short_12","alias_value":"NNFT7OJJTJWL","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NNFT7OJJTJWLM57J","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NNFT7OJJ","created_at":"2026-05-18T12:27:52.871228+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/NNFT7OJJTJWLM57JCGC46M6JVQ","json":"https://pith.science/pith/NNFT7OJJTJWLM57JCGC46M6JVQ.json","graph_json":"https://pith.science/api/pith-number/NNFT7OJJTJWLM57JCGC46M6JVQ/graph.json","events_json":"https://pith.science/api/pith-number/NNFT7OJJTJWLM57JCGC46M6JVQ/events.json","paper":"https://pith.science/paper/NNFT7OJJ"},"agent_actions":{"view_html":"https://pith.science/pith/NNFT7OJJTJWLM57JCGC46M6JVQ","download_json":"https://pith.science/pith/NNFT7OJJTJWLM57JCGC46M6JVQ.json","view_paper":"https://pith.science/paper/NNFT7OJJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.5958&json=true","fetch_graph":"https://pith.science/api/pith-number/NNFT7OJJTJWLM57JCGC46M6JVQ/graph.json","fetch_events":"https://pith.science/api/pith-number/NNFT7OJJTJWLM57JCGC46M6JVQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NNFT7OJJTJWLM57JCGC46M6JVQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NNFT7OJJTJWLM57JCGC46M6JVQ/action/storage_attestation","attest_author":"https://pith.science/pith/NNFT7OJJTJWLM57JCGC46M6JVQ/action/author_attestation","sign_citation":"https://pith.science/pith/NNFT7OJJTJWLM57JCGC46M6JVQ/action/citation_signature","submit_replication":"https://pith.science/pith/NNFT7OJJTJWLM57JCGC46M6JVQ/action/replication_record"}},"created_at":"2026-05-18T03:29:52.386155+00:00","updated_at":"2026-05-18T03:29:52.386155+00:00"}