{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WOU2KP5H462MKVA2UUNGDA6OGU","short_pith_number":"pith:WOU2KP5H","schema_version":"1.0","canonical_sha256":"b3a9a53fa7e7b4c5541aa51a6183ce3507ce31a7cda05d70a61cef3df1a414ff","source":{"kind":"arxiv","id":"1309.5124","version":2},"attestation_state":"computed","paper":{"title":"Multi-layer graph analysis for dynamic social networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph","stat.CO"],"primary_cat":"cs.SI","authors_text":"Alex Kulesza, Alfred O. Hero III, Brandon Oselio","submitted_at":"2013-09-20T01:06:43Z","abstract_excerpt":"Modern social networks frequently encompass multiple distinct types of connectivity information; for instance, explicitly acknowledged friend relationships might complement behavioral measures that link users according to their actions or interests. One way to represent these networks is as multi-layer graphs, where each layer contains a unique set of edges over the same underlying vertices (users). Edges in different layers typically have related but distinct semantics; depending on the application multiple layers might be used to reduce noise through averaging, to perform multifaceted analys"},"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":"1309.5124","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-09-20T01:06:43Z","cross_cats_sorted":["physics.soc-ph","stat.CO"],"title_canon_sha256":"38c3485291ad5abf147f2b2d93aabece318b61d0f30cd69636cb1f46c4002f73","abstract_canon_sha256":"66fac3c2161ddc242933ec88eb5e6f33b8e90339f8a2478bb47acd349e47615a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:47:35.262949Z","signature_b64":"AViHXHdMIc6zrvrpoy9L07tPd8RsYnCbm5wm10i5Id/AV2T9zjQH+d3tzoIwYxw9jGjo2qTmKdI4L5Kjhd8lCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3a9a53fa7e7b4c5541aa51a6183ce3507ce31a7cda05d70a61cef3df1a414ff","last_reissued_at":"2026-05-18T01:47:35.262338Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:47:35.262338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-layer graph analysis for dynamic social networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph","stat.CO"],"primary_cat":"cs.SI","authors_text":"Alex Kulesza, Alfred O. Hero III, Brandon Oselio","submitted_at":"2013-09-20T01:06:43Z","abstract_excerpt":"Modern social networks frequently encompass multiple distinct types of connectivity information; for instance, explicitly acknowledged friend relationships might complement behavioral measures that link users according to their actions or interests. One way to represent these networks is as multi-layer graphs, where each layer contains a unique set of edges over the same underlying vertices (users). Edges in different layers typically have related but distinct semantics; depending on the application multiple layers might be used to reduce noise through averaging, to perform multifaceted analys"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5124","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":"1309.5124","created_at":"2026-05-18T01:47:35.262436+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.5124v2","created_at":"2026-05-18T01:47:35.262436+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5124","created_at":"2026-05-18T01:47:35.262436+00:00"},{"alias_kind":"pith_short_12","alias_value":"WOU2KP5H462M","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WOU2KP5H462MKVA2","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WOU2KP5H","created_at":"2026-05-18T12:28:04.890932+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/WOU2KP5H462MKVA2UUNGDA6OGU","json":"https://pith.science/pith/WOU2KP5H462MKVA2UUNGDA6OGU.json","graph_json":"https://pith.science/api/pith-number/WOU2KP5H462MKVA2UUNGDA6OGU/graph.json","events_json":"https://pith.science/api/pith-number/WOU2KP5H462MKVA2UUNGDA6OGU/events.json","paper":"https://pith.science/paper/WOU2KP5H"},"agent_actions":{"view_html":"https://pith.science/pith/WOU2KP5H462MKVA2UUNGDA6OGU","download_json":"https://pith.science/pith/WOU2KP5H462MKVA2UUNGDA6OGU.json","view_paper":"https://pith.science/paper/WOU2KP5H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.5124&json=true","fetch_graph":"https://pith.science/api/pith-number/WOU2KP5H462MKVA2UUNGDA6OGU/graph.json","fetch_events":"https://pith.science/api/pith-number/WOU2KP5H462MKVA2UUNGDA6OGU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WOU2KP5H462MKVA2UUNGDA6OGU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WOU2KP5H462MKVA2UUNGDA6OGU/action/storage_attestation","attest_author":"https://pith.science/pith/WOU2KP5H462MKVA2UUNGDA6OGU/action/author_attestation","sign_citation":"https://pith.science/pith/WOU2KP5H462MKVA2UUNGDA6OGU/action/citation_signature","submit_replication":"https://pith.science/pith/WOU2KP5H462MKVA2UUNGDA6OGU/action/replication_record"}},"created_at":"2026-05-18T01:47:35.262436+00:00","updated_at":"2026-05-18T01:47:35.262436+00:00"}