{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JMDO6KG4WAUW3EVGHZER5PY6JB","short_pith_number":"pith:JMDO6KG4","canonical_record":{"source":{"id":"1806.08904","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-23T04:08:47Z","cross_cats_sorted":["cs.MM"],"title_canon_sha256":"2f87fc0763681299155ab63d580dd6227c059aee6fd7ec8eb7e4f6502bf2a37d","abstract_canon_sha256":"64008f7d8b1b5369fc4a2d5eed21106828513fe8f0ad61a01521b59142259a93"},"schema_version":"1.0"},"canonical_sha256":"4b06ef28dcb0296d92a63e491ebf1e487937ed4a8968283fe83232ef3aa5aa9b","source":{"kind":"arxiv","id":"1806.08904","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08904","created_at":"2026-05-18T00:12:30Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08904v1","created_at":"2026-05-18T00:12:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08904","created_at":"2026-05-18T00:12:30Z"},{"alias_kind":"pith_short_12","alias_value":"JMDO6KG4WAUW","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JMDO6KG4WAUW3EVG","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JMDO6KG4","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JMDO6KG4WAUW3EVGHZER5PY6JB","target":"record","payload":{"canonical_record":{"source":{"id":"1806.08904","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-23T04:08:47Z","cross_cats_sorted":["cs.MM"],"title_canon_sha256":"2f87fc0763681299155ab63d580dd6227c059aee6fd7ec8eb7e4f6502bf2a37d","abstract_canon_sha256":"64008f7d8b1b5369fc4a2d5eed21106828513fe8f0ad61a01521b59142259a93"},"schema_version":"1.0"},"canonical_sha256":"4b06ef28dcb0296d92a63e491ebf1e487937ed4a8968283fe83232ef3aa5aa9b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:30.941161Z","signature_b64":"Tny+HV7aXnJujbmC4SurfrsdzoSmQ58O2FuJtR7f4RM2AkiGpjm7qhXD+h3tCC23qWCTniRuLPEvttXidrI9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b06ef28dcb0296d92a63e491ebf1e487937ed4a8968283fe83232ef3aa5aa9b","last_reissued_at":"2026-05-18T00:12:30.940571Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:30.940571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.08904","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:12:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JTql9SRWaYa2pmvMdJ6KST005BH+alDpVPkvC0sAntIcPrNak+UorD6CtXumx4F21GmvhSONaFu9aJbBLqM3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:04:12.622521Z"},"content_sha256":"7263e28f485361ca2821fa363db9e661fc922ff595cbeb6fce6a4f9a9ab156a1","schema_version":"1.0","event_id":"sha256:7263e28f485361ca2821fa363db9e661fc922ff595cbeb6fce6a4f9a9ab156a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JMDO6KG4WAUW3EVGHZER5PY6JB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Temporal Activity Path Based Character Correction in Social Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MM"],"primary_cat":"cs.SI","authors_text":"Chengyuan Zhang, Jun Long, Lei Zhu, Xinpan Yuan, Zhan Yang","submitted_at":"2018-06-23T04:08:47Z","abstract_excerpt":"Vast amount of multimedia data contains massive and multifarious social information which is used to construct large-scale social networks. In a complex social network, a character should be ideally denoted by one and only one vertex. However, it is pervasive that a character is denoted by two or more vertices with different names, thus it is usually considered as multiple, different characters. This problem causes incorrectness of results in network analysis and mining. The factual challenge is that character uniqueness is hard to correctly confirm due to lots of complicated factors, e.g. nam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08904","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:12:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pG/fwDTn7rAutysZSvl2p4mUDK/xb5PsIJRXgZayOP7zEor1wxUZeI9WFI/VrEONr8BNSmUWOYvB0h1n153vDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:04:12.623207Z"},"content_sha256":"4bf3a47c9594532518d31ecd8db75f34b07ed79f21b260495588c264218f41ba","schema_version":"1.0","event_id":"sha256:4bf3a47c9594532518d31ecd8db75f34b07ed79f21b260495588c264218f41ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JMDO6KG4WAUW3EVGHZER5PY6JB/bundle.json","state_url":"https://pith.science/pith/JMDO6KG4WAUW3EVGHZER5PY6JB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JMDO6KG4WAUW3EVGHZER5PY6JB/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-05-31T01:04:12Z","links":{"resolver":"https://pith.science/pith/JMDO6KG4WAUW3EVGHZER5PY6JB","bundle":"https://pith.science/pith/JMDO6KG4WAUW3EVGHZER5PY6JB/bundle.json","state":"https://pith.science/pith/JMDO6KG4WAUW3EVGHZER5PY6JB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JMDO6KG4WAUW3EVGHZER5PY6JB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JMDO6KG4WAUW3EVGHZER5PY6JB","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":"64008f7d8b1b5369fc4a2d5eed21106828513fe8f0ad61a01521b59142259a93","cross_cats_sorted":["cs.MM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-23T04:08:47Z","title_canon_sha256":"2f87fc0763681299155ab63d580dd6227c059aee6fd7ec8eb7e4f6502bf2a37d"},"schema_version":"1.0","source":{"id":"1806.08904","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08904","created_at":"2026-05-18T00:12:30Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08904v1","created_at":"2026-05-18T00:12:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08904","created_at":"2026-05-18T00:12:30Z"},{"alias_kind":"pith_short_12","alias_value":"JMDO6KG4WAUW","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JMDO6KG4WAUW3EVG","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JMDO6KG4","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:4bf3a47c9594532518d31ecd8db75f34b07ed79f21b260495588c264218f41ba","target":"graph","created_at":"2026-05-18T00:12:30Z","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":"Vast amount of multimedia data contains massive and multifarious social information which is used to construct large-scale social networks. In a complex social network, a character should be ideally denoted by one and only one vertex. However, it is pervasive that a character is denoted by two or more vertices with different names, thus it is usually considered as multiple, different characters. This problem causes incorrectness of results in network analysis and mining. The factual challenge is that character uniqueness is hard to correctly confirm due to lots of complicated factors, e.g. nam","authors_text":"Chengyuan Zhang, Jun Long, Lei Zhu, Xinpan Yuan, Zhan Yang","cross_cats":["cs.MM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-23T04:08:47Z","title":"Temporal Activity Path Based Character Correction in Social Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08904","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:7263e28f485361ca2821fa363db9e661fc922ff595cbeb6fce6a4f9a9ab156a1","target":"record","created_at":"2026-05-18T00:12:30Z","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":"64008f7d8b1b5369fc4a2d5eed21106828513fe8f0ad61a01521b59142259a93","cross_cats_sorted":["cs.MM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-06-23T04:08:47Z","title_canon_sha256":"2f87fc0763681299155ab63d580dd6227c059aee6fd7ec8eb7e4f6502bf2a37d"},"schema_version":"1.0","source":{"id":"1806.08904","kind":"arxiv","version":1}},"canonical_sha256":"4b06ef28dcb0296d92a63e491ebf1e487937ed4a8968283fe83232ef3aa5aa9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b06ef28dcb0296d92a63e491ebf1e487937ed4a8968283fe83232ef3aa5aa9b","first_computed_at":"2026-05-18T00:12:30.940571Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:30.940571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tny+HV7aXnJujbmC4SurfrsdzoSmQ58O2FuJtR7f4RM2AkiGpjm7qhXD+h3tCC23qWCTniRuLPEvttXidrI9Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:30.941161Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.08904","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7263e28f485361ca2821fa363db9e661fc922ff595cbeb6fce6a4f9a9ab156a1","sha256:4bf3a47c9594532518d31ecd8db75f34b07ed79f21b260495588c264218f41ba"],"state_sha256":"8f46331e1dbeec379ecd6881c41d17a71cf80db1f94e84b8347a06f2c3683b58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2koKD/KGHLRHCc0l4gyApb1LVixP6FKXzEsexX5ANZyt7/+HosRBqiqC2LbgmGmxl7nEKYEEpi3kvkrrbXwiAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:04:12.626759Z","bundle_sha256":"a841ec96ef8883e98962832f0469f04d66ea4cbe979b90c0b0c0051c3f14e443"}}