{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2RX6YBT5UJQXUSLQP5BQJD3H34","short_pith_number":"pith:2RX6YBT5","schema_version":"1.0","canonical_sha256":"d46fec067da2617a49707f43048f67df0e7a9844b3e800cbe02cb728ea63528e","source":{"kind":"arxiv","id":"1803.04578","version":1},"attestation_state":"computed","paper":{"title":"Spanning Trees With Edge Conflicts and Wireless Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NI","authors_text":"Guy Kortsarz, Magnus M. Halldorsson, Pradipta Mitra, Tigran Tonoyan","submitted_at":"2018-03-12T23:54:34Z","abstract_excerpt":"We introduce the problem of finding a spanning tree along with a partition of the tree edges into fewest number of feasible sets, where constraints on the edges define feasibility. The motivation comes from wireless networking, where we seek to model the irregularities seen in actual wireless environments. Not all node pairs may be able to communicate, even if geographically close --- thus, the available pairs are modeled with a link graph $\\mathcal{L}=(V,E)$. Also, signal attenuation need not follow a nice geometric formulas --- hence, interference is modeled by a conflict (hyper)graph $\\math"},"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":"1803.04578","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-03-12T23:54:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2ad29406001b0816bb1bb1b0e922a2e4a472fd388090716a02041243168b7d12","abstract_canon_sha256":"35d88ba29eed27fc252f16a7d44983ffb3e2a8cf22518da0968110887f88dd89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:18.621793Z","signature_b64":"AYlNCbXRfi5QHbzdFchIW/dA65ZHUo46zOQ8hOUpIFJpxasnwdvfi5PF5bWb34pYXX+i69ODoM1XLIpnY1DyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d46fec067da2617a49707f43048f67df0e7a9844b3e800cbe02cb728ea63528e","last_reissued_at":"2026-05-18T00:21:18.619704Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:18.619704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spanning Trees With Edge Conflicts and Wireless Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NI","authors_text":"Guy Kortsarz, Magnus M. Halldorsson, Pradipta Mitra, Tigran Tonoyan","submitted_at":"2018-03-12T23:54:34Z","abstract_excerpt":"We introduce the problem of finding a spanning tree along with a partition of the tree edges into fewest number of feasible sets, where constraints on the edges define feasibility. The motivation comes from wireless networking, where we seek to model the irregularities seen in actual wireless environments. Not all node pairs may be able to communicate, even if geographically close --- thus, the available pairs are modeled with a link graph $\\mathcal{L}=(V,E)$. Also, signal attenuation need not follow a nice geometric formulas --- hence, interference is modeled by a conflict (hyper)graph $\\math"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04578","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":"1803.04578","created_at":"2026-05-18T00:21:18.621169+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.04578v1","created_at":"2026-05-18T00:21:18.621169+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04578","created_at":"2026-05-18T00:21:18.621169+00:00"},{"alias_kind":"pith_short_12","alias_value":"2RX6YBT5UJQX","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2RX6YBT5UJQXUSLQ","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2RX6YBT5","created_at":"2026-05-18T12:32:02.567920+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/2RX6YBT5UJQXUSLQP5BQJD3H34","json":"https://pith.science/pith/2RX6YBT5UJQXUSLQP5BQJD3H34.json","graph_json":"https://pith.science/api/pith-number/2RX6YBT5UJQXUSLQP5BQJD3H34/graph.json","events_json":"https://pith.science/api/pith-number/2RX6YBT5UJQXUSLQP5BQJD3H34/events.json","paper":"https://pith.science/paper/2RX6YBT5"},"agent_actions":{"view_html":"https://pith.science/pith/2RX6YBT5UJQXUSLQP5BQJD3H34","download_json":"https://pith.science/pith/2RX6YBT5UJQXUSLQP5BQJD3H34.json","view_paper":"https://pith.science/paper/2RX6YBT5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.04578&json=true","fetch_graph":"https://pith.science/api/pith-number/2RX6YBT5UJQXUSLQP5BQJD3H34/graph.json","fetch_events":"https://pith.science/api/pith-number/2RX6YBT5UJQXUSLQP5BQJD3H34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2RX6YBT5UJQXUSLQP5BQJD3H34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2RX6YBT5UJQXUSLQP5BQJD3H34/action/storage_attestation","attest_author":"https://pith.science/pith/2RX6YBT5UJQXUSLQP5BQJD3H34/action/author_attestation","sign_citation":"https://pith.science/pith/2RX6YBT5UJQXUSLQP5BQJD3H34/action/citation_signature","submit_replication":"https://pith.science/pith/2RX6YBT5UJQXUSLQP5BQJD3H34/action/replication_record"}},"created_at":"2026-05-18T00:21:18.621169+00:00","updated_at":"2026-05-18T00:21:18.621169+00:00"}