{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CY6I5TFXMLSODG2EPX2YJ2EPJ5","short_pith_number":"pith:CY6I5TFX","canonical_record":{"source":{"id":"1210.3266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-10-11T15:17:35Z","cross_cats_sorted":["cs.DS","physics.soc-ph"],"title_canon_sha256":"658ce886b40cd87ef622d6562280c6964fbfdfd34b28300632d68eb314424988","abstract_canon_sha256":"d57a174385d2bd4f7d64cf9fcedc7e06bfbd71d156ecc8a9b9608f0a99c1c9c2"},"schema_version":"1.0"},"canonical_sha256":"163c8eccb762e4e19b447df584e88f4f539cd52e1d86695e98be5a919c796063","source":{"kind":"arxiv","id":"1210.3266","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3266","created_at":"2026-05-18T03:43:27Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3266v1","created_at":"2026-05-18T03:43:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3266","created_at":"2026-05-18T03:43:27Z"},{"alias_kind":"pith_short_12","alias_value":"CY6I5TFXMLSO","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CY6I5TFXMLSODG2E","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CY6I5TFX","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CY6I5TFXMLSODG2EPX2YJ2EPJ5","target":"record","payload":{"canonical_record":{"source":{"id":"1210.3266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-10-11T15:17:35Z","cross_cats_sorted":["cs.DS","physics.soc-ph"],"title_canon_sha256":"658ce886b40cd87ef622d6562280c6964fbfdfd34b28300632d68eb314424988","abstract_canon_sha256":"d57a174385d2bd4f7d64cf9fcedc7e06bfbd71d156ecc8a9b9608f0a99c1c9c2"},"schema_version":"1.0"},"canonical_sha256":"163c8eccb762e4e19b447df584e88f4f539cd52e1d86695e98be5a919c796063","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:27.848659Z","signature_b64":"QI9gJW2ATa3ssFaMUfSpSKiNAq/R4aDwB95h3sqvQkjfpgZaf0gD86K7p/CIJRSwwO4QjU20MPtNc9EZWA8OAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"163c8eccb762e4e19b447df584e88f4f539cd52e1d86695e98be5a919c796063","last_reissued_at":"2026-05-18T03:43:27.847954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:27.847954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.3266","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-18T03:43:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zjiZFmKwNyGfHdWVUZy00WXTmDteDSETlHN1+5hWZVgG3HIGVHTTbhN1z/RI79mO4/zM2dcI/225Hg4dgHIUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:56:23.059161Z"},"content_sha256":"47162ec0147bad3a62a666b066039a6d1bcc3e8baba385c46ad2ec7177f5256c","schema_version":"1.0","event_id":"sha256:47162ec0147bad3a62a666b066039a6d1bcc3e8baba385c46ad2ec7177f5256c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CY6I5TFXMLSODG2EPX2YJ2EPJ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Detecting dense communities in large social and information networks with the Core & Peel algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Filippo Geraci, Marco Pellegrini, Miriam Baglioni","submitted_at":"2012-10-11T15:17:35Z","abstract_excerpt":"Detecting and characterizing dense subgraphs (tight communities) in social and information networks is an important exploratory tool in social network analysis. Several approaches have been proposed that either (i) partition the whole network into clusters, even in low density region, or (ii) are aimed at finding a single densest community (and need to be iterated to find the next one). As social networks grow larger both approaches (i) and (ii) result in algorithms too slow to be practical, in particular when speed in analyzing the data is required. In this paper we propose an approach that a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3266","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-18T03:43:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"esYLLCdBEVINXtIFPD11UQatoZAhqY47XsoFDDWS9nHtIB1env/lU94GUJzbNd+AJJm7nZ+8gwZrHZrIy1B9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:56:23.059844Z"},"content_sha256":"219b1a24b26a2ecd9956bec82eb9b38c6e9b11b939f39aa4db47f0e787dce40d","schema_version":"1.0","event_id":"sha256:219b1a24b26a2ecd9956bec82eb9b38c6e9b11b939f39aa4db47f0e787dce40d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CY6I5TFXMLSODG2EPX2YJ2EPJ5/bundle.json","state_url":"https://pith.science/pith/CY6I5TFXMLSODG2EPX2YJ2EPJ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CY6I5TFXMLSODG2EPX2YJ2EPJ5/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-05-29T19:56:23Z","links":{"resolver":"https://pith.science/pith/CY6I5TFXMLSODG2EPX2YJ2EPJ5","bundle":"https://pith.science/pith/CY6I5TFXMLSODG2EPX2YJ2EPJ5/bundle.json","state":"https://pith.science/pith/CY6I5TFXMLSODG2EPX2YJ2EPJ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CY6I5TFXMLSODG2EPX2YJ2EPJ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CY6I5TFXMLSODG2EPX2YJ2EPJ5","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":"d57a174385d2bd4f7d64cf9fcedc7e06bfbd71d156ecc8a9b9608f0a99c1c9c2","cross_cats_sorted":["cs.DS","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-10-11T15:17:35Z","title_canon_sha256":"658ce886b40cd87ef622d6562280c6964fbfdfd34b28300632d68eb314424988"},"schema_version":"1.0","source":{"id":"1210.3266","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.3266","created_at":"2026-05-18T03:43:27Z"},{"alias_kind":"arxiv_version","alias_value":"1210.3266v1","created_at":"2026-05-18T03:43:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.3266","created_at":"2026-05-18T03:43:27Z"},{"alias_kind":"pith_short_12","alias_value":"CY6I5TFXMLSO","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CY6I5TFXMLSODG2E","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CY6I5TFX","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:219b1a24b26a2ecd9956bec82eb9b38c6e9b11b939f39aa4db47f0e787dce40d","target":"graph","created_at":"2026-05-18T03:43:27Z","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":"Detecting and characterizing dense subgraphs (tight communities) in social and information networks is an important exploratory tool in social network analysis. Several approaches have been proposed that either (i) partition the whole network into clusters, even in low density region, or (ii) are aimed at finding a single densest community (and need to be iterated to find the next one). As social networks grow larger both approaches (i) and (ii) result in algorithms too slow to be practical, in particular when speed in analyzing the data is required. In this paper we propose an approach that a","authors_text":"Filippo Geraci, Marco Pellegrini, Miriam Baglioni","cross_cats":["cs.DS","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-10-11T15:17:35Z","title":"Detecting dense communities in large social and information networks with the Core & Peel algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.3266","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:47162ec0147bad3a62a666b066039a6d1bcc3e8baba385c46ad2ec7177f5256c","target":"record","created_at":"2026-05-18T03:43:27Z","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":"d57a174385d2bd4f7d64cf9fcedc7e06bfbd71d156ecc8a9b9608f0a99c1c9c2","cross_cats_sorted":["cs.DS","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2012-10-11T15:17:35Z","title_canon_sha256":"658ce886b40cd87ef622d6562280c6964fbfdfd34b28300632d68eb314424988"},"schema_version":"1.0","source":{"id":"1210.3266","kind":"arxiv","version":1}},"canonical_sha256":"163c8eccb762e4e19b447df584e88f4f539cd52e1d86695e98be5a919c796063","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"163c8eccb762e4e19b447df584e88f4f539cd52e1d86695e98be5a919c796063","first_computed_at":"2026-05-18T03:43:27.847954Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:27.847954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QI9gJW2ATa3ssFaMUfSpSKiNAq/R4aDwB95h3sqvQkjfpgZaf0gD86K7p/CIJRSwwO4QjU20MPtNc9EZWA8OAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:27.848659Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.3266","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47162ec0147bad3a62a666b066039a6d1bcc3e8baba385c46ad2ec7177f5256c","sha256:219b1a24b26a2ecd9956bec82eb9b38c6e9b11b939f39aa4db47f0e787dce40d"],"state_sha256":"af0e1620ebefdcb8a546c85e485d8784a5287aa126d726ac61c7498528a0bb40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NAoOQlOW+4FWFapd8F0WKEJPp0vS0XFe/lOEJGfWnKvufG4g66KI2aLl0TilDu9td+1RU4+s0GWDrxmEOW7dCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T19:56:23.063466Z","bundle_sha256":"51df6eb88b2399614a198066b43810c87fe12347514adbc67d0f2a4fe1fb16a9"}}