{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZWTYLS4LCKX5VMY7RDOIOSFEGT","short_pith_number":"pith:ZWTYLS4L","schema_version":"1.0","canonical_sha256":"cda785cb8b12afdab31f88dc8748a434f44c62b9b25cfe5cfbe459e8556c2cc8","source":{"kind":"arxiv","id":"1504.06782","version":3},"attestation_state":"computed","paper":{"title":"An Approximately Optimal Algorithm for Scheduling Phasor Data Transmissions in Smart Grid Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"K. G. Nagananda, P. P. Khargonekar","submitted_at":"2015-04-26T04:16:19Z","abstract_excerpt":"In this paper, we devise a scheduling algorithm for ordering transmission of synchrophasor data from the substation to the control center in as short a time frame as possible, within the realtime hierarchical communications infrastructure in the electric grid. The problem is cast in the framework of the classic job scheduling with precedence constraints. The optimization setup comprises the number of phasor measurement units (PMUs) to be installed on the grid, a weight associated with each PMU, processing time at the control center for the PMUs, and precedence constraints between the PMUs. The"},"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":"1504.06782","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-26T04:16:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f4e15273cba3ebb98b81fe335601a75c61df297c9598509ea4907dea7ae13ed1","abstract_canon_sha256":"cc78eae5754fdf811fc1257558c6e366e37296881f8421b8085e3245bf704021"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:14.369651Z","signature_b64":"Z3/eFWQyx9crbLcLvmrgLHtkIFGYWk1CimIrn88RlkmyZyJKUfrg487KadCMu9/MfO3DEcr0QlWYEzZxATfwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cda785cb8b12afdab31f88dc8748a434f44c62b9b25cfe5cfbe459e8556c2cc8","last_reissued_at":"2026-05-18T01:28:14.368991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:14.368991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Approximately Optimal Algorithm for Scheduling Phasor Data Transmissions in Smart Grid Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"K. G. Nagananda, P. P. Khargonekar","submitted_at":"2015-04-26T04:16:19Z","abstract_excerpt":"In this paper, we devise a scheduling algorithm for ordering transmission of synchrophasor data from the substation to the control center in as short a time frame as possible, within the realtime hierarchical communications infrastructure in the electric grid. The problem is cast in the framework of the classic job scheduling with precedence constraints. The optimization setup comprises the number of phasor measurement units (PMUs) to be installed on the grid, a weight associated with each PMU, processing time at the control center for the PMUs, and precedence constraints between the PMUs. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06782","kind":"arxiv","version":3},"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":"1504.06782","created_at":"2026-05-18T01:28:14.369086+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.06782v3","created_at":"2026-05-18T01:28:14.369086+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06782","created_at":"2026-05-18T01:28:14.369086+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZWTYLS4LCKX5","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZWTYLS4LCKX5VMY7","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZWTYLS4L","created_at":"2026-05-18T12:29:52.810259+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/ZWTYLS4LCKX5VMY7RDOIOSFEGT","json":"https://pith.science/pith/ZWTYLS4LCKX5VMY7RDOIOSFEGT.json","graph_json":"https://pith.science/api/pith-number/ZWTYLS4LCKX5VMY7RDOIOSFEGT/graph.json","events_json":"https://pith.science/api/pith-number/ZWTYLS4LCKX5VMY7RDOIOSFEGT/events.json","paper":"https://pith.science/paper/ZWTYLS4L"},"agent_actions":{"view_html":"https://pith.science/pith/ZWTYLS4LCKX5VMY7RDOIOSFEGT","download_json":"https://pith.science/pith/ZWTYLS4LCKX5VMY7RDOIOSFEGT.json","view_paper":"https://pith.science/paper/ZWTYLS4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.06782&json=true","fetch_graph":"https://pith.science/api/pith-number/ZWTYLS4LCKX5VMY7RDOIOSFEGT/graph.json","fetch_events":"https://pith.science/api/pith-number/ZWTYLS4LCKX5VMY7RDOIOSFEGT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZWTYLS4LCKX5VMY7RDOIOSFEGT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZWTYLS4LCKX5VMY7RDOIOSFEGT/action/storage_attestation","attest_author":"https://pith.science/pith/ZWTYLS4LCKX5VMY7RDOIOSFEGT/action/author_attestation","sign_citation":"https://pith.science/pith/ZWTYLS4LCKX5VMY7RDOIOSFEGT/action/citation_signature","submit_replication":"https://pith.science/pith/ZWTYLS4LCKX5VMY7RDOIOSFEGT/action/replication_record"}},"created_at":"2026-05-18T01:28:14.369086+00:00","updated_at":"2026-05-18T01:28:14.369086+00:00"}