{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MEWZ3BPS5MJHRVBMWRZE7JVMXX","short_pith_number":"pith:MEWZ3BPS","canonical_record":{"source":{"id":"1609.00750","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-02T21:24:22Z","cross_cats_sorted":["cs.DM","cs.SI"],"title_canon_sha256":"6e5b47859a6fb1a72452af66a451c5f20debfb6f000a23fc4349b421f52987a0","abstract_canon_sha256":"27b8e484e31962420f10ef3db360789388e601fd4d5a8e481e55aff5f76246f0"},"schema_version":"1.0"},"canonical_sha256":"612d9d85f2eb1278d42cb4724fa6acbddbd01ef718072185b0f9813ae8900e07","source":{"kind":"arxiv","id":"1609.00750","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00750","created_at":"2026-05-18T01:03:17Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00750v2","created_at":"2026-05-18T01:03:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00750","created_at":"2026-05-18T01:03:17Z"},{"alias_kind":"pith_short_12","alias_value":"MEWZ3BPS5MJH","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MEWZ3BPS5MJHRVBM","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MEWZ3BPS","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MEWZ3BPS5MJHRVBMWRZE7JVMXX","target":"record","payload":{"canonical_record":{"source":{"id":"1609.00750","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-02T21:24:22Z","cross_cats_sorted":["cs.DM","cs.SI"],"title_canon_sha256":"6e5b47859a6fb1a72452af66a451c5f20debfb6f000a23fc4349b421f52987a0","abstract_canon_sha256":"27b8e484e31962420f10ef3db360789388e601fd4d5a8e481e55aff5f76246f0"},"schema_version":"1.0"},"canonical_sha256":"612d9d85f2eb1278d42cb4724fa6acbddbd01ef718072185b0f9813ae8900e07","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:17.292719Z","signature_b64":"UwaKtsYb4Qy2YTWzspmP9TMJktBONneC7r7YmdxNN7nikH+r5gP+RqGzW0Ce1d/YLtWk4fpn70bF8BUpidw4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"612d9d85f2eb1278d42cb4724fa6acbddbd01ef718072185b0f9813ae8900e07","last_reissued_at":"2026-05-18T01:03:17.291976Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:17.291976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.00750","source_version":2,"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-18T01:03:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+QVKQ2Et39aOXkJauvzauRBoLFtLosO82eycsi33MCqqkw4fFUQ1B+tc9h3vHTAljBL1dpSN0Qi3Ub6buv3dDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:21:21.524923Z"},"content_sha256":"db7e9d7a68e53be9e74d56e18162a936404172fc93f8bf856940889233df72c8","schema_version":"1.0","event_id":"sha256:db7e9d7a68e53be9e74d56e18162a936404172fc93f8bf856940889233df72c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MEWZ3BPS5MJHRVBMWRZE7JVMXX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Predicting Signed Edges with $O(n^{1+o(1)} \\log{n})$ Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI"],"primary_cat":"cs.DS","authors_text":"Charalampos E. Tsourakakis, Michael Mitzenmacher","submitted_at":"2016-09-02T21:24:22Z","abstract_excerpt":"Social networks and interactions in social media involve both positive and negative relationships. Signed graphs capture both types of relationships: positive edges correspond to pairs of \"friends\", and negative edges to pairs of \"foes\". The {\\em edge sign prediction problem}, which aims to predict whether an interaction between a pair of nodes will be positive or negative, is an important graph mining task for which many heuristics have recently been proposed \\cite{leskovec2010predicting,leskovec2010signed}.\n  Motivated by social balance theory, we model the edge sign prediction problem as a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00750","kind":"arxiv","version":2},"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-18T01:03:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YTxIiVTuYitRii5k2SSHR41f7g/lSHNEx/Zc6uWvpi1It1fYhk+WGBntfSxUTv2S+Fk2rqrnQQ6JBM3QzZOqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T04:21:21.525268Z"},"content_sha256":"6c7d458ec48cb42adb67992a03b8ff77fb6ea3d69dbecc08a9bb397fd5a06afa","schema_version":"1.0","event_id":"sha256:6c7d458ec48cb42adb67992a03b8ff77fb6ea3d69dbecc08a9bb397fd5a06afa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MEWZ3BPS5MJHRVBMWRZE7JVMXX/bundle.json","state_url":"https://pith.science/pith/MEWZ3BPS5MJHRVBMWRZE7JVMXX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MEWZ3BPS5MJHRVBMWRZE7JVMXX/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-20T04:21:21Z","links":{"resolver":"https://pith.science/pith/MEWZ3BPS5MJHRVBMWRZE7JVMXX","bundle":"https://pith.science/pith/MEWZ3BPS5MJHRVBMWRZE7JVMXX/bundle.json","state":"https://pith.science/pith/MEWZ3BPS5MJHRVBMWRZE7JVMXX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MEWZ3BPS5MJHRVBMWRZE7JVMXX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MEWZ3BPS5MJHRVBMWRZE7JVMXX","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":"27b8e484e31962420f10ef3db360789388e601fd4d5a8e481e55aff5f76246f0","cross_cats_sorted":["cs.DM","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-02T21:24:22Z","title_canon_sha256":"6e5b47859a6fb1a72452af66a451c5f20debfb6f000a23fc4349b421f52987a0"},"schema_version":"1.0","source":{"id":"1609.00750","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00750","created_at":"2026-05-18T01:03:17Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00750v2","created_at":"2026-05-18T01:03:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00750","created_at":"2026-05-18T01:03:17Z"},{"alias_kind":"pith_short_12","alias_value":"MEWZ3BPS5MJH","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MEWZ3BPS5MJHRVBM","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MEWZ3BPS","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:6c7d458ec48cb42adb67992a03b8ff77fb6ea3d69dbecc08a9bb397fd5a06afa","target":"graph","created_at":"2026-05-18T01:03:17Z","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 networks and interactions in social media involve both positive and negative relationships. Signed graphs capture both types of relationships: positive edges correspond to pairs of \"friends\", and negative edges to pairs of \"foes\". The {\\em edge sign prediction problem}, which aims to predict whether an interaction between a pair of nodes will be positive or negative, is an important graph mining task for which many heuristics have recently been proposed \\cite{leskovec2010predicting,leskovec2010signed}.\n  Motivated by social balance theory, we model the edge sign prediction problem as a ","authors_text":"Charalampos E. Tsourakakis, Michael Mitzenmacher","cross_cats":["cs.DM","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-02T21:24:22Z","title":"Predicting Signed Edges with $O(n^{1+o(1)} \\log{n})$ Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00750","kind":"arxiv","version":2},"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:db7e9d7a68e53be9e74d56e18162a936404172fc93f8bf856940889233df72c8","target":"record","created_at":"2026-05-18T01:03:17Z","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":"27b8e484e31962420f10ef3db360789388e601fd4d5a8e481e55aff5f76246f0","cross_cats_sorted":["cs.DM","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-02T21:24:22Z","title_canon_sha256":"6e5b47859a6fb1a72452af66a451c5f20debfb6f000a23fc4349b421f52987a0"},"schema_version":"1.0","source":{"id":"1609.00750","kind":"arxiv","version":2}},"canonical_sha256":"612d9d85f2eb1278d42cb4724fa6acbddbd01ef718072185b0f9813ae8900e07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"612d9d85f2eb1278d42cb4724fa6acbddbd01ef718072185b0f9813ae8900e07","first_computed_at":"2026-05-18T01:03:17.291976Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:17.291976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UwaKtsYb4Qy2YTWzspmP9TMJktBONneC7r7YmdxNN7nikH+r5gP+RqGzW0Ce1d/YLtWk4fpn70bF8BUpidw4Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:17.292719Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.00750","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db7e9d7a68e53be9e74d56e18162a936404172fc93f8bf856940889233df72c8","sha256:6c7d458ec48cb42adb67992a03b8ff77fb6ea3d69dbecc08a9bb397fd5a06afa"],"state_sha256":"55553cc797d77c3dc49fc8514f9a21b309d1c1b20e22bb949bd8f129319367f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G1ooQmJoCdWFLnpJKjb4YJQL8qDV78H3kIwD1WfokUjH4EPQilGRrsb+vcHDd3SElOn1Z70bIQS+8WAcrFiyAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T04:21:21.527444Z","bundle_sha256":"ff87d4c398f8e0e210e6a0f0a7a72ca6d9d6c418821c3b58775b1c58c91f395e"}}