{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:DB7ESFAYK2DPRHOJENFJLST52K","short_pith_number":"pith:DB7ESFAY","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"},"canonical_sha256":"187e4914185686f89dc9234a95ca7dd2ae61fe004b506bd20c5564bc858ec8dd","source":{"kind":"arxiv","id":"1102.5511","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5511","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5511v1","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5511","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"pith_short_12","alias_value":"DB7ESFAYK2DP","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DB7ESFAYK2DPRHOJ","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DB7ESFAY","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:DB7ESFAYK2DPRHOJENFJLST52K","target":"record","payload":{"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"},"canonical_sha256":"187e4914185686f89dc9234a95ca7dd2ae61fe004b506bd20c5564bc858ec8dd","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"},"source_kind":"arxiv","source_id":"1102.5511","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-18T04:27:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yMEuRPcVyZsVanWB1TAe4fU8yIa4onCPusHz2xyyFj5GkNkp0r3kSrCtwKwDs5+5Rp2AFBNtwtN/Z7bxKOK2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T17:50:04.551243Z"},"content_sha256":"7ddc82521d6ca9f94e90f8245d8d04eb856220b3cf421c5a9d5bbc390396fa0f","schema_version":"1.0","event_id":"sha256:7ddc82521d6ca9f94e90f8245d8d04eb856220b3cf421c5a9d5bbc390396fa0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:DB7ESFAYK2DPRHOJENFJLST52K","target":"graph","payload":{"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"},"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-18T04:27:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3vMM3k0bQSIome9f1EI0kslEMF8F7huloxFxLo811Y3I3hIUW65VZCBB7AX2mqk9dD+LRzlc04IFc0BDvBwaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T17:50:04.551582Z"},"content_sha256":"338fef72fc9035ccb34c17bf473f0ec92a6f00950062df331c328bd7f35c8114","schema_version":"1.0","event_id":"sha256:338fef72fc9035ccb34c17bf473f0ec92a6f00950062df331c328bd7f35c8114"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DB7ESFAYK2DPRHOJENFJLST52K/bundle.json","state_url":"https://pith.science/pith/DB7ESFAYK2DPRHOJENFJLST52K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DB7ESFAYK2DPRHOJENFJLST52K/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-08-18T17:50:04Z","links":{"resolver":"https://pith.science/pith/DB7ESFAYK2DPRHOJENFJLST52K","bundle":"https://pith.science/pith/DB7ESFAYK2DPRHOJENFJLST52K/bundle.json","state":"https://pith.science/pith/DB7ESFAYK2DPRHOJENFJLST52K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DB7ESFAYK2DPRHOJENFJLST52K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DB7ESFAYK2DPRHOJENFJLST52K","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":"5517f41fd45b8fa4d1f282f74d77c5fae7376db8b33e2c2c98ce4aa30f05fa8e","cross_cats_sorted":["cs.DS","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-02-27T14:40:20Z","title_canon_sha256":"1956e9e0258342810381bd3ff4c8f80072e434f06edc466c3740ee5929af72f5"},"schema_version":"1.0","source":{"id":"1102.5511","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5511","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5511v1","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5511","created_at":"2026-05-18T04:27:46Z"},{"alias_kind":"pith_short_12","alias_value":"DB7ESFAYK2DP","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DB7ESFAYK2DPRHOJ","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DB7ESFAY","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:338fef72fc9035ccb34c17bf473f0ec92a6f00950062df331c328bd7f35c8114","target":"graph","created_at":"2026-05-18T04:27:46Z","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":"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","authors_text":"Sean Z.W. Lip","cross_cats":["cs.DS","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-02-27T14:40:20Z","title":"A Fast Algorithm for the Discrete Core/Periphery Bipartitioning Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5511","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:7ddc82521d6ca9f94e90f8245d8d04eb856220b3cf421c5a9d5bbc390396fa0f","target":"record","created_at":"2026-05-18T04:27:46Z","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":"5517f41fd45b8fa4d1f282f74d77c5fae7376db8b33e2c2c98ce4aa30f05fa8e","cross_cats_sorted":["cs.DS","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2011-02-27T14:40:20Z","title_canon_sha256":"1956e9e0258342810381bd3ff4c8f80072e434f06edc466c3740ee5929af72f5"},"schema_version":"1.0","source":{"id":"1102.5511","kind":"arxiv","version":1}},"canonical_sha256":"187e4914185686f89dc9234a95ca7dd2ae61fe004b506bd20c5564bc858ec8dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"187e4914185686f89dc9234a95ca7dd2ae61fe004b506bd20c5564bc858ec8dd","first_computed_at":"2026-05-18T04:27:46.749674Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:46.749674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wye6UCSFWUg72NhkUuu0c9wzE5XoRGlBi1rBOXMTfVG4UY/dzSOXYqZdQ+NyzqpFXDAdUde9ncSBn6/VPU71DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:46.750231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.5511","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ddc82521d6ca9f94e90f8245d8d04eb856220b3cf421c5a9d5bbc390396fa0f","sha256:338fef72fc9035ccb34c17bf473f0ec92a6f00950062df331c328bd7f35c8114"],"state_sha256":"9aac1f2f02d484247ef213db91b56aab91899218cc9011ad657828c1af2faf36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"81tktImt/dtJrqzChvcx6lNI6+njiJQzAAP4vlhtISdQJWhWevKX2GrWfZpV/h6ieLE7PEaoE2A5BPzqu95LDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T17:50:04.555306Z","bundle_sha256":"63d14adfa972b4741dd40e028ba0a6d54d27dcedf6d1310d76771e7d8e26757c"}}