{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Q3QXY4S7CPVK4TDOOVTKOYQUNA","short_pith_number":"pith:Q3QXY4S7","schema_version":"1.0","canonical_sha256":"86e17c725f13eaae4c6e7566a76214680de8db3ac6d556010a72f7cf3c04b38b","source":{"kind":"arxiv","id":"1505.01817","version":1},"attestation_state":"computed","paper":{"title":"Generalized Two-mode Cores","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Monika Cerin\\v{s}ek, Vladimir Batagelj","submitted_at":"2015-05-06T13:47:05Z","abstract_excerpt":"The node set of a two-mode network consists of two disjoint subsets and all its links are linking these two subsets. The links can be weighted. We developed a new method for identifying important sub-networks in two-mode networks. The method combines and extends the ideas from generalized cores in one-mode networks and from (p, q)- cores for two-mode networks. In this paper we introduce the notion of generalized two-mode cores and discuss some of their properties. An efficient algorithm to determine generalized two-mode cores and an analysis of its complexity are also presented. For illustrati"},"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":"1505.01817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-05-06T13:47:05Z","cross_cats_sorted":[],"title_canon_sha256":"39876d400513347b73cbc997ce658398f6cd9e91c7138d8b62ac1f00cff5be28","abstract_canon_sha256":"c8b99b9fb37232d30473d60da787dfd025f35e96225e161cd0492d4090fa5d19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:09.830348Z","signature_b64":"UEFnsNpXPk8KtRv0OqvshHAdYnrb8q/Id5e3sXxnwVEHE73LKdBvdMjI49l7WRouAw7ORT7vn9SVcfuaBklADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86e17c725f13eaae4c6e7566a76214680de8db3ac6d556010a72f7cf3c04b38b","last_reissued_at":"2026-05-18T01:18:09.829846Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:09.829846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Two-mode Cores","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Monika Cerin\\v{s}ek, Vladimir Batagelj","submitted_at":"2015-05-06T13:47:05Z","abstract_excerpt":"The node set of a two-mode network consists of two disjoint subsets and all its links are linking these two subsets. The links can be weighted. We developed a new method for identifying important sub-networks in two-mode networks. The method combines and extends the ideas from generalized cores in one-mode networks and from (p, q)- cores for two-mode networks. In this paper we introduce the notion of generalized two-mode cores and discuss some of their properties. An efficient algorithm to determine generalized two-mode cores and an analysis of its complexity are also presented. For illustrati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01817","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":"1505.01817","created_at":"2026-05-18T01:18:09.829929+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.01817v1","created_at":"2026-05-18T01:18:09.829929+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01817","created_at":"2026-05-18T01:18:09.829929+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3QXY4S7CPVK","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3QXY4S7CPVK4TDO","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3QXY4S7","created_at":"2026-05-18T12:29:37.295048+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/Q3QXY4S7CPVK4TDOOVTKOYQUNA","json":"https://pith.science/pith/Q3QXY4S7CPVK4TDOOVTKOYQUNA.json","graph_json":"https://pith.science/api/pith-number/Q3QXY4S7CPVK4TDOOVTKOYQUNA/graph.json","events_json":"https://pith.science/api/pith-number/Q3QXY4S7CPVK4TDOOVTKOYQUNA/events.json","paper":"https://pith.science/paper/Q3QXY4S7"},"agent_actions":{"view_html":"https://pith.science/pith/Q3QXY4S7CPVK4TDOOVTKOYQUNA","download_json":"https://pith.science/pith/Q3QXY4S7CPVK4TDOOVTKOYQUNA.json","view_paper":"https://pith.science/paper/Q3QXY4S7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.01817&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3QXY4S7CPVK4TDOOVTKOYQUNA/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3QXY4S7CPVK4TDOOVTKOYQUNA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3QXY4S7CPVK4TDOOVTKOYQUNA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3QXY4S7CPVK4TDOOVTKOYQUNA/action/storage_attestation","attest_author":"https://pith.science/pith/Q3QXY4S7CPVK4TDOOVTKOYQUNA/action/author_attestation","sign_citation":"https://pith.science/pith/Q3QXY4S7CPVK4TDOOVTKOYQUNA/action/citation_signature","submit_replication":"https://pith.science/pith/Q3QXY4S7CPVK4TDOOVTKOYQUNA/action/replication_record"}},"created_at":"2026-05-18T01:18:09.829929+00:00","updated_at":"2026-05-18T01:18:09.829929+00:00"}