{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CHDBFJ4YEE27UR3VMRTTDJSMXS","short_pith_number":"pith:CHDBFJ4Y","schema_version":"1.0","canonical_sha256":"11c612a7982135fa4775646731a64cbca9a0b159829b7ca112fe7d1f9e9abf6a","source":{"kind":"arxiv","id":"1611.02918","version":1},"attestation_state":"computed","paper":{"title":"Minimum Spanning trees with Neighborhoods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Elena Fern\\'andez, Justo Puerto, V\\'ictor Blanco","submitted_at":"2016-11-09T13:21:34Z","abstract_excerpt":"This paper studies Minimum Spanning Trees under incomplete information for its vertices. We assume that no information is available on the precise placement of vertices so that it is only known that vertices belong to some neighborhoods that are second order cone representable and distances are measured with a $\\ell_q$-norm. Two mixed integer non linear mathematical programming formulations are presented, based on alternative representations of subtour elimination constraints. A solution scheme is also proposed, resulting from a reformulation suitable for a Benders-like decomposition, which is"},"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":"1611.02918","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-09T13:21:34Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"de63ec5515d1bd118ba2fad0f071f13a5cedab1aa92f116828554b14040798c5","abstract_canon_sha256":"99cd51ce64663fe60f31860587b0bfb86cf754a0999df0605c16fb297114100c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:43.168605Z","signature_b64":"CVyixm3H/ebziJgVMqmn2gC1GxYjjRIyeVjibJDM7/zeArwpq0l7dnm++jzJJJSw8Gs0/De1y/IrRpsUdYrSDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11c612a7982135fa4775646731a64cbca9a0b159829b7ca112fe7d1f9e9abf6a","last_reissued_at":"2026-05-18T00:59:43.167943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:43.167943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Spanning trees with Neighborhoods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Elena Fern\\'andez, Justo Puerto, V\\'ictor Blanco","submitted_at":"2016-11-09T13:21:34Z","abstract_excerpt":"This paper studies Minimum Spanning Trees under incomplete information for its vertices. We assume that no information is available on the precise placement of vertices so that it is only known that vertices belong to some neighborhoods that are second order cone representable and distances are measured with a $\\ell_q$-norm. Two mixed integer non linear mathematical programming formulations are presented, based on alternative representations of subtour elimination constraints. A solution scheme is also proposed, resulting from a reformulation suitable for a Benders-like decomposition, which is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02918","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":"1611.02918","created_at":"2026-05-18T00:59:43.168028+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.02918v1","created_at":"2026-05-18T00:59:43.168028+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02918","created_at":"2026-05-18T00:59:43.168028+00:00"},{"alias_kind":"pith_short_12","alias_value":"CHDBFJ4YEE27","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CHDBFJ4YEE27UR3V","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CHDBFJ4Y","created_at":"2026-05-18T12:30:09.641336+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/CHDBFJ4YEE27UR3VMRTTDJSMXS","json":"https://pith.science/pith/CHDBFJ4YEE27UR3VMRTTDJSMXS.json","graph_json":"https://pith.science/api/pith-number/CHDBFJ4YEE27UR3VMRTTDJSMXS/graph.json","events_json":"https://pith.science/api/pith-number/CHDBFJ4YEE27UR3VMRTTDJSMXS/events.json","paper":"https://pith.science/paper/CHDBFJ4Y"},"agent_actions":{"view_html":"https://pith.science/pith/CHDBFJ4YEE27UR3VMRTTDJSMXS","download_json":"https://pith.science/pith/CHDBFJ4YEE27UR3VMRTTDJSMXS.json","view_paper":"https://pith.science/paper/CHDBFJ4Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.02918&json=true","fetch_graph":"https://pith.science/api/pith-number/CHDBFJ4YEE27UR3VMRTTDJSMXS/graph.json","fetch_events":"https://pith.science/api/pith-number/CHDBFJ4YEE27UR3VMRTTDJSMXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CHDBFJ4YEE27UR3VMRTTDJSMXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CHDBFJ4YEE27UR3VMRTTDJSMXS/action/storage_attestation","attest_author":"https://pith.science/pith/CHDBFJ4YEE27UR3VMRTTDJSMXS/action/author_attestation","sign_citation":"https://pith.science/pith/CHDBFJ4YEE27UR3VMRTTDJSMXS/action/citation_signature","submit_replication":"https://pith.science/pith/CHDBFJ4YEE27UR3VMRTTDJSMXS/action/replication_record"}},"created_at":"2026-05-18T00:59:43.168028+00:00","updated_at":"2026-05-18T00:59:43.168028+00:00"}