{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:B2U6M7ZQ2XJQBC7TADOGPKBGJP","short_pith_number":"pith:B2U6M7ZQ","canonical_record":{"source":{"id":"1702.07390","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-23T20:57:13Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"2effbefef184a032f90a0feefa1470ac6dd97cfdb3c65bd1de3a2854944bb228","abstract_canon_sha256":"aedec8afaa5e31d95d1ef62b2f2661f5a6532ef1afd51e2004a982a9923d2860"},"schema_version":"1.0"},"canonical_sha256":"0ea9e67f30d5d3008bf300dc67a8264bd3274bf4edfe9b776af195eab236664b","source":{"kind":"arxiv","id":"1702.07390","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07390","created_at":"2026-05-18T00:47:56Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07390v2","created_at":"2026-05-18T00:47:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07390","created_at":"2026-05-18T00:47:56Z"},{"alias_kind":"pith_short_12","alias_value":"B2U6M7ZQ2XJQ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B2U6M7ZQ2XJQBC7T","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B2U6M7ZQ","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:B2U6M7ZQ2XJQBC7TADOGPKBGJP","target":"record","payload":{"canonical_record":{"source":{"id":"1702.07390","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-23T20:57:13Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"2effbefef184a032f90a0feefa1470ac6dd97cfdb3c65bd1de3a2854944bb228","abstract_canon_sha256":"aedec8afaa5e31d95d1ef62b2f2661f5a6532ef1afd51e2004a982a9923d2860"},"schema_version":"1.0"},"canonical_sha256":"0ea9e67f30d5d3008bf300dc67a8264bd3274bf4edfe9b776af195eab236664b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:56.404427Z","signature_b64":"4++rOMf+KsC3CPGfVM2PsXORFHOCthpHUBelpRvmzJuTIb3jbU0Dsmzw1neIj+a7Pafx/SAv1xIVHwBjIMOrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ea9e67f30d5d3008bf300dc67a8264bd3274bf4edfe9b776af195eab236664b","last_reissued_at":"2026-05-18T00:47:56.403792Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:56.403792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.07390","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-18T00:47:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J+k06Ccxvglvy+x7Nmnd4wRCk/m7OovriNmxA02cWXB0ccZgYGhCgw2u8TNTucYEmwBlBalvCijp6Onhk8geDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:49:25.163120Z"},"content_sha256":"93a1fa088047ad23a1f7f0dfb62118533c2b345c407a564ba1b65c0d28ec97d0","schema_version":"1.0","event_id":"sha256:93a1fa088047ad23a1f7f0dfb62118533c2b345c407a564ba1b65c0d28ec97d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:B2U6M7ZQ2XJQBC7TADOGPKBGJP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Detecting Strong Ties Using Network Motifs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Aneesh Sharma, Jon Kleinberg, Krishna Kamath, Rahmtin Rotabi","submitted_at":"2017-02-23T20:57:13Z","abstract_excerpt":"Detecting strong ties among users in social and information networks is a fundamental operation that can improve performance on a multitude of personalization and ranking tasks. Strong-tie edges are often readily obtained from the social network as users often participate in multiple overlapping networks via features such as following and messaging. These networks may vary greatly in size, density and the information they carry. This setting leads to a natural strong tie detection task: given a small set of labeled strong tie edges, how well can one detect unlabeled strong ties in the remainde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07390","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-18T00:47:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QYJ8Ao1lA5+SvQcee4OsXyOknuKdAzboyFfvyy+1ND6LIqwS39HDg+9pSf3F+2IGYeNt1HO7SFWaR3hhFw3UCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:49:25.163812Z"},"content_sha256":"92ab0059c0ec94e4db3ca7ebaa529f0988395cc616720440633d61cc595ad8d6","schema_version":"1.0","event_id":"sha256:92ab0059c0ec94e4db3ca7ebaa529f0988395cc616720440633d61cc595ad8d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B2U6M7ZQ2XJQBC7TADOGPKBGJP/bundle.json","state_url":"https://pith.science/pith/B2U6M7ZQ2XJQBC7TADOGPKBGJP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B2U6M7ZQ2XJQBC7TADOGPKBGJP/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-11T23:49:25Z","links":{"resolver":"https://pith.science/pith/B2U6M7ZQ2XJQBC7TADOGPKBGJP","bundle":"https://pith.science/pith/B2U6M7ZQ2XJQBC7TADOGPKBGJP/bundle.json","state":"https://pith.science/pith/B2U6M7ZQ2XJQBC7TADOGPKBGJP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B2U6M7ZQ2XJQBC7TADOGPKBGJP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:B2U6M7ZQ2XJQBC7TADOGPKBGJP","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":"aedec8afaa5e31d95d1ef62b2f2661f5a6532ef1afd51e2004a982a9923d2860","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-23T20:57:13Z","title_canon_sha256":"2effbefef184a032f90a0feefa1470ac6dd97cfdb3c65bd1de3a2854944bb228"},"schema_version":"1.0","source":{"id":"1702.07390","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07390","created_at":"2026-05-18T00:47:56Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07390v2","created_at":"2026-05-18T00:47:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07390","created_at":"2026-05-18T00:47:56Z"},{"alias_kind":"pith_short_12","alias_value":"B2U6M7ZQ2XJQ","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B2U6M7ZQ2XJQBC7T","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B2U6M7ZQ","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:92ab0059c0ec94e4db3ca7ebaa529f0988395cc616720440633d61cc595ad8d6","target":"graph","created_at":"2026-05-18T00:47:56Z","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":"Detecting strong ties among users in social and information networks is a fundamental operation that can improve performance on a multitude of personalization and ranking tasks. Strong-tie edges are often readily obtained from the social network as users often participate in multiple overlapping networks via features such as following and messaging. These networks may vary greatly in size, density and the information they carry. This setting leads to a natural strong tie detection task: given a small set of labeled strong tie edges, how well can one detect unlabeled strong ties in the remainde","authors_text":"Aneesh Sharma, Jon Kleinberg, Krishna Kamath, Rahmtin Rotabi","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-23T20:57:13Z","title":"Detecting Strong Ties Using Network Motifs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07390","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:93a1fa088047ad23a1f7f0dfb62118533c2b345c407a564ba1b65c0d28ec97d0","target":"record","created_at":"2026-05-18T00:47:56Z","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":"aedec8afaa5e31d95d1ef62b2f2661f5a6532ef1afd51e2004a982a9923d2860","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-02-23T20:57:13Z","title_canon_sha256":"2effbefef184a032f90a0feefa1470ac6dd97cfdb3c65bd1de3a2854944bb228"},"schema_version":"1.0","source":{"id":"1702.07390","kind":"arxiv","version":2}},"canonical_sha256":"0ea9e67f30d5d3008bf300dc67a8264bd3274bf4edfe9b776af195eab236664b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ea9e67f30d5d3008bf300dc67a8264bd3274bf4edfe9b776af195eab236664b","first_computed_at":"2026-05-18T00:47:56.403792Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:56.403792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4++rOMf+KsC3CPGfVM2PsXORFHOCthpHUBelpRvmzJuTIb3jbU0Dsmzw1neIj+a7Pafx/SAv1xIVHwBjIMOrDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:56.404427Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07390","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93a1fa088047ad23a1f7f0dfb62118533c2b345c407a564ba1b65c0d28ec97d0","sha256:92ab0059c0ec94e4db3ca7ebaa529f0988395cc616720440633d61cc595ad8d6"],"state_sha256":"dd1f69e8c29fb0e740ca0ade82d6d63d94c9531aeeecccde8607b4194e3f2a4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dKOYHWNAJsBLUT5Cwm5xOV3qlXtkDzu0LtedHXZsI9v8FW95HzLf0euTazHsCHjfiWp87vV3S1Wj+G9RX9MWBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:49:25.168580Z","bundle_sha256":"cbd4ac54e62d5e72563dcb1ff310cf6a460414c3de6ddf13346a00958fa4c52a"}}