{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GOO23VYDP4WV6QYNPJN2EEZLJN","short_pith_number":"pith:GOO23VYD","schema_version":"1.0","canonical_sha256":"339dadd7037f2d5f430d7a5ba2132b4b713e9ba926b17f907928e87dec14eff8","source":{"kind":"arxiv","id":"1506.03865","version":1},"attestation_state":"computed","paper":{"title":"Counterexample for the 2-approximation of finding partitions of rectilinear polygons with minimum stabbing number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Breno Piva, Cid C. de Souza","submitted_at":"2015-06-11T22:55:07Z","abstract_excerpt":"This paper presents a counterexample for the approximation algorithm proposed by Durocher and Mehrabi [1] for the general problem of finding a rectangular partition of a rectilinear polygon with minimum stabbing number."},"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":"1506.03865","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-06-11T22:55:07Z","cross_cats_sorted":[],"title_canon_sha256":"b77d2d58116bf1dfa367a5d8e6fafce86485aac5782804551eab49c4ce5d2fad","abstract_canon_sha256":"934d1718cf3bc88852e82500497f8dc26dbf14bda57f496c11970bd5c773b9cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:51:49.034922Z","signature_b64":"XmOSTWx0fQbe0q4y9qeeERxpl1Vmj1XlXFrYnbrsP06B0a384m0h1z5cH/HSlzgO7tbvaHErnodpsGr5v9PQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"339dadd7037f2d5f430d7a5ba2132b4b713e9ba926b17f907928e87dec14eff8","last_reissued_at":"2026-05-18T01:51:49.034441Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:51:49.034441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counterexample for the 2-approximation of finding partitions of rectilinear polygons with minimum stabbing number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Breno Piva, Cid C. de Souza","submitted_at":"2015-06-11T22:55:07Z","abstract_excerpt":"This paper presents a counterexample for the approximation algorithm proposed by Durocher and Mehrabi [1] for the general problem of finding a rectangular partition of a rectilinear polygon with minimum stabbing number."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03865","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":"1506.03865","created_at":"2026-05-18T01:51:49.034525+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.03865v1","created_at":"2026-05-18T01:51:49.034525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03865","created_at":"2026-05-18T01:51:49.034525+00:00"},{"alias_kind":"pith_short_12","alias_value":"GOO23VYDP4WV","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GOO23VYDP4WV6QYN","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GOO23VYD","created_at":"2026-05-18T12:29:22.688609+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/GOO23VYDP4WV6QYNPJN2EEZLJN","json":"https://pith.science/pith/GOO23VYDP4WV6QYNPJN2EEZLJN.json","graph_json":"https://pith.science/api/pith-number/GOO23VYDP4WV6QYNPJN2EEZLJN/graph.json","events_json":"https://pith.science/api/pith-number/GOO23VYDP4WV6QYNPJN2EEZLJN/events.json","paper":"https://pith.science/paper/GOO23VYD"},"agent_actions":{"view_html":"https://pith.science/pith/GOO23VYDP4WV6QYNPJN2EEZLJN","download_json":"https://pith.science/pith/GOO23VYDP4WV6QYNPJN2EEZLJN.json","view_paper":"https://pith.science/paper/GOO23VYD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.03865&json=true","fetch_graph":"https://pith.science/api/pith-number/GOO23VYDP4WV6QYNPJN2EEZLJN/graph.json","fetch_events":"https://pith.science/api/pith-number/GOO23VYDP4WV6QYNPJN2EEZLJN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GOO23VYDP4WV6QYNPJN2EEZLJN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GOO23VYDP4WV6QYNPJN2EEZLJN/action/storage_attestation","attest_author":"https://pith.science/pith/GOO23VYDP4WV6QYNPJN2EEZLJN/action/author_attestation","sign_citation":"https://pith.science/pith/GOO23VYDP4WV6QYNPJN2EEZLJN/action/citation_signature","submit_replication":"https://pith.science/pith/GOO23VYDP4WV6QYNPJN2EEZLJN/action/replication_record"}},"created_at":"2026-05-18T01:51:49.034525+00:00","updated_at":"2026-05-18T01:51:49.034525+00:00"}