{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:PHE2NMME67P4IQRSVIQXC27P2J","short_pith_number":"pith:PHE2NMME","canonical_record":{"source":{"id":"2402.00875","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2024-01-10T19:07:14Z","cross_cats_sorted":[],"title_canon_sha256":"ba777328d76360d669d9cffc6890ebc2ce2bd724d97d41d845e1eefdc62396ca","abstract_canon_sha256":"95cecfdc7e23686485c604f2f074a0d48ce1dff36ae2fdc1e16974ad2950e9ad"},"schema_version":"1.0"},"canonical_sha256":"79c9a6b184f7dfc44232aa21716befd25a77c0124ca98e7fdf862c3e2700efb3","source":{"kind":"arxiv","id":"2402.00875","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.00875","created_at":"2026-07-05T07:40:27Z"},{"alias_kind":"arxiv_version","alias_value":"2402.00875v1","created_at":"2026-07-05T07:40:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.00875","created_at":"2026-07-05T07:40:27Z"},{"alias_kind":"pith_short_12","alias_value":"PHE2NMME67P4","created_at":"2026-07-05T07:40:27Z"},{"alias_kind":"pith_short_16","alias_value":"PHE2NMME67P4IQRS","created_at":"2026-07-05T07:40:27Z"},{"alias_kind":"pith_short_8","alias_value":"PHE2NMME","created_at":"2026-07-05T07:40:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:PHE2NMME67P4IQRSVIQXC27P2J","target":"record","payload":{"canonical_record":{"source":{"id":"2402.00875","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2024-01-10T19:07:14Z","cross_cats_sorted":[],"title_canon_sha256":"ba777328d76360d669d9cffc6890ebc2ce2bd724d97d41d845e1eefdc62396ca","abstract_canon_sha256":"95cecfdc7e23686485c604f2f074a0d48ce1dff36ae2fdc1e16974ad2950e9ad"},"schema_version":"1.0"},"canonical_sha256":"79c9a6b184f7dfc44232aa21716befd25a77c0124ca98e7fdf862c3e2700efb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:40:27.325575Z","signature_b64":"wj5gJh8aslrNjXIrflQBCKHS6Fl0MjeepZIJwK5SYeQ1KxTir9bO8aWzWwoCmoGafMWwSOgpCwjGU4RW8jt8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79c9a6b184f7dfc44232aa21716befd25a77c0124ca98e7fdf862c3e2700efb3","last_reissued_at":"2026-07-05T07:40:27.324993Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:40:27.324993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.00875","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-07-05T07:40:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ia8LWKtvhHPcJVnIVbO6J/tcjK8eoMOjHKxrnh/ZS+vx5thgZnX8koB/PylDTRFNMzsNdwFIITAELC96M6bLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T23:56:53.116437Z"},"content_sha256":"6ef22b1b4c69bba2f44a440f68313b57043b3cc23fc7a30ec4fd74da258aaa97","schema_version":"1.0","event_id":"sha256:6ef22b1b4c69bba2f44a440f68313b57043b3cc23fc7a30ec4fd74da258aaa97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:PHE2NMME67P4IQRSVIQXC27P2J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum-Cost Sensor Channel Selection For Wearable Computing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Hassan Ghasemzadeh, Ramesh Kumar Sah","submitted_at":"2024-01-10T19:07:14Z","abstract_excerpt":"Sensor systems are constrained by design and finding top sensor channel(s) for a given computational task is an important but hard problem. We define an optimization framework and mathematically formulate the minimum-cost channel selection problem. We then propose two novel algorithms of varying scope and complexity to solve the optimization problem. Branch and bound channel selection finds a globally optimal channel subset and the greedy channel selection finds the best intermediate subset based on the value of a score function. Proposed channel selection algorithms are conditioned with perfo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.00875","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2402.00875/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"},"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-07-05T07:40:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TRi6ns5YYDioqC/5+XraTBl0WRG7hkNfG245Bc0FC2lUunEwZ6CeddLSHYi8ggt2HNRk2BNkgCm57hp7EA51Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T23:56:53.116948Z"},"content_sha256":"1fe649df68c1cf27e72dde65ac179f93e5b9c371fd7af7545081422a9153cb26","schema_version":"1.0","event_id":"sha256:1fe649df68c1cf27e72dde65ac179f93e5b9c371fd7af7545081422a9153cb26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PHE2NMME67P4IQRSVIQXC27P2J/bundle.json","state_url":"https://pith.science/pith/PHE2NMME67P4IQRSVIQXC27P2J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PHE2NMME67P4IQRSVIQXC27P2J/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-08-08T23:56:53Z","links":{"resolver":"https://pith.science/pith/PHE2NMME67P4IQRSVIQXC27P2J","bundle":"https://pith.science/pith/PHE2NMME67P4IQRSVIQXC27P2J/bundle.json","state":"https://pith.science/pith/PHE2NMME67P4IQRSVIQXC27P2J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PHE2NMME67P4IQRSVIQXC27P2J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:PHE2NMME67P4IQRSVIQXC27P2J","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":"95cecfdc7e23686485c604f2f074a0d48ce1dff36ae2fdc1e16974ad2950e9ad","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2024-01-10T19:07:14Z","title_canon_sha256":"ba777328d76360d669d9cffc6890ebc2ce2bd724d97d41d845e1eefdc62396ca"},"schema_version":"1.0","source":{"id":"2402.00875","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.00875","created_at":"2026-07-05T07:40:27Z"},{"alias_kind":"arxiv_version","alias_value":"2402.00875v1","created_at":"2026-07-05T07:40:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.00875","created_at":"2026-07-05T07:40:27Z"},{"alias_kind":"pith_short_12","alias_value":"PHE2NMME67P4","created_at":"2026-07-05T07:40:27Z"},{"alias_kind":"pith_short_16","alias_value":"PHE2NMME67P4IQRS","created_at":"2026-07-05T07:40:27Z"},{"alias_kind":"pith_short_8","alias_value":"PHE2NMME","created_at":"2026-07-05T07:40:27Z"}],"graph_snapshots":[{"event_id":"sha256:1fe649df68c1cf27e72dde65ac179f93e5b9c371fd7af7545081422a9153cb26","target":"graph","created_at":"2026-07-05T07:40:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2402.00875/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Sensor systems are constrained by design and finding top sensor channel(s) for a given computational task is an important but hard problem. We define an optimization framework and mathematically formulate the minimum-cost channel selection problem. We then propose two novel algorithms of varying scope and complexity to solve the optimization problem. Branch and bound channel selection finds a globally optimal channel subset and the greedy channel selection finds the best intermediate subset based on the value of a score function. Proposed channel selection algorithms are conditioned with perfo","authors_text":"Hassan Ghasemzadeh, Ramesh Kumar Sah","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2024-01-10T19:07:14Z","title":"Minimum-Cost Sensor Channel Selection For Wearable Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.00875","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:6ef22b1b4c69bba2f44a440f68313b57043b3cc23fc7a30ec4fd74da258aaa97","target":"record","created_at":"2026-07-05T07:40:27Z","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":"95cecfdc7e23686485c604f2f074a0d48ce1dff36ae2fdc1e16974ad2950e9ad","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2024-01-10T19:07:14Z","title_canon_sha256":"ba777328d76360d669d9cffc6890ebc2ce2bd724d97d41d845e1eefdc62396ca"},"schema_version":"1.0","source":{"id":"2402.00875","kind":"arxiv","version":1}},"canonical_sha256":"79c9a6b184f7dfc44232aa21716befd25a77c0124ca98e7fdf862c3e2700efb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79c9a6b184f7dfc44232aa21716befd25a77c0124ca98e7fdf862c3e2700efb3","first_computed_at":"2026-07-05T07:40:27.324993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:40:27.324993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wj5gJh8aslrNjXIrflQBCKHS6Fl0MjeepZIJwK5SYeQ1KxTir9bO8aWzWwoCmoGafMWwSOgpCwjGU4RW8jt8Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:40:27.325575Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.00875","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ef22b1b4c69bba2f44a440f68313b57043b3cc23fc7a30ec4fd74da258aaa97","sha256:1fe649df68c1cf27e72dde65ac179f93e5b9c371fd7af7545081422a9153cb26"],"state_sha256":"afbee7d643b4b77edd9718c820e05553a0cb7d669de54fe906cb556bb2f036f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Onx6QJP7ia4hV0gxo+d+3aDBj+WuZGPFZdTSAYOQdDPNyXJ33p9q5vwKjo2Be0N3mUnh250tVcyTg8vbT0rCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T23:56:53.120735Z","bundle_sha256":"de54f9e97da57bf6383ecd35241951c0e5fcf7bb6250d23c4a1b76ce41b8a2af"}}