{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:C4KIOO2IO7PC2HKYIS6FDMACOI","short_pith_number":"pith:C4KIOO2I","canonical_record":{"source":{"id":"1112.2755","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-12-13T00:19:17Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"9442bbcb91cbc07c74d0404df9931d79ed32abb99885322d66120f0a1d46eea2","abstract_canon_sha256":"d63c31eb06791127d771fd3cd2d15cb49a966eb71ede20d893a2dd0ecd73e2ff"},"schema_version":"1.0"},"canonical_sha256":"1714873b4877de2d1d5844bc51b00272019dab5f4fd6c08574c6a1ef7885e173","source":{"kind":"arxiv","id":"1112.2755","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2755","created_at":"2026-05-18T04:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2755v1","created_at":"2026-05-18T04:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2755","created_at":"2026-05-18T04:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"C4KIOO2IO7PC","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"C4KIOO2IO7PC2HKY","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"C4KIOO2I","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:C4KIOO2IO7PC2HKYIS6FDMACOI","target":"record","payload":{"canonical_record":{"source":{"id":"1112.2755","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-12-13T00:19:17Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"9442bbcb91cbc07c74d0404df9931d79ed32abb99885322d66120f0a1d46eea2","abstract_canon_sha256":"d63c31eb06791127d771fd3cd2d15cb49a966eb71ede20d893a2dd0ecd73e2ff"},"schema_version":"1.0"},"canonical_sha256":"1714873b4877de2d1d5844bc51b00272019dab5f4fd6c08574c6a1ef7885e173","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:32.583985Z","signature_b64":"ejuH/xkjtZx/PBhDCpMBcL55z1hhQmfSv5qCEsHnzXPoSconhs5tLm9SWjSORPlodH4IPZX/wq+ccoYa29MHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1714873b4877de2d1d5844bc51b00272019dab5f4fd6c08574c6a1ef7885e173","last_reissued_at":"2026-05-18T04:06:32.583263Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:32.583263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.2755","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-18T04:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2PQyCUbMMU/jsdNLme/ffEvz6BgQ6g4JQKOphzr5s0tjL2AOc9x/rbpeXURB5z+Age6tLdbcq8+yP9gayGquCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:47:24.147841Z"},"content_sha256":"be0214c7919ff3aab6b685a833c3ba629808af00119c400511a5af34897b908d","schema_version":"1.0","event_id":"sha256:be0214c7919ff3aab6b685a833c3ba629808af00119c400511a5af34897b908d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:C4KIOO2IO7PC2HKYIS6FDMACOI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using Proximity to Predict Activity in Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Jeon-Hyung Kang, Kristina Lerman, Rumi Ghosh, Suradej Intagorn","submitted_at":"2011-12-13T00:19:17Z","abstract_excerpt":"The structure of a social network contains information useful for predicting its evolution. Nodes that are \"close\" in some sense are more likely to become linked in the future than more distant nodes. We show that structural information can also help predict node activity. We use proximity to capture the degree to which two nodes are \"close\" to each other in the network. In addition to standard proximity metrics used in the link prediction task, such as neighborhood overlap, we introduce new metrics that model different types of interactions that can occur between network nodes. We argue that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2755","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-18T04:06:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7sE/qt7yAlePIfvM/ekh8yULvGzH8hP1KeDmt7cvc4EHwKX2hf7t6zOnrkwJlsL6EJrT7KbfXiueskttUrbHBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:47:24.148194Z"},"content_sha256":"dfd20fa2f01aa063f8c58dcae1f14b88f8bbf8a0c55a83a84e14f7c4f30bf153","schema_version":"1.0","event_id":"sha256:dfd20fa2f01aa063f8c58dcae1f14b88f8bbf8a0c55a83a84e14f7c4f30bf153"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C4KIOO2IO7PC2HKYIS6FDMACOI/bundle.json","state_url":"https://pith.science/pith/C4KIOO2IO7PC2HKYIS6FDMACOI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C4KIOO2IO7PC2HKYIS6FDMACOI/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-01T20:47:24Z","links":{"resolver":"https://pith.science/pith/C4KIOO2IO7PC2HKYIS6FDMACOI","bundle":"https://pith.science/pith/C4KIOO2IO7PC2HKYIS6FDMACOI/bundle.json","state":"https://pith.science/pith/C4KIOO2IO7PC2HKYIS6FDMACOI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C4KIOO2IO7PC2HKYIS6FDMACOI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:C4KIOO2IO7PC2HKYIS6FDMACOI","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":"d63c31eb06791127d771fd3cd2d15cb49a966eb71ede20d893a2dd0ecd73e2ff","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-12-13T00:19:17Z","title_canon_sha256":"9442bbcb91cbc07c74d0404df9931d79ed32abb99885322d66120f0a1d46eea2"},"schema_version":"1.0","source":{"id":"1112.2755","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2755","created_at":"2026-05-18T04:06:32Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2755v1","created_at":"2026-05-18T04:06:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2755","created_at":"2026-05-18T04:06:32Z"},{"alias_kind":"pith_short_12","alias_value":"C4KIOO2IO7PC","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"C4KIOO2IO7PC2HKY","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"C4KIOO2I","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:dfd20fa2f01aa063f8c58dcae1f14b88f8bbf8a0c55a83a84e14f7c4f30bf153","target":"graph","created_at":"2026-05-18T04:06:32Z","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":"The structure of a social network contains information useful for predicting its evolution. Nodes that are \"close\" in some sense are more likely to become linked in the future than more distant nodes. We show that structural information can also help predict node activity. We use proximity to capture the degree to which two nodes are \"close\" to each other in the network. In addition to standard proximity metrics used in the link prediction task, such as neighborhood overlap, we introduce new metrics that model different types of interactions that can occur between network nodes. We argue that ","authors_text":"Jeon-Hyung Kang, Kristina Lerman, Rumi Ghosh, Suradej Intagorn","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-12-13T00:19:17Z","title":"Using Proximity to Predict Activity in Social Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2755","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:be0214c7919ff3aab6b685a833c3ba629808af00119c400511a5af34897b908d","target":"record","created_at":"2026-05-18T04:06:32Z","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":"d63c31eb06791127d771fd3cd2d15cb49a966eb71ede20d893a2dd0ecd73e2ff","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2011-12-13T00:19:17Z","title_canon_sha256":"9442bbcb91cbc07c74d0404df9931d79ed32abb99885322d66120f0a1d46eea2"},"schema_version":"1.0","source":{"id":"1112.2755","kind":"arxiv","version":1}},"canonical_sha256":"1714873b4877de2d1d5844bc51b00272019dab5f4fd6c08574c6a1ef7885e173","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1714873b4877de2d1d5844bc51b00272019dab5f4fd6c08574c6a1ef7885e173","first_computed_at":"2026-05-18T04:06:32.583263Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:32.583263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ejuH/xkjtZx/PBhDCpMBcL55z1hhQmfSv5qCEsHnzXPoSconhs5tLm9SWjSORPlodH4IPZX/wq+ccoYa29MHAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:32.583985Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.2755","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be0214c7919ff3aab6b685a833c3ba629808af00119c400511a5af34897b908d","sha256:dfd20fa2f01aa063f8c58dcae1f14b88f8bbf8a0c55a83a84e14f7c4f30bf153"],"state_sha256":"4ff42ce26e1282fdc5e91df401e330a15f3dd87548236f3dfb63581818cd1a78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4g8yfavmPtoMRDiLwa6ymweB2nYP0Ou1PGbsMXnasHlGenXRCOAQsPQLxIgluOs4Or6UAZJGubTzIiegSemhAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:47:24.150392Z","bundle_sha256":"553ddea19486f9160571ab6ef4cc2033716a2ec463227c217568d1ac22544213"}}