{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GD3H36AFSGKNT4B3H2OM42JDGT","short_pith_number":"pith:GD3H36AF","schema_version":"1.0","canonical_sha256":"30f67df8059194d9f03b3e9cce692334fb98b654c3acda91a1db8fd308a2c6a7","source":{"kind":"arxiv","id":"2407.15981","version":1},"attestation_state":"computed","paper":{"title":"Carving Polytopes with Saws in 3D","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Da Wei Zheng, Eliot W. Robson, Jack Spalding-Jamieson","submitted_at":"2024-07-22T18:45:53Z","abstract_excerpt":"We investigate the problem of carving an $n$-face triangulated three-dimensional polytope using a tool to make cuts modelled by either a half-plane or sweeps from an infinite ray. In the case of half-planes cuts, we present a deterministic algorithm running in $O(n^2)$ time and a randomized algorithm running in $O(n^{3/2+\\varepsilon})$ expected time for any $\\varepsilon>0$. In the case of cuts defined by sweeps of infinite rays, we present an algorithm running in $O(n^5)$ time."},"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":"2407.15981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-07-22T18:45:53Z","cross_cats_sorted":[],"title_canon_sha256":"65cf9fbb6822cf668a93617aaceca6e0342b2835be4b0895c49fd233f815c7c1","abstract_canon_sha256":"4bdcd7580d70c43c42c04c3b6bdf41ffcdb01ff8946299487fe58767a5e7193d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:47:25.187549Z","signature_b64":"bm1+8xA7ssW8vwAhNyaPj7niAyx+oSVfwaEOkVuRDaca2yZWUD8NLDtq1lIKGJVdmrBwf/4I/O+ZMCknvipfAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30f67df8059194d9f03b3e9cce692334fb98b654c3acda91a1db8fd308a2c6a7","last_reissued_at":"2026-07-05T08:47:25.187053Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:47:25.187053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Carving Polytopes with Saws in 3D","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Da Wei Zheng, Eliot W. Robson, Jack Spalding-Jamieson","submitted_at":"2024-07-22T18:45:53Z","abstract_excerpt":"We investigate the problem of carving an $n$-face triangulated three-dimensional polytope using a tool to make cuts modelled by either a half-plane or sweeps from an infinite ray. In the case of half-planes cuts, we present a deterministic algorithm running in $O(n^2)$ time and a randomized algorithm running in $O(n^{3/2+\\varepsilon})$ expected time for any $\\varepsilon>0$. In the case of cuts defined by sweeps of infinite rays, we present an algorithm running in $O(n^5)$ time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.15981","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.15981/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2407.15981","created_at":"2026-07-05T08:47:25.187112+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.15981v1","created_at":"2026-07-05T08:47:25.187112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.15981","created_at":"2026-07-05T08:47:25.187112+00:00"},{"alias_kind":"pith_short_12","alias_value":"GD3H36AFSGKN","created_at":"2026-07-05T08:47:25.187112+00:00"},{"alias_kind":"pith_short_16","alias_value":"GD3H36AFSGKNT4B3","created_at":"2026-07-05T08:47:25.187112+00:00"},{"alias_kind":"pith_short_8","alias_value":"GD3H36AF","created_at":"2026-07-05T08:47:25.187112+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/GD3H36AFSGKNT4B3H2OM42JDGT","json":"https://pith.science/pith/GD3H36AFSGKNT4B3H2OM42JDGT.json","graph_json":"https://pith.science/api/pith-number/GD3H36AFSGKNT4B3H2OM42JDGT/graph.json","events_json":"https://pith.science/api/pith-number/GD3H36AFSGKNT4B3H2OM42JDGT/events.json","paper":"https://pith.science/paper/GD3H36AF"},"agent_actions":{"view_html":"https://pith.science/pith/GD3H36AFSGKNT4B3H2OM42JDGT","download_json":"https://pith.science/pith/GD3H36AFSGKNT4B3H2OM42JDGT.json","view_paper":"https://pith.science/paper/GD3H36AF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.15981&json=true","fetch_graph":"https://pith.science/api/pith-number/GD3H36AFSGKNT4B3H2OM42JDGT/graph.json","fetch_events":"https://pith.science/api/pith-number/GD3H36AFSGKNT4B3H2OM42JDGT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GD3H36AFSGKNT4B3H2OM42JDGT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GD3H36AFSGKNT4B3H2OM42JDGT/action/storage_attestation","attest_author":"https://pith.science/pith/GD3H36AFSGKNT4B3H2OM42JDGT/action/author_attestation","sign_citation":"https://pith.science/pith/GD3H36AFSGKNT4B3H2OM42JDGT/action/citation_signature","submit_replication":"https://pith.science/pith/GD3H36AFSGKNT4B3H2OM42JDGT/action/replication_record"}},"created_at":"2026-07-05T08:47:25.187112+00:00","updated_at":"2026-07-05T08:47:25.187112+00:00"}