{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HRV2PEUKWM6X3JG5NG5WJNT3PL","short_pith_number":"pith:HRV2PEUK","schema_version":"1.0","canonical_sha256":"3c6ba7928ab33d7da4dd69bb64b67b7ae6db9fd39e20a26ceaf4f9f40805f11b","source":{"kind":"arxiv","id":"1503.06271","version":1},"attestation_state":"computed","paper":{"title":"Binary Coding in Stream","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amirali Abdullah, Mina Ghashami","submitted_at":"2015-03-21T06:25:02Z","abstract_excerpt":"Big data is becoming ever more ubiquitous, ranging over massive video repositories, document corpuses, image sets and Internet routing history. Proximity search and clustering are two algorithmic primitives fundamental to data analysis, but suffer from the \"curse of dimensionality\" on these gigantic datasets. A popular attack for this problem is to convert object representations into short binary codewords, while approximately preserving near neighbor structure. However, there has been limited research on constructing codewords in the \"streaming\" or \"online\" settings often applicable to this s"},"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":"1503.06271","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-21T06:25:02Z","cross_cats_sorted":[],"title_canon_sha256":"764864359ef7225b241974fb6b3190b2db2e05db40a1b055d1067190d6c37a98","abstract_canon_sha256":"5a1bdadaabc6b15d395f8f1ccd9644cfc16c241954cf263d5d96c2a9d7280f38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:38.884006Z","signature_b64":"nC7qamaqjhJ2VHyGKG7WyVKNwRvbcEEIs3vKPxoeRFabSxwwv3lOXdIjNGhwzl3GkukxCThSMKh8CYWU/bfYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c6ba7928ab33d7da4dd69bb64b67b7ae6db9fd39e20a26ceaf4f9f40805f11b","last_reissued_at":"2026-05-18T02:20:38.883276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:38.883276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary Coding in Stream","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amirali Abdullah, Mina Ghashami","submitted_at":"2015-03-21T06:25:02Z","abstract_excerpt":"Big data is becoming ever more ubiquitous, ranging over massive video repositories, document corpuses, image sets and Internet routing history. Proximity search and clustering are two algorithmic primitives fundamental to data analysis, but suffer from the \"curse of dimensionality\" on these gigantic datasets. A popular attack for this problem is to convert object representations into short binary codewords, while approximately preserving near neighbor structure. However, there has been limited research on constructing codewords in the \"streaming\" or \"online\" settings often applicable to this s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06271","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":"1503.06271","created_at":"2026-05-18T02:20:38.883383+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.06271v1","created_at":"2026-05-18T02:20:38.883383+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06271","created_at":"2026-05-18T02:20:38.883383+00:00"},{"alias_kind":"pith_short_12","alias_value":"HRV2PEUKWM6X","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HRV2PEUKWM6X3JG5","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HRV2PEUK","created_at":"2026-05-18T12:29:25.134429+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/HRV2PEUKWM6X3JG5NG5WJNT3PL","json":"https://pith.science/pith/HRV2PEUKWM6X3JG5NG5WJNT3PL.json","graph_json":"https://pith.science/api/pith-number/HRV2PEUKWM6X3JG5NG5WJNT3PL/graph.json","events_json":"https://pith.science/api/pith-number/HRV2PEUKWM6X3JG5NG5WJNT3PL/events.json","paper":"https://pith.science/paper/HRV2PEUK"},"agent_actions":{"view_html":"https://pith.science/pith/HRV2PEUKWM6X3JG5NG5WJNT3PL","download_json":"https://pith.science/pith/HRV2PEUKWM6X3JG5NG5WJNT3PL.json","view_paper":"https://pith.science/paper/HRV2PEUK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.06271&json=true","fetch_graph":"https://pith.science/api/pith-number/HRV2PEUKWM6X3JG5NG5WJNT3PL/graph.json","fetch_events":"https://pith.science/api/pith-number/HRV2PEUKWM6X3JG5NG5WJNT3PL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HRV2PEUKWM6X3JG5NG5WJNT3PL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HRV2PEUKWM6X3JG5NG5WJNT3PL/action/storage_attestation","attest_author":"https://pith.science/pith/HRV2PEUKWM6X3JG5NG5WJNT3PL/action/author_attestation","sign_citation":"https://pith.science/pith/HRV2PEUKWM6X3JG5NG5WJNT3PL/action/citation_signature","submit_replication":"https://pith.science/pith/HRV2PEUKWM6X3JG5NG5WJNT3PL/action/replication_record"}},"created_at":"2026-05-18T02:20:38.883383+00:00","updated_at":"2026-05-18T02:20:38.883383+00:00"}