{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FDRQOJABHT6K5RHZUGCC26WL36","short_pith_number":"pith:FDRQOJAB","schema_version":"1.0","canonical_sha256":"28e30724013cfcaec4f9a1842d7acbdfacaf823e776fc921bce490172aacc6cd","source":{"kind":"arxiv","id":"1708.06750","version":3},"attestation_state":"computed","paper":{"title":"Bitwise Source Separation on Hashed Spectra: An Efficient Posterior Estimation Scheme Using Partial Rank Order Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SD","authors_text":"Lijiang Guo, Minje Kim","submitted_at":"2017-08-22T17:55:29Z","abstract_excerpt":"This paper proposes an efficient bitwise solution to the single-channel source separation task. Most dictionary-based source separation algorithms rely on iterative update rules during the run time, which becomes computationally costly especially when we employ an overcomplete dictionary and sparse encoding that tend to give better separation results. To avoid such cost we propose a bitwise scheme on hashed spectra that leads to an efficient posterior probability calculation. For each source, the algorithm uses a partial rank order metric to extract robust features that form a binarized dictio"},"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":"1708.06750","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SD","submitted_at":"2017-08-22T17:55:29Z","cross_cats_sorted":[],"title_canon_sha256":"a2316c1bd051b7cad12434f74bf446d65d0299ee28728bc657559bfe0df681b8","abstract_canon_sha256":"c888694ef86f032d13c15a60aaef679b1cfbe3131b3551a1e0a6e54527e53060"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:10.399162Z","signature_b64":"YgT/nMSMT63GHeUWVS0W8NNKZRhG6D7bQOI1In0l72kWfqrlBzSSzS95bI6q67xykiXhDnJ4OchQ2tmuyVn5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28e30724013cfcaec4f9a1842d7acbdfacaf823e776fc921bce490172aacc6cd","last_reissued_at":"2026-05-18T00:29:10.398580Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:10.398580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bitwise Source Separation on Hashed Spectra: An Efficient Posterior Estimation Scheme Using Partial Rank Order Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SD","authors_text":"Lijiang Guo, Minje Kim","submitted_at":"2017-08-22T17:55:29Z","abstract_excerpt":"This paper proposes an efficient bitwise solution to the single-channel source separation task. Most dictionary-based source separation algorithms rely on iterative update rules during the run time, which becomes computationally costly especially when we employ an overcomplete dictionary and sparse encoding that tend to give better separation results. To avoid such cost we propose a bitwise scheme on hashed spectra that leads to an efficient posterior probability calculation. For each source, the algorithm uses a partial rank order metric to extract robust features that form a binarized dictio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06750","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":"1708.06750","created_at":"2026-05-18T00:29:10.398673+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.06750v3","created_at":"2026-05-18T00:29:10.398673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06750","created_at":"2026-05-18T00:29:10.398673+00:00"},{"alias_kind":"pith_short_12","alias_value":"FDRQOJABHT6K","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FDRQOJABHT6K5RHZ","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FDRQOJAB","created_at":"2026-05-18T12:31:15.632608+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/FDRQOJABHT6K5RHZUGCC26WL36","json":"https://pith.science/pith/FDRQOJABHT6K5RHZUGCC26WL36.json","graph_json":"https://pith.science/api/pith-number/FDRQOJABHT6K5RHZUGCC26WL36/graph.json","events_json":"https://pith.science/api/pith-number/FDRQOJABHT6K5RHZUGCC26WL36/events.json","paper":"https://pith.science/paper/FDRQOJAB"},"agent_actions":{"view_html":"https://pith.science/pith/FDRQOJABHT6K5RHZUGCC26WL36","download_json":"https://pith.science/pith/FDRQOJABHT6K5RHZUGCC26WL36.json","view_paper":"https://pith.science/paper/FDRQOJAB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.06750&json=true","fetch_graph":"https://pith.science/api/pith-number/FDRQOJABHT6K5RHZUGCC26WL36/graph.json","fetch_events":"https://pith.science/api/pith-number/FDRQOJABHT6K5RHZUGCC26WL36/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FDRQOJABHT6K5RHZUGCC26WL36/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FDRQOJABHT6K5RHZUGCC26WL36/action/storage_attestation","attest_author":"https://pith.science/pith/FDRQOJABHT6K5RHZUGCC26WL36/action/author_attestation","sign_citation":"https://pith.science/pith/FDRQOJABHT6K5RHZUGCC26WL36/action/citation_signature","submit_replication":"https://pith.science/pith/FDRQOJABHT6K5RHZUGCC26WL36/action/replication_record"}},"created_at":"2026-05-18T00:29:10.398673+00:00","updated_at":"2026-05-18T00:29:10.398673+00:00"}