{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JMENGC65DQ4LVTKNG6KJSN3367","short_pith_number":"pith:JMENGC65","schema_version":"1.0","canonical_sha256":"4b08d30bdd1c38bacd4d379499377bf7eb46a451fa885ef369e5f14edc9ca6a2","source":{"kind":"arxiv","id":"1512.01699","version":1},"attestation_state":"computed","paper":{"title":"A Note on Approximating 2-Transmitters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Abbas Mehrabi, Saeed Mehrabi","submitted_at":"2015-12-05T20:36:01Z","abstract_excerpt":"A k-transmitter in a simple orthogonal polygon P is a mobile guard that travels back and forth along an orthogonal line segment s inside P. The k-transmitter can see a point p in P if there exists a point q on s such that the line segment pq is normal to s and pq intersects the boundary of P in at most k points. In this paper, we give a 2-approximation algorithm for the problem of guarding a monotone orthogonal polygon with the minimum number of 2-transmitters."},"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":"1512.01699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-05T20:36:01Z","cross_cats_sorted":[],"title_canon_sha256":"bdbe1d8fed80c231cda6a9a99dbdc95986b222537345e50dcfbd1d9ca64008ce","abstract_canon_sha256":"cb80227aadb320c3452fde06494e56ce50eae55c7c8a8c3daef31343632562cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:10.600865Z","signature_b64":"AjIJoE8LMsRglB/iqLqVhzIU8EsYaPWwJpPS4mervLvDqmlx7l3d3UUpJKknX8OcG/eTrtVzJPKohuxUq74ZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b08d30bdd1c38bacd4d379499377bf7eb46a451fa885ef369e5f14edc9ca6a2","last_reissued_at":"2026-05-18T01:25:10.600177Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:10.600177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on Approximating 2-Transmitters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Abbas Mehrabi, Saeed Mehrabi","submitted_at":"2015-12-05T20:36:01Z","abstract_excerpt":"A k-transmitter in a simple orthogonal polygon P is a mobile guard that travels back and forth along an orthogonal line segment s inside P. The k-transmitter can see a point p in P if there exists a point q on s such that the line segment pq is normal to s and pq intersects the boundary of P in at most k points. In this paper, we give a 2-approximation algorithm for the problem of guarding a monotone orthogonal polygon with the minimum number of 2-transmitters."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01699","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":"1512.01699","created_at":"2026-05-18T01:25:10.600285+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.01699v1","created_at":"2026-05-18T01:25:10.600285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01699","created_at":"2026-05-18T01:25:10.600285+00:00"},{"alias_kind":"pith_short_12","alias_value":"JMENGC65DQ4L","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JMENGC65DQ4LVTKN","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JMENGC65","created_at":"2026-05-18T12:29:27.538025+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/JMENGC65DQ4LVTKNG6KJSN3367","json":"https://pith.science/pith/JMENGC65DQ4LVTKNG6KJSN3367.json","graph_json":"https://pith.science/api/pith-number/JMENGC65DQ4LVTKNG6KJSN3367/graph.json","events_json":"https://pith.science/api/pith-number/JMENGC65DQ4LVTKNG6KJSN3367/events.json","paper":"https://pith.science/paper/JMENGC65"},"agent_actions":{"view_html":"https://pith.science/pith/JMENGC65DQ4LVTKNG6KJSN3367","download_json":"https://pith.science/pith/JMENGC65DQ4LVTKNG6KJSN3367.json","view_paper":"https://pith.science/paper/JMENGC65","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.01699&json=true","fetch_graph":"https://pith.science/api/pith-number/JMENGC65DQ4LVTKNG6KJSN3367/graph.json","fetch_events":"https://pith.science/api/pith-number/JMENGC65DQ4LVTKNG6KJSN3367/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JMENGC65DQ4LVTKNG6KJSN3367/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JMENGC65DQ4LVTKNG6KJSN3367/action/storage_attestation","attest_author":"https://pith.science/pith/JMENGC65DQ4LVTKNG6KJSN3367/action/author_attestation","sign_citation":"https://pith.science/pith/JMENGC65DQ4LVTKNG6KJSN3367/action/citation_signature","submit_replication":"https://pith.science/pith/JMENGC65DQ4LVTKNG6KJSN3367/action/replication_record"}},"created_at":"2026-05-18T01:25:10.600285+00:00","updated_at":"2026-05-18T01:25:10.600285+00:00"}