{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QWAZKNRC3RWEITX7B4YBAPPY6D","short_pith_number":"pith:QWAZKNRC","schema_version":"1.0","canonical_sha256":"8581953622dc6c444eff0f30103df8f0c0d28c394bef994090087111bb02af6f","source":{"kind":"arxiv","id":"1603.01786","version":3},"attestation_state":"computed","paper":{"title":"Complex-demand Scheduling Problem with Application in Smart Grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Areg Karapetyan, Khaled Elbassioni, Majid Khonji, Sid Chi-Kin Chau","submitted_at":"2016-03-06T03:56:22Z","abstract_excerpt":"We consider the problem of scheduling complex-valued demands over a discretized time horizon. Given a set of users, each user is associated with a set of demands representing different power consumption preferences. A demand is represented by a complex number, a time interval, and a utility value obtained if it is satisfied. At each time slot, the magnitude of the total selected demands should not exceed a given generation capacity. This naturally captures the supply constraints in alternating current (AC) electric systems. In this paper, we consider maximizing the aggregate user utility subje"},"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":"1603.01786","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-06T03:56:22Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"37f3ac3765e4acb2a6f2ce8d86c2fbd2bb6fe5ca739b950c683bfd213a48f6f7","abstract_canon_sha256":"86b10b6e022ee33e1b277ae9f541efdd3985334876b47a9bd7cc6c84d2f2cf1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:08.695249Z","signature_b64":"rjXRGsfg1g+Qk6JPlojm+2PS+lWohhNqojLMWhrtXMq3fV7eJKrmc8POXLmTFU3RrxbqRA7yhQ7gIEg/ojM2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8581953622dc6c444eff0f30103df8f0c0d28c394bef994090087111bb02af6f","last_reissued_at":"2026-05-17T23:52:08.694871Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:08.694871Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complex-demand Scheduling Problem with Application in Smart Grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Areg Karapetyan, Khaled Elbassioni, Majid Khonji, Sid Chi-Kin Chau","submitted_at":"2016-03-06T03:56:22Z","abstract_excerpt":"We consider the problem of scheduling complex-valued demands over a discretized time horizon. Given a set of users, each user is associated with a set of demands representing different power consumption preferences. A demand is represented by a complex number, a time interval, and a utility value obtained if it is satisfied. At each time slot, the magnitude of the total selected demands should not exceed a given generation capacity. This naturally captures the supply constraints in alternating current (AC) electric systems. In this paper, we consider maximizing the aggregate user utility subje"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01786","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":"1603.01786","created_at":"2026-05-17T23:52:08.694934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.01786v3","created_at":"2026-05-17T23:52:08.694934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01786","created_at":"2026-05-17T23:52:08.694934+00:00"},{"alias_kind":"pith_short_12","alias_value":"QWAZKNRC3RWE","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"QWAZKNRC3RWEITX7","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"QWAZKNRC","created_at":"2026-05-18T12:30:41.710351+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/QWAZKNRC3RWEITX7B4YBAPPY6D","json":"https://pith.science/pith/QWAZKNRC3RWEITX7B4YBAPPY6D.json","graph_json":"https://pith.science/api/pith-number/QWAZKNRC3RWEITX7B4YBAPPY6D/graph.json","events_json":"https://pith.science/api/pith-number/QWAZKNRC3RWEITX7B4YBAPPY6D/events.json","paper":"https://pith.science/paper/QWAZKNRC"},"agent_actions":{"view_html":"https://pith.science/pith/QWAZKNRC3RWEITX7B4YBAPPY6D","download_json":"https://pith.science/pith/QWAZKNRC3RWEITX7B4YBAPPY6D.json","view_paper":"https://pith.science/paper/QWAZKNRC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.01786&json=true","fetch_graph":"https://pith.science/api/pith-number/QWAZKNRC3RWEITX7B4YBAPPY6D/graph.json","fetch_events":"https://pith.science/api/pith-number/QWAZKNRC3RWEITX7B4YBAPPY6D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QWAZKNRC3RWEITX7B4YBAPPY6D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QWAZKNRC3RWEITX7B4YBAPPY6D/action/storage_attestation","attest_author":"https://pith.science/pith/QWAZKNRC3RWEITX7B4YBAPPY6D/action/author_attestation","sign_citation":"https://pith.science/pith/QWAZKNRC3RWEITX7B4YBAPPY6D/action/citation_signature","submit_replication":"https://pith.science/pith/QWAZKNRC3RWEITX7B4YBAPPY6D/action/replication_record"}},"created_at":"2026-05-17T23:52:08.694934+00:00","updated_at":"2026-05-17T23:52:08.694934+00:00"}