{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:V7LFRPGHBQQYH5EWLV6BDMDWGK","short_pith_number":"pith:V7LFRPGH","schema_version":"1.0","canonical_sha256":"afd658bcc70c2183f4965d7c11b07632a3020f5324cc53211b288e4e661acdad","source":{"kind":"arxiv","id":"1004.0744","version":1},"attestation_state":"computed","paper":{"title":"Patrolling a Street Network is Strongly NP-Complete but in P for Tree Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS","math.CO"],"primary_cat":"cs.CG","authors_text":"Valentin E. Brimkov","submitted_at":"2010-04-06T01:06:27Z","abstract_excerpt":"We consider the following problem: Given a finite set of straight line segments in the plane, determine the positions of a minimal number of points on the segments, from which guards can see all segments. This problem can be interpreted as looking for a minimal number of locations of policemen, guards, cameras or other sensors, that can observe a network of streets, corridors, tunnels, tubes, etc. We show that the problem is strongly NP-complete even for a set of segments with a cubic graph structure, but in P for tree structures."},"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":"1004.0744","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-04-06T01:06:27Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS","math.CO"],"title_canon_sha256":"b02ea44093fd8cd86a9c55d990a25fe6460dc7714057e5a6c764355fb3f938e7","abstract_canon_sha256":"31080cb29a9a1cf7a1c32f413eefacef32a871313feece23b3245229f982c3d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:17.501457Z","signature_b64":"QV3KBdFLJtDVwPty/txf9dB+4JZb+uijqgo7Sdmf1HExQocCkYJFw9/1J8i1bAcuHroQhDvE7IWXRLh9qqQdDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afd658bcc70c2183f4965d7c11b07632a3020f5324cc53211b288e4e661acdad","last_reissued_at":"2026-05-18T02:24:17.500779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:17.500779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Patrolling a Street Network is Strongly NP-Complete but in P for Tree Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS","math.CO"],"primary_cat":"cs.CG","authors_text":"Valentin E. Brimkov","submitted_at":"2010-04-06T01:06:27Z","abstract_excerpt":"We consider the following problem: Given a finite set of straight line segments in the plane, determine the positions of a minimal number of points on the segments, from which guards can see all segments. This problem can be interpreted as looking for a minimal number of locations of policemen, guards, cameras or other sensors, that can observe a network of streets, corridors, tunnels, tubes, etc. We show that the problem is strongly NP-complete even for a set of segments with a cubic graph structure, but in P for tree structures."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.0744","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":"1004.0744","created_at":"2026-05-18T02:24:17.500881+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.0744v1","created_at":"2026-05-18T02:24:17.500881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.0744","created_at":"2026-05-18T02:24:17.500881+00:00"},{"alias_kind":"pith_short_12","alias_value":"V7LFRPGHBQQY","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"V7LFRPGHBQQYH5EW","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"V7LFRPGH","created_at":"2026-05-18T12:26:15.391820+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/V7LFRPGHBQQYH5EWLV6BDMDWGK","json":"https://pith.science/pith/V7LFRPGHBQQYH5EWLV6BDMDWGK.json","graph_json":"https://pith.science/api/pith-number/V7LFRPGHBQQYH5EWLV6BDMDWGK/graph.json","events_json":"https://pith.science/api/pith-number/V7LFRPGHBQQYH5EWLV6BDMDWGK/events.json","paper":"https://pith.science/paper/V7LFRPGH"},"agent_actions":{"view_html":"https://pith.science/pith/V7LFRPGHBQQYH5EWLV6BDMDWGK","download_json":"https://pith.science/pith/V7LFRPGHBQQYH5EWLV6BDMDWGK.json","view_paper":"https://pith.science/paper/V7LFRPGH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.0744&json=true","fetch_graph":"https://pith.science/api/pith-number/V7LFRPGHBQQYH5EWLV6BDMDWGK/graph.json","fetch_events":"https://pith.science/api/pith-number/V7LFRPGHBQQYH5EWLV6BDMDWGK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V7LFRPGHBQQYH5EWLV6BDMDWGK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V7LFRPGHBQQYH5EWLV6BDMDWGK/action/storage_attestation","attest_author":"https://pith.science/pith/V7LFRPGHBQQYH5EWLV6BDMDWGK/action/author_attestation","sign_citation":"https://pith.science/pith/V7LFRPGHBQQYH5EWLV6BDMDWGK/action/citation_signature","submit_replication":"https://pith.science/pith/V7LFRPGHBQQYH5EWLV6BDMDWGK/action/replication_record"}},"created_at":"2026-05-18T02:24:17.500881+00:00","updated_at":"2026-05-18T02:24:17.500881+00:00"}