{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FXAVGUAUAZ3B7RFIS7XIGFO54N","short_pith_number":"pith:FXAVGUAU","schema_version":"1.0","canonical_sha256":"2dc153501406761fc4a897ee8315dde3528b67ca4356ff39b58eff0f7c561582","source":{"kind":"arxiv","id":"1404.3776","version":1},"attestation_state":"computed","paper":{"title":"Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Kasturi Varadarajan, Santanu Bhowmick, Sayan Bandyapadhyay","submitted_at":"2014-04-14T23:10:03Z","abstract_excerpt":"We revisit two NP-hard geometric partitioning problems - convex decomposition and surface approximation. Building on recent developments in geometric separators, we present quasi-polynomial time algorithms for these problems with improved approximation guarantees."},"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":"1404.3776","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-04-14T23:10:03Z","cross_cats_sorted":[],"title_canon_sha256":"ce265e8dd4207d890e7ece01c1f92112089b730a0955976ace3dba6165fafe94","abstract_canon_sha256":"14f7af4967830ef13107afcc68ca09af6a6ff280f30264b0dd8283f048e943e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:13.647366Z","signature_b64":"lLWwUxWiYZnSRJu5sfH3g6DOcaiSZ1GTRT+84MfsX3fji1CSCcKuujGpu/H5V0S+weBmyKJfu4q6cJovHdY/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dc153501406761fc4a897ee8315dde3528b67ca4356ff39b58eff0f7c561582","last_reissued_at":"2026-05-18T02:54:13.646855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:13.646855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Schemes for Partitioning: Convex Decomposition and Surface Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Kasturi Varadarajan, Santanu Bhowmick, Sayan Bandyapadhyay","submitted_at":"2014-04-14T23:10:03Z","abstract_excerpt":"We revisit two NP-hard geometric partitioning problems - convex decomposition and surface approximation. Building on recent developments in geometric separators, we present quasi-polynomial time algorithms for these problems with improved approximation guarantees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3776","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":"1404.3776","created_at":"2026-05-18T02:54:13.646959+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3776v1","created_at":"2026-05-18T02:54:13.646959+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3776","created_at":"2026-05-18T02:54:13.646959+00:00"},{"alias_kind":"pith_short_12","alias_value":"FXAVGUAUAZ3B","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FXAVGUAUAZ3B7RFI","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FXAVGUAU","created_at":"2026-05-18T12:28:28.263976+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/FXAVGUAUAZ3B7RFIS7XIGFO54N","json":"https://pith.science/pith/FXAVGUAUAZ3B7RFIS7XIGFO54N.json","graph_json":"https://pith.science/api/pith-number/FXAVGUAUAZ3B7RFIS7XIGFO54N/graph.json","events_json":"https://pith.science/api/pith-number/FXAVGUAUAZ3B7RFIS7XIGFO54N/events.json","paper":"https://pith.science/paper/FXAVGUAU"},"agent_actions":{"view_html":"https://pith.science/pith/FXAVGUAUAZ3B7RFIS7XIGFO54N","download_json":"https://pith.science/pith/FXAVGUAUAZ3B7RFIS7XIGFO54N.json","view_paper":"https://pith.science/paper/FXAVGUAU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3776&json=true","fetch_graph":"https://pith.science/api/pith-number/FXAVGUAUAZ3B7RFIS7XIGFO54N/graph.json","fetch_events":"https://pith.science/api/pith-number/FXAVGUAUAZ3B7RFIS7XIGFO54N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FXAVGUAUAZ3B7RFIS7XIGFO54N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FXAVGUAUAZ3B7RFIS7XIGFO54N/action/storage_attestation","attest_author":"https://pith.science/pith/FXAVGUAUAZ3B7RFIS7XIGFO54N/action/author_attestation","sign_citation":"https://pith.science/pith/FXAVGUAUAZ3B7RFIS7XIGFO54N/action/citation_signature","submit_replication":"https://pith.science/pith/FXAVGUAUAZ3B7RFIS7XIGFO54N/action/replication_record"}},"created_at":"2026-05-18T02:54:13.646959+00:00","updated_at":"2026-05-18T02:54:13.646959+00:00"}