{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2ISP6C6SXVAEXVRF24WDCABCE6","short_pith_number":"pith:2ISP6C6S","canonical_record":{"source":{"id":"1607.02278","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-07-08T09:07:52Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"9c1749e4c181015406f32a5d99d69defe7a79e615a5dc13332014f68b8de39c3","abstract_canon_sha256":"bc21a6db860eb6b45a432d0a1fffe3a0bc300ffbd4f3959af180aa071059d297"},"schema_version":"1.0"},"canonical_sha256":"d224ff0bd2bd404bd625d72c3100222793b8c255057be4daadf6ea8656dfb411","source":{"kind":"arxiv","id":"1607.02278","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02278","created_at":"2026-05-18T01:11:20Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02278v1","created_at":"2026-05-18T01:11:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02278","created_at":"2026-05-18T01:11:20Z"},{"alias_kind":"pith_short_12","alias_value":"2ISP6C6SXVAE","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2ISP6C6SXVAEXVRF","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2ISP6C6S","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2ISP6C6SXVAEXVRF24WDCABCE6","target":"record","payload":{"canonical_record":{"source":{"id":"1607.02278","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-07-08T09:07:52Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"9c1749e4c181015406f32a5d99d69defe7a79e615a5dc13332014f68b8de39c3","abstract_canon_sha256":"bc21a6db860eb6b45a432d0a1fffe3a0bc300ffbd4f3959af180aa071059d297"},"schema_version":"1.0"},"canonical_sha256":"d224ff0bd2bd404bd625d72c3100222793b8c255057be4daadf6ea8656dfb411","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:20.778786Z","signature_b64":"FFziYemevF6R2uUVLMud9CIX6A8jehVTirmEVqzI+6c/wzEOi8yKM/Jhv3K1RW1m3rA+djEYPiAQdcBlTGk6AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d224ff0bd2bd404bd625d72c3100222793b8c255057be4daadf6ea8656dfb411","last_reissued_at":"2026-05-18T01:11:20.778219Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:20.778219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.02278","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-18T01:11:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vBIAKWnPDOAg4a17F0m/p7cmJeuxfUZgiPSQPE23jRttGlK8zciiUPDpc5bWsvrSDTQHFvUz8Vvu/+GvJmVUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:36:52.350852Z"},"content_sha256":"3c6510e59475821eafe0ed32298a5b116c911477f10a359b270698e836fa7257","schema_version":"1.0","event_id":"sha256:3c6510e59475821eafe0ed32298a5b116c911477f10a359b270698e836fa7257"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2ISP6C6SXVAEXVRF24WDCABCE6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Diclique clustering in a directed random graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.SI","authors_text":"Lasse Leskel\\\"a, Mindaugas Bloznelis","submitted_at":"2016-07-08T09:07:52Z","abstract_excerpt":"We discuss a notion of clustering for directed graphs, which describes how likely two followers of a node are to follow a common target. The associated network motifs, called dicliques or bi-fans, have been found to be key structural components in various real-world networks. We introduce a two-mode statistical network model consisting of actors and auxiliary attributes, where an actor i decides to follow an actor j whenever i demands an attribute supplied by j. We show that the digraph admits nontrivial clustering properties of the aforementioned type, as well as power-law indegree and outdeg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02278","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-18T01:11:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Satfs3og0qvIlfUXbANp0kVrf9HZM+HpNpnptRoy2oQpaZa1XTEkENi02wf/djEul9C5gA1vWQNE1hbroA96BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:36:52.351192Z"},"content_sha256":"4e092e2569affcd72a73b7406995446335ae4ad6528a0c7319383e6d213a6fd6","schema_version":"1.0","event_id":"sha256:4e092e2569affcd72a73b7406995446335ae4ad6528a0c7319383e6d213a6fd6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2ISP6C6SXVAEXVRF24WDCABCE6/bundle.json","state_url":"https://pith.science/pith/2ISP6C6SXVAEXVRF24WDCABCE6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2ISP6C6SXVAEXVRF24WDCABCE6/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-30T08:36:52Z","links":{"resolver":"https://pith.science/pith/2ISP6C6SXVAEXVRF24WDCABCE6","bundle":"https://pith.science/pith/2ISP6C6SXVAEXVRF24WDCABCE6/bundle.json","state":"https://pith.science/pith/2ISP6C6SXVAEXVRF24WDCABCE6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2ISP6C6SXVAEXVRF24WDCABCE6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2ISP6C6SXVAEXVRF24WDCABCE6","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":"bc21a6db860eb6b45a432d0a1fffe3a0bc300ffbd4f3959af180aa071059d297","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-07-08T09:07:52Z","title_canon_sha256":"9c1749e4c181015406f32a5d99d69defe7a79e615a5dc13332014f68b8de39c3"},"schema_version":"1.0","source":{"id":"1607.02278","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02278","created_at":"2026-05-18T01:11:20Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02278v1","created_at":"2026-05-18T01:11:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02278","created_at":"2026-05-18T01:11:20Z"},{"alias_kind":"pith_short_12","alias_value":"2ISP6C6SXVAE","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2ISP6C6SXVAEXVRF","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2ISP6C6S","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:4e092e2569affcd72a73b7406995446335ae4ad6528a0c7319383e6d213a6fd6","target":"graph","created_at":"2026-05-18T01:11:20Z","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":"We discuss a notion of clustering for directed graphs, which describes how likely two followers of a node are to follow a common target. The associated network motifs, called dicliques or bi-fans, have been found to be key structural components in various real-world networks. We introduce a two-mode statistical network model consisting of actors and auxiliary attributes, where an actor i decides to follow an actor j whenever i demands an attribute supplied by j. We show that the digraph admits nontrivial clustering properties of the aforementioned type, as well as power-law indegree and outdeg","authors_text":"Lasse Leskel\\\"a, Mindaugas Bloznelis","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-07-08T09:07:52Z","title":"Diclique clustering in a directed random graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02278","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:3c6510e59475821eafe0ed32298a5b116c911477f10a359b270698e836fa7257","target":"record","created_at":"2026-05-18T01:11:20Z","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":"bc21a6db860eb6b45a432d0a1fffe3a0bc300ffbd4f3959af180aa071059d297","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2016-07-08T09:07:52Z","title_canon_sha256":"9c1749e4c181015406f32a5d99d69defe7a79e615a5dc13332014f68b8de39c3"},"schema_version":"1.0","source":{"id":"1607.02278","kind":"arxiv","version":1}},"canonical_sha256":"d224ff0bd2bd404bd625d72c3100222793b8c255057be4daadf6ea8656dfb411","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d224ff0bd2bd404bd625d72c3100222793b8c255057be4daadf6ea8656dfb411","first_computed_at":"2026-05-18T01:11:20.778219Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:20.778219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FFziYemevF6R2uUVLMud9CIX6A8jehVTirmEVqzI+6c/wzEOi8yKM/Jhv3K1RW1m3rA+djEYPiAQdcBlTGk6AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:20.778786Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.02278","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c6510e59475821eafe0ed32298a5b116c911477f10a359b270698e836fa7257","sha256:4e092e2569affcd72a73b7406995446335ae4ad6528a0c7319383e6d213a6fd6"],"state_sha256":"9f51339be2802b8be4865c8e8b6cd0889b6e88afeeb022d51e812a47d57852e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vbAN+5O5metLH1ETYqRzuGgA620V1+xdCXkd2aClAsbfmfyR98pKs59Qmw//OrtFPUJrypbqxJmg6pzpFHygDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:36:52.353154Z","bundle_sha256":"15f8bf285b5c7d06aac794fcf25df85ca90a3bd90da0b5d0f1470299a445a21a"}}