{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MKRVHEW4JZW6Y5BO6WXT7ITOLQ","short_pith_number":"pith:MKRVHEW4","schema_version":"1.0","canonical_sha256":"62a35392dc4e6dec742ef5af3fa26e5c3e11bc79c2acbac8963e52d8be06d51a","source":{"kind":"arxiv","id":"1610.09491","version":1},"attestation_state":"computed","paper":{"title":"SDP Relaxation with Randomized Rounding for Energy Disaggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andr\\'as Gy\\\"orgy, Csaba Szepesv\\'ari, Kiarash Shaloudegi, Wilsun Xu","submitted_at":"2016-10-29T11:48:28Z","abstract_excerpt":"We develop a scalable, computationally efficient method for the task of energy disaggregation for home appliance monitoring. In this problem the goal is to estimate the energy consumption of each appliance over time based on the total energy-consumption signal of a household. The current state of the art is to model the problem as inference in factorial HMMs, and use quadratic programming to find an approximate solution to the resulting quadratic integer program. Here we take a more principled approach, better suited to integer programming problems, and find an approximate optimum by combining"},"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":"1610.09491","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-10-29T11:48:28Z","cross_cats_sorted":[],"title_canon_sha256":"9631dfa89b8bc5c28a0358d47e07028cc0deb706d6e257443ca6310ab6a567ad","abstract_canon_sha256":"d25cda25b7345c560a3f105e4ffb04a3893ded8544e52e9916a140bf371dac58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:51.861637Z","signature_b64":"ymtV9NJkK7AV739r6icnWknAjgVjQ9Q47J5d4gi4CCIrzOgCCp0P+viUio2EFX87/q48UHTWkeQg8eeRB5+AAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62a35392dc4e6dec742ef5af3fa26e5c3e11bc79c2acbac8963e52d8be06d51a","last_reissued_at":"2026-05-18T01:00:51.861119Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:51.861119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SDP Relaxation with Randomized Rounding for Energy Disaggregation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andr\\'as Gy\\\"orgy, Csaba Szepesv\\'ari, Kiarash Shaloudegi, Wilsun Xu","submitted_at":"2016-10-29T11:48:28Z","abstract_excerpt":"We develop a scalable, computationally efficient method for the task of energy disaggregation for home appliance monitoring. In this problem the goal is to estimate the energy consumption of each appliance over time based on the total energy-consumption signal of a household. The current state of the art is to model the problem as inference in factorial HMMs, and use quadratic programming to find an approximate solution to the resulting quadratic integer program. Here we take a more principled approach, better suited to integer programming problems, and find an approximate optimum by combining"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09491","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.09491","created_at":"2026-05-18T01:00:51.861203+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.09491v1","created_at":"2026-05-18T01:00:51.861203+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09491","created_at":"2026-05-18T01:00:51.861203+00:00"},{"alias_kind":"pith_short_12","alias_value":"MKRVHEW4JZW6","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MKRVHEW4JZW6Y5BO","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MKRVHEW4","created_at":"2026-05-18T12:30:32.724797+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/MKRVHEW4JZW6Y5BO6WXT7ITOLQ","json":"https://pith.science/pith/MKRVHEW4JZW6Y5BO6WXT7ITOLQ.json","graph_json":"https://pith.science/api/pith-number/MKRVHEW4JZW6Y5BO6WXT7ITOLQ/graph.json","events_json":"https://pith.science/api/pith-number/MKRVHEW4JZW6Y5BO6WXT7ITOLQ/events.json","paper":"https://pith.science/paper/MKRVHEW4"},"agent_actions":{"view_html":"https://pith.science/pith/MKRVHEW4JZW6Y5BO6WXT7ITOLQ","download_json":"https://pith.science/pith/MKRVHEW4JZW6Y5BO6WXT7ITOLQ.json","view_paper":"https://pith.science/paper/MKRVHEW4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.09491&json=true","fetch_graph":"https://pith.science/api/pith-number/MKRVHEW4JZW6Y5BO6WXT7ITOLQ/graph.json","fetch_events":"https://pith.science/api/pith-number/MKRVHEW4JZW6Y5BO6WXT7ITOLQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MKRVHEW4JZW6Y5BO6WXT7ITOLQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MKRVHEW4JZW6Y5BO6WXT7ITOLQ/action/storage_attestation","attest_author":"https://pith.science/pith/MKRVHEW4JZW6Y5BO6WXT7ITOLQ/action/author_attestation","sign_citation":"https://pith.science/pith/MKRVHEW4JZW6Y5BO6WXT7ITOLQ/action/citation_signature","submit_replication":"https://pith.science/pith/MKRVHEW4JZW6Y5BO6WXT7ITOLQ/action/replication_record"}},"created_at":"2026-05-18T01:00:51.861203+00:00","updated_at":"2026-05-18T01:00:51.861203+00:00"}