{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:SDLTQTHGH34YX4A22POBG6MZT4","short_pith_number":"pith:SDLTQTHG","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"},"canonical_sha256":"90d7384ce63ef98bf01ad3dc1379999f10a8cf51d11e6d3ea5d00da05941eab7","source":{"kind":"arxiv","id":"1210.7467","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.7467","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"arxiv_version","alias_value":"1210.7467v1","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7467","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"pith_short_12","alias_value":"SDLTQTHGH34Y","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SDLTQTHGH34YX4A2","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SDLTQTHG","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:SDLTQTHGH34YX4A22POBG6MZT4","target":"record","payload":{"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"},"canonical_sha256":"90d7384ce63ef98bf01ad3dc1379999f10a8cf51d11e6d3ea5d00da05941eab7","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"},"source_kind":"arxiv","source_id":"1210.7467","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:42:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wEXpR3U67mMdebsrvetWuv7ONIg1Y8eykRpw1KdBAbAkBJ6ZFiVnej3zSP8nWJoH0J1sV2YoknHGOhEZWjt0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T05:51:04.750506Z"},"content_sha256":"318251bd82c7f0c3bd6138295e7774d646b60aa6ffaeab84c4fc3870bc78ddae","schema_version":"1.0","event_id":"sha256:318251bd82c7f0c3bd6138295e7774d646b60aa6ffaeab84c4fc3870bc78ddae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:SDLTQTHGH34YX4A22POBG6MZT4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:42:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vYXlVEpmeqnQhTlAzuNB2rE3kngf2lqifYKF9+vBL+oyP1efYJA/TgCKQzDQ7lZCZopZCAMvRPQCTpxlepJ2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T05:51:04.750851Z"},"content_sha256":"0605ed5fbd0c4949dfcf6d6a122f99f5d3294b8af990d6d3c130adb10d4bef98","schema_version":"1.0","event_id":"sha256:0605ed5fbd0c4949dfcf6d6a122f99f5d3294b8af990d6d3c130adb10d4bef98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SDLTQTHGH34YX4A22POBG6MZT4/bundle.json","state_url":"https://pith.science/pith/SDLTQTHGH34YX4A22POBG6MZT4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SDLTQTHGH34YX4A22POBG6MZT4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T05:51:04Z","links":{"resolver":"https://pith.science/pith/SDLTQTHGH34YX4A22POBG6MZT4","bundle":"https://pith.science/pith/SDLTQTHGH34YX4A22POBG6MZT4/bundle.json","state":"https://pith.science/pith/SDLTQTHGH34YX4A22POBG6MZT4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SDLTQTHGH34YX4A22POBG6MZT4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:SDLTQTHGH34YX4A22POBG6MZT4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7931cead6004555672105817d6209dad1027be5c6bbc0177849a8a73c9ce35ad","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-28T15:23:50Z","title_canon_sha256":"285931634f1f7d46a2e70752dfb6d4afbd0c6cea8ccd4f74eb95819574ef426c"},"schema_version":"1.0","source":{"id":"1210.7467","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.7467","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"arxiv_version","alias_value":"1210.7467v1","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7467","created_at":"2026-05-18T03:42:09Z"},{"alias_kind":"pith_short_12","alias_value":"SDLTQTHGH34Y","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SDLTQTHGH34YX4A2","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SDLTQTHG","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:0605ed5fbd0c4949dfcf6d6a122f99f5d3294b8af990d6d3c130adb10d4bef98","target":"graph","created_at":"2026-05-18T03:42:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ali Ghiasian, Behnaz Omoomi, Hossein Saidi","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-28T15:23:50Z","title":"A generalization of line graphs via link scheduling in wireless networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7467","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:318251bd82c7f0c3bd6138295e7774d646b60aa6ffaeab84c4fc3870bc78ddae","target":"record","created_at":"2026-05-18T03:42:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7931cead6004555672105817d6209dad1027be5c6bbc0177849a8a73c9ce35ad","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-28T15:23:50Z","title_canon_sha256":"285931634f1f7d46a2e70752dfb6d4afbd0c6cea8ccd4f74eb95819574ef426c"},"schema_version":"1.0","source":{"id":"1210.7467","kind":"arxiv","version":1}},"canonical_sha256":"90d7384ce63ef98bf01ad3dc1379999f10a8cf51d11e6d3ea5d00da05941eab7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90d7384ce63ef98bf01ad3dc1379999f10a8cf51d11e6d3ea5d00da05941eab7","first_computed_at":"2026-05-18T03:42:09.911261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:09.911261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kXqVjPpgAmwrohFimLbd44NPLUawcoWaeDH8h8mO8LwzIWa7bqosiD8k3t0Qyyj8spwGh2K50R4O7iBAP1laCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:09.911999Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.7467","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:318251bd82c7f0c3bd6138295e7774d646b60aa6ffaeab84c4fc3870bc78ddae","sha256:0605ed5fbd0c4949dfcf6d6a122f99f5d3294b8af990d6d3c130adb10d4bef98"],"state_sha256":"f6fffa2093214bdac83326c2aa180351c3edd0c0dd7ce42f12376f7fe20016f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eYh5+g7F74VLx+5SORDHYsH+ddeZseCzU5M9dqx+29lx1KOUm2vKDmMmP7XjW/+R/4UR6urFGGheHbvCXYneBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T05:51:04.752772Z","bundle_sha256":"3d0f8fb1fb3eed8723337405858c2e619a46bd254b64bbdbf31ef88022b5f876"}}