{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MEWZ3BPS5MJHRVBMWRZE7JVMXX","short_pith_number":"pith:MEWZ3BPS","schema_version":"1.0","canonical_sha256":"612d9d85f2eb1278d42cb4724fa6acbddbd01ef718072185b0f9813ae8900e07","source":{"kind":"arxiv","id":"1609.00750","version":2},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.00750","created_at":"2026-05-18T01:03:17.292095+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.00750v2","created_at":"2026-05-18T01:03:17.292095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00750","created_at":"2026-05-18T01:03:17.292095+00:00"},{"alias_kind":"pith_short_12","alias_value":"MEWZ3BPS5MJH","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MEWZ3BPS5MJHRVBM","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MEWZ3BPS","created_at":"2026-05-18T12:30:32.724797+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/MEWZ3BPS5MJHRVBMWRZE7JVMXX","json":"https://pith.science/pith/MEWZ3BPS5MJHRVBMWRZE7JVMXX.json","graph_json":"https://pith.science/api/pith-number/MEWZ3BPS5MJHRVBMWRZE7JVMXX/graph.json","events_json":"https://pith.science/api/pith-number/MEWZ3BPS5MJHRVBMWRZE7JVMXX/events.json","paper":"https://pith.science/paper/MEWZ3BPS"},"agent_actions":{"view_html":"https://pith.science/pith/MEWZ3BPS5MJHRVBMWRZE7JVMXX","download_json":"https://pith.science/pith/MEWZ3BPS5MJHRVBMWRZE7JVMXX.json","view_paper":"https://pith.science/paper/MEWZ3BPS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.00750&json=true","fetch_graph":"https://pith.science/api/pith-number/MEWZ3BPS5MJHRVBMWRZE7JVMXX/graph.json","fetch_events":"https://pith.science/api/pith-number/MEWZ3BPS5MJHRVBMWRZE7JVMXX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MEWZ3BPS5MJHRVBMWRZE7JVMXX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MEWZ3BPS5MJHRVBMWRZE7JVMXX/action/storage_attestation","attest_author":"https://pith.science/pith/MEWZ3BPS5MJHRVBMWRZE7JVMXX/action/author_attestation","sign_citation":"https://pith.science/pith/MEWZ3BPS5MJHRVBMWRZE7JVMXX/action/citation_signature","submit_replication":"https://pith.science/pith/MEWZ3BPS5MJHRVBMWRZE7JVMXX/action/replication_record"}},"created_at":"2026-05-18T01:03:17.292095+00:00","updated_at":"2026-05-18T01:03:17.292095+00:00"}