{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4E2NG6ZGZQC7LEISTNAQJJGZXT","short_pith_number":"pith:4E2NG6ZG","canonical_record":{"source":{"id":"1610.07559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-24T19:20:32Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"3c0e0ba65f1044409ea6e67d179ea989a90419ee9a2808458c7a29eaf8750536","abstract_canon_sha256":"ac7a5edd80d6f5427cc434f97ddcf78d8e91d210907367ef0d297ea4bb3571b9"},"schema_version":"1.0"},"canonical_sha256":"e134d37b26cc05f591129b4104a4d9bce973338886b41c95e933b657c53d51c2","source":{"kind":"arxiv","id":"1610.07559","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07559","created_at":"2026-05-18T01:01:21Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07559v1","created_at":"2026-05-18T01:01:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07559","created_at":"2026-05-18T01:01:21Z"},{"alias_kind":"pith_short_12","alias_value":"4E2NG6ZGZQC7","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4E2NG6ZGZQC7LEIS","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4E2NG6ZG","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4E2NG6ZGZQC7LEISTNAQJJGZXT","target":"record","payload":{"canonical_record":{"source":{"id":"1610.07559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-24T19:20:32Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"3c0e0ba65f1044409ea6e67d179ea989a90419ee9a2808458c7a29eaf8750536","abstract_canon_sha256":"ac7a5edd80d6f5427cc434f97ddcf78d8e91d210907367ef0d297ea4bb3571b9"},"schema_version":"1.0"},"canonical_sha256":"e134d37b26cc05f591129b4104a4d9bce973338886b41c95e933b657c53d51c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:21.669178Z","signature_b64":"oZJSqQJwV+CaOaxFuPiiE+Sayp5sjDEHIbl4OgkE/OrCXunHt5FTclTSuNeTTjPrs3DBt7omIWzUWo33bWGhBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e134d37b26cc05f591129b4104a4d9bce973338886b41c95e933b657c53d51c2","last_reissued_at":"2026-05-18T01:01:21.668677Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:21.668677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.07559","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-18T01:01:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FjFZv+rg2cY3jcwInNiJ/F2grif1/vXcKc5bEP8c5el/VUOYmlxXe+ZDcJtyTj48TpiIYT52jnaSFr0s0NmxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:01:21.976622Z"},"content_sha256":"a10e8c3ef9c5ced020d3565e5b6f247586b34e7bcd139d28f831559e8923a034","schema_version":"1.0","event_id":"sha256:a10e8c3ef9c5ced020d3565e5b6f247586b34e7bcd139d28f831559e8923a034"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4E2NG6ZGZQC7LEISTNAQJJGZXT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Pricing in Smart Grids under Thresholding Policies: Algorithms and Heuristics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Jacob Crandall, Khaled Elbassioni, Mardavij Roozbehani, Trung Thanh Nguyen, Zaid Almahmoud","submitted_at":"2016-10-24T19:20:32Z","abstract_excerpt":"Minimizing the peak power consumption and matching demand to supply, under fixed threshold polices, are two key requirements for the success of the future electricity market. In this work, we consider dynamic pricing methods to minimize the peak load and match demand to supply in the smart grid. As these optimization problems are computationally hard to solve in general, we propose generic heuristics for approximating their solutions. Further, we provide theoretical analysis of uniform pricing in peak-demand minimization. Moreover, we propose optimal-pricing algorithms for scenarios in which t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07559","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-18T01:01:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NTMEgnUSnaFWa1RQ31Ok3iyqckN/KupxrS/9QJy5xEPhb5gPpEjGAOiDewZoBkL1Grwma1oK3ZEDc012djleAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:01:21.977154Z"},"content_sha256":"b6533380d61e6f6e5d22f051226f358e033c2cd4139c7fd41e909f8056514b80","schema_version":"1.0","event_id":"sha256:b6533380d61e6f6e5d22f051226f358e033c2cd4139c7fd41e909f8056514b80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4E2NG6ZGZQC7LEISTNAQJJGZXT/bundle.json","state_url":"https://pith.science/pith/4E2NG6ZGZQC7LEISTNAQJJGZXT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4E2NG6ZGZQC7LEISTNAQJJGZXT/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-05T11:01:21Z","links":{"resolver":"https://pith.science/pith/4E2NG6ZGZQC7LEISTNAQJJGZXT","bundle":"https://pith.science/pith/4E2NG6ZGZQC7LEISTNAQJJGZXT/bundle.json","state":"https://pith.science/pith/4E2NG6ZGZQC7LEISTNAQJJGZXT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4E2NG6ZGZQC7LEISTNAQJJGZXT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4E2NG6ZGZQC7LEISTNAQJJGZXT","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":"ac7a5edd80d6f5427cc434f97ddcf78d8e91d210907367ef0d297ea4bb3571b9","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-24T19:20:32Z","title_canon_sha256":"3c0e0ba65f1044409ea6e67d179ea989a90419ee9a2808458c7a29eaf8750536"},"schema_version":"1.0","source":{"id":"1610.07559","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07559","created_at":"2026-05-18T01:01:21Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07559v1","created_at":"2026-05-18T01:01:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07559","created_at":"2026-05-18T01:01:21Z"},{"alias_kind":"pith_short_12","alias_value":"4E2NG6ZGZQC7","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4E2NG6ZGZQC7LEIS","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4E2NG6ZG","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:b6533380d61e6f6e5d22f051226f358e033c2cd4139c7fd41e909f8056514b80","target":"graph","created_at":"2026-05-18T01:01:21Z","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":"Minimizing the peak power consumption and matching demand to supply, under fixed threshold polices, are two key requirements for the success of the future electricity market. In this work, we consider dynamic pricing methods to minimize the peak load and match demand to supply in the smart grid. As these optimization problems are computationally hard to solve in general, we propose generic heuristics for approximating their solutions. Further, we provide theoretical analysis of uniform pricing in peak-demand minimization. Moreover, we propose optimal-pricing algorithms for scenarios in which t","authors_text":"Jacob Crandall, Khaled Elbassioni, Mardavij Roozbehani, Trung Thanh Nguyen, Zaid Almahmoud","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-24T19:20:32Z","title":"Dynamic Pricing in Smart Grids under Thresholding Policies: Algorithms and Heuristics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07559","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:a10e8c3ef9c5ced020d3565e5b6f247586b34e7bcd139d28f831559e8923a034","target":"record","created_at":"2026-05-18T01:01:21Z","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":"ac7a5edd80d6f5427cc434f97ddcf78d8e91d210907367ef0d297ea4bb3571b9","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-24T19:20:32Z","title_canon_sha256":"3c0e0ba65f1044409ea6e67d179ea989a90419ee9a2808458c7a29eaf8750536"},"schema_version":"1.0","source":{"id":"1610.07559","kind":"arxiv","version":1}},"canonical_sha256":"e134d37b26cc05f591129b4104a4d9bce973338886b41c95e933b657c53d51c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e134d37b26cc05f591129b4104a4d9bce973338886b41c95e933b657c53d51c2","first_computed_at":"2026-05-18T01:01:21.668677Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:21.668677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oZJSqQJwV+CaOaxFuPiiE+Sayp5sjDEHIbl4OgkE/OrCXunHt5FTclTSuNeTTjPrs3DBt7omIWzUWo33bWGhBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:21.669178Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.07559","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a10e8c3ef9c5ced020d3565e5b6f247586b34e7bcd139d28f831559e8923a034","sha256:b6533380d61e6f6e5d22f051226f358e033c2cd4139c7fd41e909f8056514b80"],"state_sha256":"a3b749510da9ac466b9eab6ed69ed68833e6297ce876b92e29e1ea7026f41de5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s5vkBKQaCP1inRnESgr4rFHOZFmcbHsZnNmOJkIKMDbA0wBi4RiTuDnhaJ1gH1Q67rfwS0jnM9wYFLXMrmuvBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:01:21.979669Z","bundle_sha256":"67c84b94e56b09ffeb4b77c423c30b672f7117909f76f9c5d6bcc883ee489907"}}