{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KOV76I3UDNGXDN4VN5GRRAJCHE","short_pith_number":"pith:KOV76I3U","schema_version":"1.0","canonical_sha256":"53abff23741b4d71b7956f4d1881223927e1115e1337b3b6efc345c2e42afabe","source":{"kind":"arxiv","id":"1607.01735","version":1},"attestation_state":"computed","paper":{"title":"A maximum entropy approach to separating noise from signal in bimodal affiliation networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.data-an","stat.AP"],"primary_cat":"physics.soc-ph","authors_text":"Navid Dianati","submitted_at":"2016-07-06T18:27:09Z","abstract_excerpt":"In practice, many empirical networks, including co-authorship and collocation networks are unimodal projections of a bipartite data structure where one layer represents entities, the second layer consists of a number of sets representing affiliations, attributes, groups, etc., and an inter-layer link indicates membership of an entity in a set. The edge weight in the unimodal projection, which we refer to as a co-occurrence network, counts the number of sets to which both end-nodes are linked. Interpreting such dense networks requires statistical analysis that takes into account the bipartite s"},"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.01735","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2016-07-06T18:27:09Z","cross_cats_sorted":["physics.data-an","stat.AP"],"title_canon_sha256":"6c76955ea7a2c4cd376f971b533c183c58216734256696588de64fae759b83f3","abstract_canon_sha256":"c893b323e17874859837a85d22146c513ee0fdc4bf4bb33dfa4dfee001d9307f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:25.596369Z","signature_b64":"ldeh2Fi00nYK+qnmFcBClov44XUik4ObzDbhSlX9tCd7KTe9FwvkFMT1GcBunR9hyoqfQQzsPubom584JnMnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53abff23741b4d71b7956f4d1881223927e1115e1337b3b6efc345c2e42afabe","last_reissued_at":"2026-05-18T01:11:25.595725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:25.595725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A maximum entropy approach to separating noise from signal in bimodal affiliation networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.data-an","stat.AP"],"primary_cat":"physics.soc-ph","authors_text":"Navid Dianati","submitted_at":"2016-07-06T18:27:09Z","abstract_excerpt":"In practice, many empirical networks, including co-authorship and collocation networks are unimodal projections of a bipartite data structure where one layer represents entities, the second layer consists of a number of sets representing affiliations, attributes, groups, etc., and an inter-layer link indicates membership of an entity in a set. The edge weight in the unimodal projection, which we refer to as a co-occurrence network, counts the number of sets to which both end-nodes are linked. Interpreting such dense networks requires statistical analysis that takes into account the bipartite s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01735","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.01735","created_at":"2026-05-18T01:11:25.595945+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.01735v1","created_at":"2026-05-18T01:11:25.595945+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01735","created_at":"2026-05-18T01:11:25.595945+00:00"},{"alias_kind":"pith_short_12","alias_value":"KOV76I3UDNGX","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KOV76I3UDNGXDN4V","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KOV76I3U","created_at":"2026-05-18T12:30:25.849896+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.08567","citing_title":"Statistically validated projection of bipartite signed networks","ref_index":47,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KOV76I3UDNGXDN4VN5GRRAJCHE","json":"https://pith.science/pith/KOV76I3UDNGXDN4VN5GRRAJCHE.json","graph_json":"https://pith.science/api/pith-number/KOV76I3UDNGXDN4VN5GRRAJCHE/graph.json","events_json":"https://pith.science/api/pith-number/KOV76I3UDNGXDN4VN5GRRAJCHE/events.json","paper":"https://pith.science/paper/KOV76I3U"},"agent_actions":{"view_html":"https://pith.science/pith/KOV76I3UDNGXDN4VN5GRRAJCHE","download_json":"https://pith.science/pith/KOV76I3UDNGXDN4VN5GRRAJCHE.json","view_paper":"https://pith.science/paper/KOV76I3U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.01735&json=true","fetch_graph":"https://pith.science/api/pith-number/KOV76I3UDNGXDN4VN5GRRAJCHE/graph.json","fetch_events":"https://pith.science/api/pith-number/KOV76I3UDNGXDN4VN5GRRAJCHE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KOV76I3UDNGXDN4VN5GRRAJCHE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KOV76I3UDNGXDN4VN5GRRAJCHE/action/storage_attestation","attest_author":"https://pith.science/pith/KOV76I3UDNGXDN4VN5GRRAJCHE/action/author_attestation","sign_citation":"https://pith.science/pith/KOV76I3UDNGXDN4VN5GRRAJCHE/action/citation_signature","submit_replication":"https://pith.science/pith/KOV76I3UDNGXDN4VN5GRRAJCHE/action/replication_record"}},"created_at":"2026-05-18T01:11:25.595945+00:00","updated_at":"2026-05-18T01:11:25.595945+00:00"}