{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SDLTQTHGH34YX4A22POBG6MZT4","short_pith_number":"pith:SDLTQTHG","schema_version":"1.0","canonical_sha256":"90d7384ce63ef98bf01ad3dc1379999f10a8cf51d11e6d3ea5d00da05941eab7","source":{"kind":"arxiv","id":"1210.7467","version":1},"attestation_state":"computed","paper":{"title":"A generalization of line graphs via link scheduling in wireless networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ali Ghiasian, Behnaz Omoomi, Hossein Saidi","submitted_at":"2012-10-28T15:23:50Z","abstract_excerpt":"In single channel wireless networks, concurrent transmission at different links may interfere with each other. To improve system throughput, a scheduling algorithm is necessary to choose a subset of links at each time slot for data trasmission. Throughput optimal link scheduling discipline in such a wireless network is generally an NP-hard problem. In this paper, we develop a poylnomial time algorithm for link scheduling problem provided that network conflict graph is line multigraph. (i.e. line graph for which its root graph is multigraph). This result can be a guideline for network designers"},"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":"1210.7467","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-28T15:23:50Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"285931634f1f7d46a2e70752dfb6d4afbd0c6cea8ccd4f74eb95819574ef426c","abstract_canon_sha256":"7931cead6004555672105817d6209dad1027be5c6bbc0177849a8a73c9ce35ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:09.911999Z","signature_b64":"kXqVjPpgAmwrohFimLbd44NPLUawcoWaeDH8h8mO8LwzIWa7bqosiD8k3t0Qyyj8spwGh2K50R4O7iBAP1laCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90d7384ce63ef98bf01ad3dc1379999f10a8cf51d11e6d3ea5d00da05941eab7","last_reissued_at":"2026-05-18T03:42:09.911261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:09.911261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A generalization of line graphs via link scheduling in wireless networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ali Ghiasian, Behnaz Omoomi, Hossein Saidi","submitted_at":"2012-10-28T15:23:50Z","abstract_excerpt":"In single channel wireless networks, concurrent transmission at different links may interfere with each other. To improve system throughput, a scheduling algorithm is necessary to choose a subset of links at each time slot for data trasmission. Throughput optimal link scheduling discipline in such a wireless network is generally an NP-hard problem. In this paper, we develop a poylnomial time algorithm for link scheduling problem provided that network conflict graph is line multigraph. (i.e. line graph for which its root graph is multigraph). This result can be a guideline for network designers"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7467","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":"1210.7467","created_at":"2026-05-18T03:42:09.911411+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.7467v1","created_at":"2026-05-18T03:42:09.911411+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7467","created_at":"2026-05-18T03:42:09.911411+00:00"},{"alias_kind":"pith_short_12","alias_value":"SDLTQTHGH34Y","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SDLTQTHGH34YX4A2","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SDLTQTHG","created_at":"2026-05-18T12:27:20.899486+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/SDLTQTHGH34YX4A22POBG6MZT4","json":"https://pith.science/pith/SDLTQTHGH34YX4A22POBG6MZT4.json","graph_json":"https://pith.science/api/pith-number/SDLTQTHGH34YX4A22POBG6MZT4/graph.json","events_json":"https://pith.science/api/pith-number/SDLTQTHGH34YX4A22POBG6MZT4/events.json","paper":"https://pith.science/paper/SDLTQTHG"},"agent_actions":{"view_html":"https://pith.science/pith/SDLTQTHGH34YX4A22POBG6MZT4","download_json":"https://pith.science/pith/SDLTQTHGH34YX4A22POBG6MZT4.json","view_paper":"https://pith.science/paper/SDLTQTHG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.7467&json=true","fetch_graph":"https://pith.science/api/pith-number/SDLTQTHGH34YX4A22POBG6MZT4/graph.json","fetch_events":"https://pith.science/api/pith-number/SDLTQTHGH34YX4A22POBG6MZT4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SDLTQTHGH34YX4A22POBG6MZT4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SDLTQTHGH34YX4A22POBG6MZT4/action/storage_attestation","attest_author":"https://pith.science/pith/SDLTQTHGH34YX4A22POBG6MZT4/action/author_attestation","sign_citation":"https://pith.science/pith/SDLTQTHGH34YX4A22POBG6MZT4/action/citation_signature","submit_replication":"https://pith.science/pith/SDLTQTHGH34YX4A22POBG6MZT4/action/replication_record"}},"created_at":"2026-05-18T03:42:09.911411+00:00","updated_at":"2026-05-18T03:42:09.911411+00:00"}