{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DB7ESFAYK2DPRHOJENFJLST52K","short_pith_number":"pith:DB7ESFAY","schema_version":"1.0","canonical_sha256":"187e4914185686f89dc9234a95ca7dd2ae61fe004b506bd20c5564bc858ec8dd","source":{"kind":"arxiv","id":"1102.5511","version":1},"attestation_state":"computed","paper":{"title":"A Fast Algorithm for the Discrete Core/Periphery Bipartitioning Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Sean Z.W. Lip","submitted_at":"2011-02-27T14:40:20Z","abstract_excerpt":"Various methods have been proposed in the literature to determine an optimal partitioning of the set of actors in a network into core and periphery subsets. However, these methods either work only for relatively small input sizes, or do not guarantee an optimal answer. In this paper, we propose a new algorithm to solve this problem. This algorithm is efficient and exact, allowing the optimal partitioning for networks of several thousand actors to be computed in under a second. We also show that the optimal core can be characterized as a set containing the actors with the highest degrees in the"},"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":"1102.5511","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-02-27T14:40:20Z","cross_cats_sorted":["cs.DS","cs.SI"],"title_canon_sha256":"1956e9e0258342810381bd3ff4c8f80072e434f06edc466c3740ee5929af72f5","abstract_canon_sha256":"5517f41fd45b8fa4d1f282f74d77c5fae7376db8b33e2c2c98ce4aa30f05fa8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:46.750231Z","signature_b64":"Wye6UCSFWUg72NhkUuu0c9wzE5XoRGlBi1rBOXMTfVG4UY/dzSOXYqZdQ+NyzqpFXDAdUde9ncSBn6/VPU71DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"187e4914185686f89dc9234a95ca7dd2ae61fe004b506bd20c5564bc858ec8dd","last_reissued_at":"2026-05-18T04:27:46.749674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:46.749674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Algorithm for the Discrete Core/Periphery Bipartitioning Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Sean Z.W. Lip","submitted_at":"2011-02-27T14:40:20Z","abstract_excerpt":"Various methods have been proposed in the literature to determine an optimal partitioning of the set of actors in a network into core and periphery subsets. However, these methods either work only for relatively small input sizes, or do not guarantee an optimal answer. In this paper, we propose a new algorithm to solve this problem. This algorithm is efficient and exact, allowing the optimal partitioning for networks of several thousand actors to be computed in under a second. We also show that the optimal core can be characterized as a set containing the actors with the highest degrees in the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5511","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":"1102.5511","created_at":"2026-05-18T04:27:46.749775+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.5511v1","created_at":"2026-05-18T04:27:46.749775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5511","created_at":"2026-05-18T04:27:46.749775+00:00"},{"alias_kind":"pith_short_12","alias_value":"DB7ESFAYK2DP","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DB7ESFAYK2DPRHOJ","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DB7ESFAY","created_at":"2026-05-18T12:26:26.731475+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.10329","citing_title":"Reciprocity in Interbank Markets","ref_index":59,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DB7ESFAYK2DPRHOJENFJLST52K","json":"https://pith.science/pith/DB7ESFAYK2DPRHOJENFJLST52K.json","graph_json":"https://pith.science/api/pith-number/DB7ESFAYK2DPRHOJENFJLST52K/graph.json","events_json":"https://pith.science/api/pith-number/DB7ESFAYK2DPRHOJENFJLST52K/events.json","paper":"https://pith.science/paper/DB7ESFAY"},"agent_actions":{"view_html":"https://pith.science/pith/DB7ESFAYK2DPRHOJENFJLST52K","download_json":"https://pith.science/pith/DB7ESFAYK2DPRHOJENFJLST52K.json","view_paper":"https://pith.science/paper/DB7ESFAY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.5511&json=true","fetch_graph":"https://pith.science/api/pith-number/DB7ESFAYK2DPRHOJENFJLST52K/graph.json","fetch_events":"https://pith.science/api/pith-number/DB7ESFAYK2DPRHOJENFJLST52K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DB7ESFAYK2DPRHOJENFJLST52K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DB7ESFAYK2DPRHOJENFJLST52K/action/storage_attestation","attest_author":"https://pith.science/pith/DB7ESFAYK2DPRHOJENFJLST52K/action/author_attestation","sign_citation":"https://pith.science/pith/DB7ESFAYK2DPRHOJENFJLST52K/action/citation_signature","submit_replication":"https://pith.science/pith/DB7ESFAYK2DPRHOJENFJLST52K/action/replication_record"}},"created_at":"2026-05-18T04:27:46.749775+00:00","updated_at":"2026-05-18T04:27:46.749775+00:00"}