{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MX57JJSVMEGGVEAI22YBPT3HGU","short_pith_number":"pith:MX57JJSV","schema_version":"1.0","canonical_sha256":"65fbf4a655610c6a9008d6b017cf673505ffa84d5b31f0e07400a3085523fa70","source":{"kind":"arxiv","id":"2501.11307","version":2},"attestation_state":"computed","paper":{"title":"SIG-SDP: Sparse Interference Graph-Aided Semidefinite Programming for Large-Scale Wireless Time-Sensitive Networking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Branka Vucetic, Jihong Park, Jinho Choi, Zhouyou Gu","submitted_at":"2025-01-20T07:13:23Z","abstract_excerpt":"Wireless time-sensitive networking (WTSN) is essential for Industrial Internet of Things. We address the problem of minimizing time slots needed for WTSN transmissions while ensuring reliability subject to interference constraints -- an NP-hard task. Existing semidefinite programming (SDP) methods can relax and solve the problem but suffer from high polynomial complexity. We propose a sparse interference graph-aided SDP (SIG-SDP) framework that exploits the interference's sparsity arising from attenuated signals between distant user pairs. First, the framework utilizes the sparsity to establis"},"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":"2501.11307","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2025-01-20T07:13:23Z","cross_cats_sorted":[],"title_canon_sha256":"15cc79e487a5f4b124fc1afaf54a28c0ab24f4719304dde7118999ecb5c60139","abstract_canon_sha256":"c9255f9c282fcc71c72ca00045fc543a2a80b0e6768dcbd654cc58c632ba4cae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:04:14.471629Z","signature_b64":"qakPhs5WNFjqxIkCuomm9wOdM6zVxuR5xH4zGbHXnD3yCVxY8xdP8lbPc+RQd5+1RCJ4Atf/Lcljl4mDvLzMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65fbf4a655610c6a9008d6b017cf673505ffa84d5b31f0e07400a3085523fa70","last_reissued_at":"2026-06-02T01:04:14.471213Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:04:14.471213Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SIG-SDP: Sparse Interference Graph-Aided Semidefinite Programming for Large-Scale Wireless Time-Sensitive Networking","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Branka Vucetic, Jihong Park, Jinho Choi, Zhouyou Gu","submitted_at":"2025-01-20T07:13:23Z","abstract_excerpt":"Wireless time-sensitive networking (WTSN) is essential for Industrial Internet of Things. We address the problem of minimizing time slots needed for WTSN transmissions while ensuring reliability subject to interference constraints -- an NP-hard task. Existing semidefinite programming (SDP) methods can relax and solve the problem but suffer from high polynomial complexity. We propose a sparse interference graph-aided SDP (SIG-SDP) framework that exploits the interference's sparsity arising from attenuated signals between distant user pairs. First, the framework utilizes the sparsity to establis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.11307","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.11307/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2501.11307","created_at":"2026-06-02T01:04:14.471271+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.11307v2","created_at":"2026-06-02T01:04:14.471271+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.11307","created_at":"2026-06-02T01:04:14.471271+00:00"},{"alias_kind":"pith_short_12","alias_value":"MX57JJSVMEGG","created_at":"2026-06-02T01:04:14.471271+00:00"},{"alias_kind":"pith_short_16","alias_value":"MX57JJSVMEGGVEAI","created_at":"2026-06-02T01:04:14.471271+00:00"},{"alias_kind":"pith_short_8","alias_value":"MX57JJSV","created_at":"2026-06-02T01:04:14.471271+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/MX57JJSVMEGGVEAI22YBPT3HGU","json":"https://pith.science/pith/MX57JJSVMEGGVEAI22YBPT3HGU.json","graph_json":"https://pith.science/api/pith-number/MX57JJSVMEGGVEAI22YBPT3HGU/graph.json","events_json":"https://pith.science/api/pith-number/MX57JJSVMEGGVEAI22YBPT3HGU/events.json","paper":"https://pith.science/paper/MX57JJSV"},"agent_actions":{"view_html":"https://pith.science/pith/MX57JJSVMEGGVEAI22YBPT3HGU","download_json":"https://pith.science/pith/MX57JJSVMEGGVEAI22YBPT3HGU.json","view_paper":"https://pith.science/paper/MX57JJSV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.11307&json=true","fetch_graph":"https://pith.science/api/pith-number/MX57JJSVMEGGVEAI22YBPT3HGU/graph.json","fetch_events":"https://pith.science/api/pith-number/MX57JJSVMEGGVEAI22YBPT3HGU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MX57JJSVMEGGVEAI22YBPT3HGU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MX57JJSVMEGGVEAI22YBPT3HGU/action/storage_attestation","attest_author":"https://pith.science/pith/MX57JJSVMEGGVEAI22YBPT3HGU/action/author_attestation","sign_citation":"https://pith.science/pith/MX57JJSVMEGGVEAI22YBPT3HGU/action/citation_signature","submit_replication":"https://pith.science/pith/MX57JJSVMEGGVEAI22YBPT3HGU/action/replication_record"}},"created_at":"2026-06-02T01:04:14.471271+00:00","updated_at":"2026-06-02T01:04:14.471271+00:00"}