{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:4RIAAT7VFDSNCCWSURF7P7EHYR","short_pith_number":"pith:4RIAAT7V","schema_version":"1.0","canonical_sha256":"e450004ff528e4d10ad2a44bf7fc87c442c249d2d4f629b908feeebbb4a1dad4","source":{"kind":"arxiv","id":"0707.2921","version":1},"attestation_state":"computed","paper":{"title":"Covering a line segment with variable radius discs","license":"","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DM","authors_text":"Alessandro Agnetis, Andrea Pacifici, Enrico Grande, Pitu B. Mirchandani","submitted_at":"2007-07-19T14:59:47Z","abstract_excerpt":"The paper addresses the problem of locating sensors with a circular field of view so that a given line segment is under full surveillance, which is termed as the Disc Covering Problem on a Line. The cost of each sensor includes a fixed component, and a variable component that is proportional to the field-of-view area. When only one type of sensor or, in general, one type of disc, is available, then a simple polynomial algorithm solves the problem. When there are different types of sensors in terms of fixed and variable costs, the problem becomes NP-hard. A branch-and-bound algorithm as well as"},"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":"0707.2921","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DM","submitted_at":"2007-07-19T14:59:47Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"9d76733f58f93110e82053c3ca477f708c64601493667c30fe41f170ca345f7a","abstract_canon_sha256":"819313c4fad2cbe0d3e77f92385578222d8c602ede042efdf2cd145b36e53979"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T22:06:01.605037Z","signature_b64":"7G7Yf03JAcKVOlxFrvM8UAMLdAn+WwCR6JPUCdEws3B3hi0bcT3lNtI5ry7WGyHuO6/iVq95LXT40NsNwmraBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e450004ff528e4d10ad2a44bf7fc87c442c249d2d4f629b908feeebbb4a1dad4","last_reissued_at":"2026-06-03T22:06:01.604580Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T22:06:01.604580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering a line segment with variable radius discs","license":"","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DM","authors_text":"Alessandro Agnetis, Andrea Pacifici, Enrico Grande, Pitu B. Mirchandani","submitted_at":"2007-07-19T14:59:47Z","abstract_excerpt":"The paper addresses the problem of locating sensors with a circular field of view so that a given line segment is under full surveillance, which is termed as the Disc Covering Problem on a Line. The cost of each sensor includes a fixed component, and a variable component that is proportional to the field-of-view area. When only one type of sensor or, in general, one type of disc, is available, then a simple polynomial algorithm solves the problem. When there are different types of sensors in terms of fixed and variable costs, the problem becomes NP-hard. A branch-and-bound algorithm as well as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.2921","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0707.2921/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"0707.2921","created_at":"2026-06-03T22:06:01.604639+00:00"},{"alias_kind":"arxiv_version","alias_value":"0707.2921v1","created_at":"2026-06-03T22:06:01.604639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.2921","created_at":"2026-06-03T22:06:01.604639+00:00"},{"alias_kind":"pith_short_12","alias_value":"4RIAAT7VFDSN","created_at":"2026-06-03T22:06:01.604639+00:00"},{"alias_kind":"pith_short_16","alias_value":"4RIAAT7VFDSNCCWS","created_at":"2026-06-03T22:06:01.604639+00:00"},{"alias_kind":"pith_short_8","alias_value":"4RIAAT7V","created_at":"2026-06-03T22:06:01.604639+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/4RIAAT7VFDSNCCWSURF7P7EHYR","json":"https://pith.science/pith/4RIAAT7VFDSNCCWSURF7P7EHYR.json","graph_json":"https://pith.science/api/pith-number/4RIAAT7VFDSNCCWSURF7P7EHYR/graph.json","events_json":"https://pith.science/api/pith-number/4RIAAT7VFDSNCCWSURF7P7EHYR/events.json","paper":"https://pith.science/paper/4RIAAT7V"},"agent_actions":{"view_html":"https://pith.science/pith/4RIAAT7VFDSNCCWSURF7P7EHYR","download_json":"https://pith.science/pith/4RIAAT7VFDSNCCWSURF7P7EHYR.json","view_paper":"https://pith.science/paper/4RIAAT7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0707.2921&json=true","fetch_graph":"https://pith.science/api/pith-number/4RIAAT7VFDSNCCWSURF7P7EHYR/graph.json","fetch_events":"https://pith.science/api/pith-number/4RIAAT7VFDSNCCWSURF7P7EHYR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4RIAAT7VFDSNCCWSURF7P7EHYR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4RIAAT7VFDSNCCWSURF7P7EHYR/action/storage_attestation","attest_author":"https://pith.science/pith/4RIAAT7VFDSNCCWSURF7P7EHYR/action/author_attestation","sign_citation":"https://pith.science/pith/4RIAAT7VFDSNCCWSURF7P7EHYR/action/citation_signature","submit_replication":"https://pith.science/pith/4RIAAT7VFDSNCCWSURF7P7EHYR/action/replication_record"}},"created_at":"2026-06-03T22:06:01.604639+00:00","updated_at":"2026-06-03T22:06:01.604639+00:00"}