{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2ISP6C6SXVAEXVRF24WDCABCE6","short_pith_number":"pith:2ISP6C6S","schema_version":"1.0","canonical_sha256":"d224ff0bd2bd404bd625d72c3100222793b8c255057be4daadf6ea8656dfb411","source":{"kind":"arxiv","id":"1607.02278","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.02278","created_at":"2026-05-18T01:11:20.778337+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.02278v1","created_at":"2026-05-18T01:11:20.778337+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02278","created_at":"2026-05-18T01:11:20.778337+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ISP6C6SXVAE","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ISP6C6SXVAEXVRF","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ISP6C6S","created_at":"2026-05-18T12:29:55.572404+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/2ISP6C6SXVAEXVRF24WDCABCE6","json":"https://pith.science/pith/2ISP6C6SXVAEXVRF24WDCABCE6.json","graph_json":"https://pith.science/api/pith-number/2ISP6C6SXVAEXVRF24WDCABCE6/graph.json","events_json":"https://pith.science/api/pith-number/2ISP6C6SXVAEXVRF24WDCABCE6/events.json","paper":"https://pith.science/paper/2ISP6C6S"},"agent_actions":{"view_html":"https://pith.science/pith/2ISP6C6SXVAEXVRF24WDCABCE6","download_json":"https://pith.science/pith/2ISP6C6SXVAEXVRF24WDCABCE6.json","view_paper":"https://pith.science/paper/2ISP6C6S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.02278&json=true","fetch_graph":"https://pith.science/api/pith-number/2ISP6C6SXVAEXVRF24WDCABCE6/graph.json","fetch_events":"https://pith.science/api/pith-number/2ISP6C6SXVAEXVRF24WDCABCE6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ISP6C6SXVAEXVRF24WDCABCE6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ISP6C6SXVAEXVRF24WDCABCE6/action/storage_attestation","attest_author":"https://pith.science/pith/2ISP6C6SXVAEXVRF24WDCABCE6/action/author_attestation","sign_citation":"https://pith.science/pith/2ISP6C6SXVAEXVRF24WDCABCE6/action/citation_signature","submit_replication":"https://pith.science/pith/2ISP6C6SXVAEXVRF24WDCABCE6/action/replication_record"}},"created_at":"2026-05-18T01:11:20.778337+00:00","updated_at":"2026-05-18T01:11:20.778337+00:00"}