{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FKDYVQR6VKIMBJBNGL5SN5ALYY","short_pith_number":"pith:FKDYVQR6","schema_version":"1.0","canonical_sha256":"2a878ac23eaa90c0a42d32fb26f40bc60f318b3154ff164ba170ffb5cad7c9ad","source":{"kind":"arxiv","id":"1704.04656","version":1},"attestation_state":"computed","paper":{"title":"Negative Cycle Separation in Wireless Network Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","cs.NI"],"primary_cat":"math.OC","authors_text":"Antonio Sassano, Carlo Mannino, Fabio D'Andreagiovanni","submitted_at":"2017-04-15T16:26:50Z","abstract_excerpt":"The Wireless Network Design Problem (WND) consists in choosing values of radio-electrical parameters of transmitters of a wireless network, to maximize network coverage. We present a pure 0-1 Linear Programming formulation for the WND that may contain an exponential number of constraints. Violated inequalities of this formulation are hard to separate both theoretically and in practice. However, a relevant subset of such inequalities can be separated more efficiently in practice and can be used to strengthen classical MILP formulations for the WND. Preliminary computational experience confirms "},"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":"1704.04656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-15T16:26:50Z","cross_cats_sorted":["cs.DM","cs.DS","cs.NI"],"title_canon_sha256":"e2dceebc436ad1cd0461ff40d31af9f0ef1861e58d67c6f4869d8742aece7e3c","abstract_canon_sha256":"ecfe64a4f0cfad720c0038755049073c69b9e8f5ff44236859c7149fc13c3b45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:18.001214Z","signature_b64":"CNHbOdl6BBnSV1JZb+1J+4Bx+SshhnZCfBKcr7UCxpbuwtKDOd3iAAKeW1ewG+hO7GWIXThiCPuT6/orAZjFBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a878ac23eaa90c0a42d32fb26f40bc60f318b3154ff164ba170ffb5cad7c9ad","last_reissued_at":"2026-05-18T00:46:18.000676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:18.000676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Negative Cycle Separation in Wireless Network Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","cs.NI"],"primary_cat":"math.OC","authors_text":"Antonio Sassano, Carlo Mannino, Fabio D'Andreagiovanni","submitted_at":"2017-04-15T16:26:50Z","abstract_excerpt":"The Wireless Network Design Problem (WND) consists in choosing values of radio-electrical parameters of transmitters of a wireless network, to maximize network coverage. We present a pure 0-1 Linear Programming formulation for the WND that may contain an exponential number of constraints. Violated inequalities of this formulation are hard to separate both theoretically and in practice. However, a relevant subset of such inequalities can be separated more efficiently in practice and can be used to strengthen classical MILP formulations for the WND. Preliminary computational experience confirms "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04656","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":"1704.04656","created_at":"2026-05-18T00:46:18.000775+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.04656v1","created_at":"2026-05-18T00:46:18.000775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04656","created_at":"2026-05-18T00:46:18.000775+00:00"},{"alias_kind":"pith_short_12","alias_value":"FKDYVQR6VKIM","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FKDYVQR6VKIMBJBN","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FKDYVQR6","created_at":"2026-05-18T12:31:15.632608+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/FKDYVQR6VKIMBJBNGL5SN5ALYY","json":"https://pith.science/pith/FKDYVQR6VKIMBJBNGL5SN5ALYY.json","graph_json":"https://pith.science/api/pith-number/FKDYVQR6VKIMBJBNGL5SN5ALYY/graph.json","events_json":"https://pith.science/api/pith-number/FKDYVQR6VKIMBJBNGL5SN5ALYY/events.json","paper":"https://pith.science/paper/FKDYVQR6"},"agent_actions":{"view_html":"https://pith.science/pith/FKDYVQR6VKIMBJBNGL5SN5ALYY","download_json":"https://pith.science/pith/FKDYVQR6VKIMBJBNGL5SN5ALYY.json","view_paper":"https://pith.science/paper/FKDYVQR6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.04656&json=true","fetch_graph":"https://pith.science/api/pith-number/FKDYVQR6VKIMBJBNGL5SN5ALYY/graph.json","fetch_events":"https://pith.science/api/pith-number/FKDYVQR6VKIMBJBNGL5SN5ALYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FKDYVQR6VKIMBJBNGL5SN5ALYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FKDYVQR6VKIMBJBNGL5SN5ALYY/action/storage_attestation","attest_author":"https://pith.science/pith/FKDYVQR6VKIMBJBNGL5SN5ALYY/action/author_attestation","sign_citation":"https://pith.science/pith/FKDYVQR6VKIMBJBNGL5SN5ALYY/action/citation_signature","submit_replication":"https://pith.science/pith/FKDYVQR6VKIMBJBNGL5SN5ALYY/action/replication_record"}},"created_at":"2026-05-18T00:46:18.000775+00:00","updated_at":"2026-05-18T00:46:18.000775+00:00"}