{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZCWFCOMPY3KV6JVX4TEILWTYCK","short_pith_number":"pith:ZCWFCOMP","canonical_record":{"source":{"id":"1702.04956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-16T13:29:30Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"ea76f7d7e4658afd396004b341aa1468940edd494c08e87d6f121d63dbbf0fa2","abstract_canon_sha256":"eb06f369a653881f46e87b3b5b5fe0c2414f78ec19ab7a8705d1d81634853977"},"schema_version":"1.0"},"canonical_sha256":"c8ac51398fc6d55f26b7e4c885da78128ba74e5a8af9fd44b6769f88793a3fdf","source":{"kind":"arxiv","id":"1702.04956","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04956","created_at":"2026-05-18T00:50:36Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04956v1","created_at":"2026-05-18T00:50:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04956","created_at":"2026-05-18T00:50:36Z"},{"alias_kind":"pith_short_12","alias_value":"ZCWFCOMPY3KV","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZCWFCOMPY3KV6JVX","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZCWFCOMP","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZCWFCOMPY3KV6JVX4TEILWTYCK","target":"record","payload":{"canonical_record":{"source":{"id":"1702.04956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-16T13:29:30Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"ea76f7d7e4658afd396004b341aa1468940edd494c08e87d6f121d63dbbf0fa2","abstract_canon_sha256":"eb06f369a653881f46e87b3b5b5fe0c2414f78ec19ab7a8705d1d81634853977"},"schema_version":"1.0"},"canonical_sha256":"c8ac51398fc6d55f26b7e4c885da78128ba74e5a8af9fd44b6769f88793a3fdf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:36.642941Z","signature_b64":"dx5NmSuhvkS4aNepGXBZ99yjxFTLpCvGWIWgpzk0CC0IOpX1EYZtkk+ZeD5tJr7gQAeI1FrfnpDaXcCDvGS9Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8ac51398fc6d55f26b7e4c885da78128ba74e5a8af9fd44b6769f88793a3fdf","last_reissued_at":"2026-05-18T00:50:36.642221Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:36.642221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.04956","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-18T00:50:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HWZHO/zecIZh0MayAUqj3OK7Bp0kWwYd8SXhzhb+o6hEISIn4VIqGz00DcOVNVxg3fHDtpwzyBEjZWydNsMUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:22:20.539167Z"},"content_sha256":"4c681807a665ec06fd298a43fee3ba163e51888bc938d9baf643782f97502b50","schema_version":"1.0","event_id":"sha256:4c681807a665ec06fd298a43fee3ba163e51888bc938d9baf643782f97502b50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZCWFCOMPY3KV6JVX4TEILWTYCK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reflexive Regular Equivalence for Bipartite Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaron Gerow, Feng Shi, Mingyang Zhou, Stan Matwin","submitted_at":"2017-02-16T13:29:30Z","abstract_excerpt":"Bipartite data is common in data engineering and brings unique challenges, particularly when it comes to clustering tasks that impose on strong structural assumptions. This work presents an unsupervised method for assessing similarity in bipartite data. Similar to some co-clustering methods, the method is based on regular equivalence in graphs. The algorithm uses spectral properties of a bipartite adjacency matrix to estimate similarity in both dimensions. The method is reflexive in that similarity in one dimension is used to inform similarity in the other. Reflexive regular equivalence can al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04956","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-18T00:50:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"koH89yZrLdh0pdZ6OeEObG3913EhF+ADlkiaHQPFqtK8mGN8TLWVXE90HCgeileBrQSJwvqRe4vQXkwqm2nfAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:22:20.539711Z"},"content_sha256":"7ea5ae91a752a9d9abe6534f990fa6b1e2c807c604f25e19fc8b78794b0aaf51","schema_version":"1.0","event_id":"sha256:7ea5ae91a752a9d9abe6534f990fa6b1e2c807c604f25e19fc8b78794b0aaf51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZCWFCOMPY3KV6JVX4TEILWTYCK/bundle.json","state_url":"https://pith.science/pith/ZCWFCOMPY3KV6JVX4TEILWTYCK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZCWFCOMPY3KV6JVX4TEILWTYCK/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-01T06:22:20Z","links":{"resolver":"https://pith.science/pith/ZCWFCOMPY3KV6JVX4TEILWTYCK","bundle":"https://pith.science/pith/ZCWFCOMPY3KV6JVX4TEILWTYCK/bundle.json","state":"https://pith.science/pith/ZCWFCOMPY3KV6JVX4TEILWTYCK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZCWFCOMPY3KV6JVX4TEILWTYCK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZCWFCOMPY3KV6JVX4TEILWTYCK","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":"eb06f369a653881f46e87b3b5b5fe0c2414f78ec19ab7a8705d1d81634853977","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-16T13:29:30Z","title_canon_sha256":"ea76f7d7e4658afd396004b341aa1468940edd494c08e87d6f121d63dbbf0fa2"},"schema_version":"1.0","source":{"id":"1702.04956","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04956","created_at":"2026-05-18T00:50:36Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04956v1","created_at":"2026-05-18T00:50:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04956","created_at":"2026-05-18T00:50:36Z"},{"alias_kind":"pith_short_12","alias_value":"ZCWFCOMPY3KV","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZCWFCOMPY3KV6JVX","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZCWFCOMP","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:7ea5ae91a752a9d9abe6534f990fa6b1e2c807c604f25e19fc8b78794b0aaf51","target":"graph","created_at":"2026-05-18T00:50:36Z","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":"Bipartite data is common in data engineering and brings unique challenges, particularly when it comes to clustering tasks that impose on strong structural assumptions. This work presents an unsupervised method for assessing similarity in bipartite data. Similar to some co-clustering methods, the method is based on regular equivalence in graphs. The algorithm uses spectral properties of a bipartite adjacency matrix to estimate similarity in both dimensions. The method is reflexive in that similarity in one dimension is used to inform similarity in the other. Reflexive regular equivalence can al","authors_text":"Aaron Gerow, Feng Shi, Mingyang Zhou, Stan Matwin","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-16T13:29:30Z","title":"Reflexive Regular Equivalence for Bipartite Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04956","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:4c681807a665ec06fd298a43fee3ba163e51888bc938d9baf643782f97502b50","target":"record","created_at":"2026-05-18T00:50:36Z","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":"eb06f369a653881f46e87b3b5b5fe0c2414f78ec19ab7a8705d1d81634853977","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-02-16T13:29:30Z","title_canon_sha256":"ea76f7d7e4658afd396004b341aa1468940edd494c08e87d6f121d63dbbf0fa2"},"schema_version":"1.0","source":{"id":"1702.04956","kind":"arxiv","version":1}},"canonical_sha256":"c8ac51398fc6d55f26b7e4c885da78128ba74e5a8af9fd44b6769f88793a3fdf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8ac51398fc6d55f26b7e4c885da78128ba74e5a8af9fd44b6769f88793a3fdf","first_computed_at":"2026-05-18T00:50:36.642221Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:36.642221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dx5NmSuhvkS4aNepGXBZ99yjxFTLpCvGWIWgpzk0CC0IOpX1EYZtkk+ZeD5tJr7gQAeI1FrfnpDaXcCDvGS9Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:36.642941Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.04956","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c681807a665ec06fd298a43fee3ba163e51888bc938d9baf643782f97502b50","sha256:7ea5ae91a752a9d9abe6534f990fa6b1e2c807c604f25e19fc8b78794b0aaf51"],"state_sha256":"3976c6bd606e633af86cbeae525e87f6bd8e931a81150bc564af2349e4776b9a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ivP8ucOdxsKHBo7lgOXcDE0fYhbNz1iJFDa7txsKFiCQPmsECp5PQTxjM7Q5jOTo4bV5/MY/su+JlqoeXLZ7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:22:20.542350Z","bundle_sha256":"3cea410cee991a6923801a421d3410d4f0048e04a2a470117122729b7be2b99b"}}