{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YT5VHXCAUCYM2K2LFZCSEWIHNU","short_pith_number":"pith:YT5VHXCA","schema_version":"1.0","canonical_sha256":"c4fb53dc40a0b0cd2b4b2e452259076d38c25c6f03d10da8a0111c4d268b92cb","source":{"kind":"arxiv","id":"1310.4843","version":1},"attestation_state":"computed","paper":{"title":"Scalable Boolean Tensor Factorizations using Random Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"D\\'ora Erd\\H{o}s, Pauli Miettinen","submitted_at":"2013-10-17T20:09:48Z","abstract_excerpt":"Tensors are becoming increasingly common in data mining, and consequently, tensor factorizations are becoming more and more important tools for data miners. When the data is binary, it is natural to ask if we can factorize it into binary factors while simultaneously making sure that the reconstructed tensor is still binary. Such factorizations, called Boolean tensor factorizations, can provide improved interpretability and find Boolean structure that is hard to express using normal factorizations. Unfortunately the algorithms for computing Boolean tensor factorizations do not usually scale wel"},"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":"1310.4843","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-17T20:09:48Z","cross_cats_sorted":[],"title_canon_sha256":"c90b32b1b844549120a6af5eb0473ac5d7d75c014a634f6aa59bd73e52da5c0d","abstract_canon_sha256":"1a7a982c0968d277bf07333520a1b801f9e3f59714ed7e993db89cd9db08291d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:02.532469Z","signature_b64":"/1PoyR6RdsfViMrpfbuYCSbP+4kba8t3C+T2QYzo179Yp9apwaKg+p3Gjpfzn7XiIDn12hsYLTC91ez2yQEABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4fb53dc40a0b0cd2b4b2e452259076d38c25c6f03d10da8a0111c4d268b92cb","last_reissued_at":"2026-05-18T03:10:02.531615Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:02.531615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Boolean Tensor Factorizations using Random Walks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"D\\'ora Erd\\H{o}s, Pauli Miettinen","submitted_at":"2013-10-17T20:09:48Z","abstract_excerpt":"Tensors are becoming increasingly common in data mining, and consequently, tensor factorizations are becoming more and more important tools for data miners. When the data is binary, it is natural to ask if we can factorize it into binary factors while simultaneously making sure that the reconstructed tensor is still binary. Such factorizations, called Boolean tensor factorizations, can provide improved interpretability and find Boolean structure that is hard to express using normal factorizations. Unfortunately the algorithms for computing Boolean tensor factorizations do not usually scale wel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4843","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":"1310.4843","created_at":"2026-05-18T03:10:02.531754+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.4843v1","created_at":"2026-05-18T03:10:02.531754+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4843","created_at":"2026-05-18T03:10:02.531754+00:00"},{"alias_kind":"pith_short_12","alias_value":"YT5VHXCAUCYM","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"YT5VHXCAUCYM2K2L","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"YT5VHXCA","created_at":"2026-05-18T12:28:09.283467+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/YT5VHXCAUCYM2K2LFZCSEWIHNU","json":"https://pith.science/pith/YT5VHXCAUCYM2K2LFZCSEWIHNU.json","graph_json":"https://pith.science/api/pith-number/YT5VHXCAUCYM2K2LFZCSEWIHNU/graph.json","events_json":"https://pith.science/api/pith-number/YT5VHXCAUCYM2K2LFZCSEWIHNU/events.json","paper":"https://pith.science/paper/YT5VHXCA"},"agent_actions":{"view_html":"https://pith.science/pith/YT5VHXCAUCYM2K2LFZCSEWIHNU","download_json":"https://pith.science/pith/YT5VHXCAUCYM2K2LFZCSEWIHNU.json","view_paper":"https://pith.science/paper/YT5VHXCA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.4843&json=true","fetch_graph":"https://pith.science/api/pith-number/YT5VHXCAUCYM2K2LFZCSEWIHNU/graph.json","fetch_events":"https://pith.science/api/pith-number/YT5VHXCAUCYM2K2LFZCSEWIHNU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YT5VHXCAUCYM2K2LFZCSEWIHNU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YT5VHXCAUCYM2K2LFZCSEWIHNU/action/storage_attestation","attest_author":"https://pith.science/pith/YT5VHXCAUCYM2K2LFZCSEWIHNU/action/author_attestation","sign_citation":"https://pith.science/pith/YT5VHXCAUCYM2K2LFZCSEWIHNU/action/citation_signature","submit_replication":"https://pith.science/pith/YT5VHXCAUCYM2K2LFZCSEWIHNU/action/replication_record"}},"created_at":"2026-05-18T03:10:02.531754+00:00","updated_at":"2026-05-18T03:10:02.531754+00:00"}