{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AI4R3U22EI5TVEKJFSJDUSUGZX","short_pith_number":"pith:AI4R3U22","canonical_record":{"source":{"id":"1609.05788","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2016-09-19T15:34:46Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"e235b259f11df92072eadbd04b3c364b15c7bf7b7e90cee79590815821caa0ee","abstract_canon_sha256":"f21b194c10472a3bae50ffff9bd55aa4b541c31896b3a0e5bebd4ad0818819dd"},"schema_version":"1.0"},"canonical_sha256":"02391dd35a223b3a91492c923a4a86cdc17cb23c56d129432acfdcf7443aafa7","source":{"kind":"arxiv","id":"1609.05788","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05788","created_at":"2026-05-18T00:54:15Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05788v2","created_at":"2026-05-18T00:54:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05788","created_at":"2026-05-18T00:54:15Z"},{"alias_kind":"pith_short_12","alias_value":"AI4R3U22EI5T","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AI4R3U22EI5TVEKJ","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AI4R3U22","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AI4R3U22EI5TVEKJFSJDUSUGZX","target":"record","payload":{"canonical_record":{"source":{"id":"1609.05788","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2016-09-19T15:34:46Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"e235b259f11df92072eadbd04b3c364b15c7bf7b7e90cee79590815821caa0ee","abstract_canon_sha256":"f21b194c10472a3bae50ffff9bd55aa4b541c31896b3a0e5bebd4ad0818819dd"},"schema_version":"1.0"},"canonical_sha256":"02391dd35a223b3a91492c923a4a86cdc17cb23c56d129432acfdcf7443aafa7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:15.378527Z","signature_b64":"yApWJrtFTURxwKxVq0UwDSUwqbZ39xIwn2lX6hn4sHlR7/MZCZElAcOhL2j0+U5f5/e/0zA90x8MwdCcw8aXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02391dd35a223b3a91492c923a4a86cdc17cb23c56d129432acfdcf7443aafa7","last_reissued_at":"2026-05-18T00:54:15.378103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:15.378103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.05788","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:54:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ELjMT/+odHOEJWbmEvtJQAMkd3qgG5vQl1xaxZnl4NyEXyNAOGJSvPatpPKb1YlrGGUuzTIw7xeSlXfwuNr9BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:29:01.255877Z"},"content_sha256":"eda157fdafcd078523ac6e75e079c5134ba779965932514537d95e20434d07b4","schema_version":"1.0","event_id":"sha256:eda157fdafcd078523ac6e75e079c5134ba779965932514537d95e20434d07b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AI4R3U22EI5TVEKJFSJDUSUGZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cycles and Clustering in Multiplex Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn"],"primary_cat":"physics.soc-ph","authors_text":"Davide Cellai, Gareth J. Baxter, Jos\\'e F. F. Mendes, Sergey N. Dorogovtsev","submitted_at":"2016-09-19T15:34:46Z","abstract_excerpt":"In multiplex networks, cycles cannot be characterized only by their length, as edges may occur in different layers in different combinations. We define a classification of cycles by the number of edges in each layer and the number of switches between layers. We calculate the expected number of cycles of each type in the configuration model of a large sparse multiplex network. Our method accounts for the full degree distribution including correlations between degrees in different layers. In particular, we obtain the numbers of cycles of length 3 of all possible types. Using these, we give a com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05788","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:54:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PIImx2bqteBXi2zI+v8CGghCdzXkKOpm1E8DZFQ3yFP6AxHvE37tl1SJZfUbW9lqMjy/97CHGqNrGc9AYNK7Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:29:01.256229Z"},"content_sha256":"a4dca1969ad0ed158dce3c741d0b014b46634ec503cb2a55a3a9d7db921ccbfd","schema_version":"1.0","event_id":"sha256:a4dca1969ad0ed158dce3c741d0b014b46634ec503cb2a55a3a9d7db921ccbfd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AI4R3U22EI5TVEKJFSJDUSUGZX/bundle.json","state_url":"https://pith.science/pith/AI4R3U22EI5TVEKJFSJDUSUGZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AI4R3U22EI5TVEKJFSJDUSUGZX/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-03T01:29:01Z","links":{"resolver":"https://pith.science/pith/AI4R3U22EI5TVEKJFSJDUSUGZX","bundle":"https://pith.science/pith/AI4R3U22EI5TVEKJFSJDUSUGZX/bundle.json","state":"https://pith.science/pith/AI4R3U22EI5TVEKJFSJDUSUGZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AI4R3U22EI5TVEKJFSJDUSUGZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AI4R3U22EI5TVEKJFSJDUSUGZX","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":"f21b194c10472a3bae50ffff9bd55aa4b541c31896b3a0e5bebd4ad0818819dd","cross_cats_sorted":["cond-mat.dis-nn"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2016-09-19T15:34:46Z","title_canon_sha256":"e235b259f11df92072eadbd04b3c364b15c7bf7b7e90cee79590815821caa0ee"},"schema_version":"1.0","source":{"id":"1609.05788","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05788","created_at":"2026-05-18T00:54:15Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05788v2","created_at":"2026-05-18T00:54:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05788","created_at":"2026-05-18T00:54:15Z"},{"alias_kind":"pith_short_12","alias_value":"AI4R3U22EI5T","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AI4R3U22EI5TVEKJ","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AI4R3U22","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:a4dca1969ad0ed158dce3c741d0b014b46634ec503cb2a55a3a9d7db921ccbfd","target":"graph","created_at":"2026-05-18T00:54:15Z","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":"In multiplex networks, cycles cannot be characterized only by their length, as edges may occur in different layers in different combinations. We define a classification of cycles by the number of edges in each layer and the number of switches between layers. We calculate the expected number of cycles of each type in the configuration model of a large sparse multiplex network. Our method accounts for the full degree distribution including correlations between degrees in different layers. In particular, we obtain the numbers of cycles of length 3 of all possible types. Using these, we give a com","authors_text":"Davide Cellai, Gareth J. Baxter, Jos\\'e F. F. Mendes, Sergey N. Dorogovtsev","cross_cats":["cond-mat.dis-nn"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2016-09-19T15:34:46Z","title":"Cycles and Clustering in Multiplex Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05788","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:eda157fdafcd078523ac6e75e079c5134ba779965932514537d95e20434d07b4","target":"record","created_at":"2026-05-18T00:54:15Z","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":"f21b194c10472a3bae50ffff9bd55aa4b541c31896b3a0e5bebd4ad0818819dd","cross_cats_sorted":["cond-mat.dis-nn"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2016-09-19T15:34:46Z","title_canon_sha256":"e235b259f11df92072eadbd04b3c364b15c7bf7b7e90cee79590815821caa0ee"},"schema_version":"1.0","source":{"id":"1609.05788","kind":"arxiv","version":2}},"canonical_sha256":"02391dd35a223b3a91492c923a4a86cdc17cb23c56d129432acfdcf7443aafa7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02391dd35a223b3a91492c923a4a86cdc17cb23c56d129432acfdcf7443aafa7","first_computed_at":"2026-05-18T00:54:15.378103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:15.378103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yApWJrtFTURxwKxVq0UwDSUwqbZ39xIwn2lX6hn4sHlR7/MZCZElAcOhL2j0+U5f5/e/0zA90x8MwdCcw8aXAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:15.378527Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.05788","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eda157fdafcd078523ac6e75e079c5134ba779965932514537d95e20434d07b4","sha256:a4dca1969ad0ed158dce3c741d0b014b46634ec503cb2a55a3a9d7db921ccbfd"],"state_sha256":"54eb20c794ae0a3a911261ab8ebe8c8da5cf98f0481a9a2d967d6d42df03e1ae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jIUvyyFx2aLeCKDooAD2zZHd6mpKkLhkTgNphAW9dkkgswzP6Hs/YQmfNUtVPlqG6gqs+lt9mnaBly93Be8MBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:29:01.258180Z","bundle_sha256":"48f62e40f8ccb968cc792b40ee2669e26d4265275a3e350fb880eb753c4fbe6c"}}