{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:Q4ZOON2PTS5AV7KV6YDEUSVSSV","short_pith_number":"pith:Q4ZOON2P","canonical_record":{"source":{"id":"1504.06394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-04-24T05:01:12Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"249283885ce53feaed94f3142dbe9ee0fdfb3ec661cb803916e9c3a1dca18055","abstract_canon_sha256":"2a1bf34a35e5b8f9c918945ff66b61951384d7ba65c067e0faca6a7227551053"},"schema_version":"1.0"},"canonical_sha256":"8732e7374f9cba0afd55f6064a4ab29549f725a3ff1befe42fc185ad04b85f79","source":{"kind":"arxiv","id":"1504.06394","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06394","created_at":"2026-05-18T02:17:53Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06394v1","created_at":"2026-05-18T02:17:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06394","created_at":"2026-05-18T02:17:53Z"},{"alias_kind":"pith_short_12","alias_value":"Q4ZOON2PTS5A","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q4ZOON2PTS5AV7KV","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q4ZOON2P","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:Q4ZOON2PTS5AV7KV6YDEUSVSSV","target":"record","payload":{"canonical_record":{"source":{"id":"1504.06394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-04-24T05:01:12Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"249283885ce53feaed94f3142dbe9ee0fdfb3ec661cb803916e9c3a1dca18055","abstract_canon_sha256":"2a1bf34a35e5b8f9c918945ff66b61951384d7ba65c067e0faca6a7227551053"},"schema_version":"1.0"},"canonical_sha256":"8732e7374f9cba0afd55f6064a4ab29549f725a3ff1befe42fc185ad04b85f79","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:53.789390Z","signature_b64":"11k2QVMEkQS2wsQqlvCUZEkWQ7RI3Pu8ERK1n8mVI3wbhqCrQEqktNWIhjgQ+0I46/Bp6+yL9DInQ4X2g/sPBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8732e7374f9cba0afd55f6064a4ab29549f725a3ff1befe42fc185ad04b85f79","last_reissued_at":"2026-05-18T02:17:53.788618Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:53.788618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.06394","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-05-18T02:17:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bSfzIF9UMY12/NfTViF34QLUzP/Q/wSlgn8RKNoKobo6cbpfPeDkoT5Mr8CerQ4BDh7Jgc/Q0beE1X9KVKEGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:28:44.560593Z"},"content_sha256":"a6c95c832be4a3dd75d3b14f06d02c275ef65c4fc64e4bf2c624269679669ad8","schema_version":"1.0","event_id":"sha256:a6c95c832be4a3dd75d3b14f06d02c275ef65c4fc64e4bf2c624269679669ad8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:Q4ZOON2PTS5AV7KV6YDEUSVSSV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Social Trust Prediction via Max-norm Constrained 1-bit Matrix Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Huan Xu, Jie Shen, Jing Wang","submitted_at":"2015-04-24T05:01:12Z","abstract_excerpt":"Social trust prediction addresses the significant problem of exploring interactions among users in social networks. Naturally, this problem can be formulated in the matrix completion framework, with each entry indicating the trustness or distrustness. However, there are two challenges for the social trust problem: 1) the observed data are with sign (1-bit) measurements; 2) they are typically sampled non-uniformly. Most of the previous matrix completion methods do not well handle the two issues. Motivated by the recent progress of max-norm, we propose to solve the problem with a 1-bit max-norm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06394","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"},"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-05-18T02:17:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Yoe1Gr1gAjuT2FtsEOdDnyhbJIEqE5YBvKApfnWcpxW64/ZaHjv/Gmhle3eSHxzo6teNcVq0b+FlLiI0ghgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:28:44.560918Z"},"content_sha256":"0acef4db77d929779dda8d9765059f90c0ed563940b59f462134a1409cfec81e","schema_version":"1.0","event_id":"sha256:0acef4db77d929779dda8d9765059f90c0ed563940b59f462134a1409cfec81e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q4ZOON2PTS5AV7KV6YDEUSVSSV/bundle.json","state_url":"https://pith.science/pith/Q4ZOON2PTS5AV7KV6YDEUSVSSV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q4ZOON2PTS5AV7KV6YDEUSVSSV/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-06-06T16:28:44Z","links":{"resolver":"https://pith.science/pith/Q4ZOON2PTS5AV7KV6YDEUSVSSV","bundle":"https://pith.science/pith/Q4ZOON2PTS5AV7KV6YDEUSVSSV/bundle.json","state":"https://pith.science/pith/Q4ZOON2PTS5AV7KV6YDEUSVSSV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q4ZOON2PTS5AV7KV6YDEUSVSSV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:Q4ZOON2PTS5AV7KV6YDEUSVSSV","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":"2a1bf34a35e5b8f9c918945ff66b61951384d7ba65c067e0faca6a7227551053","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-04-24T05:01:12Z","title_canon_sha256":"249283885ce53feaed94f3142dbe9ee0fdfb3ec661cb803916e9c3a1dca18055"},"schema_version":"1.0","source":{"id":"1504.06394","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06394","created_at":"2026-05-18T02:17:53Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06394v1","created_at":"2026-05-18T02:17:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06394","created_at":"2026-05-18T02:17:53Z"},{"alias_kind":"pith_short_12","alias_value":"Q4ZOON2PTS5A","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q4ZOON2PTS5AV7KV","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q4ZOON2P","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:0acef4db77d929779dda8d9765059f90c0ed563940b59f462134a1409cfec81e","target":"graph","created_at":"2026-05-18T02:17:53Z","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"},"paper":{"abstract_excerpt":"Social trust prediction addresses the significant problem of exploring interactions among users in social networks. Naturally, this problem can be formulated in the matrix completion framework, with each entry indicating the trustness or distrustness. However, there are two challenges for the social trust problem: 1) the observed data are with sign (1-bit) measurements; 2) they are typically sampled non-uniformly. Most of the previous matrix completion methods do not well handle the two issues. Motivated by the recent progress of max-norm, we propose to solve the problem with a 1-bit max-norm ","authors_text":"Huan Xu, Jie Shen, Jing Wang","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-04-24T05:01:12Z","title":"Social Trust Prediction via Max-norm Constrained 1-bit Matrix Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06394","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:a6c95c832be4a3dd75d3b14f06d02c275ef65c4fc64e4bf2c624269679669ad8","target":"record","created_at":"2026-05-18T02:17:53Z","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":"2a1bf34a35e5b8f9c918945ff66b61951384d7ba65c067e0faca6a7227551053","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-04-24T05:01:12Z","title_canon_sha256":"249283885ce53feaed94f3142dbe9ee0fdfb3ec661cb803916e9c3a1dca18055"},"schema_version":"1.0","source":{"id":"1504.06394","kind":"arxiv","version":1}},"canonical_sha256":"8732e7374f9cba0afd55f6064a4ab29549f725a3ff1befe42fc185ad04b85f79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8732e7374f9cba0afd55f6064a4ab29549f725a3ff1befe42fc185ad04b85f79","first_computed_at":"2026-05-18T02:17:53.788618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:53.788618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"11k2QVMEkQS2wsQqlvCUZEkWQ7RI3Pu8ERK1n8mVI3wbhqCrQEqktNWIhjgQ+0I46/Bp6+yL9DInQ4X2g/sPBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:53.789390Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.06394","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6c95c832be4a3dd75d3b14f06d02c275ef65c4fc64e4bf2c624269679669ad8","sha256:0acef4db77d929779dda8d9765059f90c0ed563940b59f462134a1409cfec81e"],"state_sha256":"c3810e9c5a7794c7f4318375cf29957763a05a1fcf19301d5cca4c0e0a6e96cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TIKFqKtyp0J7a2C6iMnJI7xjO3Ym3wOpFPXCv8Ao2cSDaM4jIE9VCW1wsuphP62bhEF1ym5ybYtOdS9ral59Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:28:44.562698Z","bundle_sha256":"04000e54198ec49792c10324655f097e298437e7301034ccfd28655137304d5a"}}