{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WSPT4CISUTNSKXD3M5USIIMBET","short_pith_number":"pith:WSPT4CIS","schema_version":"1.0","canonical_sha256":"b49f3e0912a4db255c7b676924218124f1043c149818bd9d17b1b7916a34e213","source":{"kind":"arxiv","id":"1609.01662","version":1},"attestation_state":"computed","paper":{"title":"Robust Computation of a Minimum Area Convex Polygon Stabber of a Set of Isothetic Line Segments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Asish Mukhopadhyay, Bryan St. Amour, Xijie Zeng, Xin Wu","submitted_at":"2016-09-06T17:28:49Z","abstract_excerpt":"In this paper, we discuss the algorithm engineering aspects of an O(n^2)-time algorithm [6] for computing a minimum-area convex polygon that intersects a set of n isothetic line segments."},"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":"1609.01662","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-09-06T17:28:49Z","cross_cats_sorted":[],"title_canon_sha256":"14577b5af39f8d8078d0823add75e1b60f9ee343c8a697716a857b4ed4aaec08","abstract_canon_sha256":"71cd7f6d1264f33178471e862012ae89e90883673b71b70bf1c940733abd5d04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:39.018722Z","signature_b64":"7P3Y9FrmSA/1e8itSNGHTCHgPNx3IF5aH+znZodyq+DuIBc1S7ZuBPILBKegHs7MVXFX//3fuJ5gAJ1NhS1oCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b49f3e0912a4db255c7b676924218124f1043c149818bd9d17b1b7916a34e213","last_reissued_at":"2026-05-18T01:05:39.018293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:39.018293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Computation of a Minimum Area Convex Polygon Stabber of a Set of Isothetic Line Segments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Asish Mukhopadhyay, Bryan St. Amour, Xijie Zeng, Xin Wu","submitted_at":"2016-09-06T17:28:49Z","abstract_excerpt":"In this paper, we discuss the algorithm engineering aspects of an O(n^2)-time algorithm [6] for computing a minimum-area convex polygon that intersects a set of n isothetic line segments."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01662","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":"1609.01662","created_at":"2026-05-18T01:05:39.018370+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.01662v1","created_at":"2026-05-18T01:05:39.018370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01662","created_at":"2026-05-18T01:05:39.018370+00:00"},{"alias_kind":"pith_short_12","alias_value":"WSPT4CISUTNS","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"WSPT4CISUTNSKXD3","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"WSPT4CIS","created_at":"2026-05-18T12:30:51.357362+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/WSPT4CISUTNSKXD3M5USIIMBET","json":"https://pith.science/pith/WSPT4CISUTNSKXD3M5USIIMBET.json","graph_json":"https://pith.science/api/pith-number/WSPT4CISUTNSKXD3M5USIIMBET/graph.json","events_json":"https://pith.science/api/pith-number/WSPT4CISUTNSKXD3M5USIIMBET/events.json","paper":"https://pith.science/paper/WSPT4CIS"},"agent_actions":{"view_html":"https://pith.science/pith/WSPT4CISUTNSKXD3M5USIIMBET","download_json":"https://pith.science/pith/WSPT4CISUTNSKXD3M5USIIMBET.json","view_paper":"https://pith.science/paper/WSPT4CIS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.01662&json=true","fetch_graph":"https://pith.science/api/pith-number/WSPT4CISUTNSKXD3M5USIIMBET/graph.json","fetch_events":"https://pith.science/api/pith-number/WSPT4CISUTNSKXD3M5USIIMBET/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WSPT4CISUTNSKXD3M5USIIMBET/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WSPT4CISUTNSKXD3M5USIIMBET/action/storage_attestation","attest_author":"https://pith.science/pith/WSPT4CISUTNSKXD3M5USIIMBET/action/author_attestation","sign_citation":"https://pith.science/pith/WSPT4CISUTNSKXD3M5USIIMBET/action/citation_signature","submit_replication":"https://pith.science/pith/WSPT4CISUTNSKXD3M5USIIMBET/action/replication_record"}},"created_at":"2026-05-18T01:05:39.018370+00:00","updated_at":"2026-05-18T01:05:39.018370+00:00"}