{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:L224HEAWB5U5X5P6L56LTWLLSH","short_pith_number":"pith:L224HEAW","canonical_record":{"source":{"id":"1411.3312","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-11-12T20:31:39Z","cross_cats_sorted":[],"title_canon_sha256":"6001c0fab7f88151a49c71c67fb0d093367e80d3c0cb64d2a5e98fb46fef77d1","abstract_canon_sha256":"a0199fa88525026009ec069b9c0d9e91c74f6b97ac172058a858be1297b11c5c"},"schema_version":"1.0"},"canonical_sha256":"5eb5c390160f69dbf5fe5f7cb9d96b91d81bc9a20c80213dcd1bd0c77a0d7f4c","source":{"kind":"arxiv","id":"1411.3312","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3312","created_at":"2026-05-18T02:25:19Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3312v2","created_at":"2026-05-18T02:25:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3312","created_at":"2026-05-18T02:25:19Z"},{"alias_kind":"pith_short_12","alias_value":"L224HEAWB5U5","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"L224HEAWB5U5X5P6","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"L224HEAW","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:L224HEAWB5U5X5P6L56LTWLLSH","target":"record","payload":{"canonical_record":{"source":{"id":"1411.3312","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-11-12T20:31:39Z","cross_cats_sorted":[],"title_canon_sha256":"6001c0fab7f88151a49c71c67fb0d093367e80d3c0cb64d2a5e98fb46fef77d1","abstract_canon_sha256":"a0199fa88525026009ec069b9c0d9e91c74f6b97ac172058a858be1297b11c5c"},"schema_version":"1.0"},"canonical_sha256":"5eb5c390160f69dbf5fe5f7cb9d96b91d81bc9a20c80213dcd1bd0c77a0d7f4c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:19.769454Z","signature_b64":"nmUxl2DG75ClyujsYlGtW7EhF/a3/VOnnPk5gvgbuqV5C2Xn/8KSP4HHLbb0w0rUwKDXB5dFnbu/uFlrAiMlDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5eb5c390160f69dbf5fe5f7cb9d96b91d81bc9a20c80213dcd1bd0c77a0d7f4c","last_reissued_at":"2026-05-18T02:25:19.769056Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:19.769056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.3312","source_version":2,"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-18T02:25:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C8loMTZDn9IYUn8xia4zIul1lgIWp7yCs0AdtA7uE8Q2FkdM0qekfH1SX6kBSoci+YmKkxjECDLN/ns2p0ZfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:42:55.666090Z"},"content_sha256":"5f74bf6e61e234296a487b43d1ffa38495bd9ca48c5edf3ca253fd237b301009","schema_version":"1.0","event_id":"sha256:5f74bf6e61e234296a487b43d1ffa38495bd9ca48c5edf3ca253fd237b301009"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:L224HEAWB5U5X5P6L56LTWLLSH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Ahmet Erdem Sariyuce, Ali Pinar, C. Seshadhri, Umit V. Catalyurek","submitted_at":"2014-11-12T20:31:39Z","abstract_excerpt":"Finding dense substructures in a graph is a fundamental graph mining operation, with applications in bioinformatics, social networks, and visualization to name a few. Yet most standard formulations of this problem (like clique, quasiclique, k-densest subgraph) are NP-hard. Furthermore, the goal is rarely to find the \"true optimum\", but to identify many (if not all) dense substructures, understand their distribution in the graph, and ideally determine relationships among them. Current dense subgraph finding algorithms usually optimize some objective, and only find a few such subgraphs without p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3312","kind":"arxiv","version":2},"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-18T02:25:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RdXQfx+uMz7OhBBCQOoxa8ezLdoc7OhCuUIAeE815S39MqvPa4XpMbm5r88zQwj8HI+dC6lFUM+FvXwsztLnDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:42:55.666746Z"},"content_sha256":"f7223177bfee49b1875f070392a967819487ed7bb34f1bcb00774a194dc3a405","schema_version":"1.0","event_id":"sha256:f7223177bfee49b1875f070392a967819487ed7bb34f1bcb00774a194dc3a405"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L224HEAWB5U5X5P6L56LTWLLSH/bundle.json","state_url":"https://pith.science/pith/L224HEAWB5U5X5P6L56LTWLLSH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L224HEAWB5U5X5P6L56LTWLLSH/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-27T04:42:55Z","links":{"resolver":"https://pith.science/pith/L224HEAWB5U5X5P6L56LTWLLSH","bundle":"https://pith.science/pith/L224HEAWB5U5X5P6L56LTWLLSH/bundle.json","state":"https://pith.science/pith/L224HEAWB5U5X5P6L56LTWLLSH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L224HEAWB5U5X5P6L56LTWLLSH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:L224HEAWB5U5X5P6L56LTWLLSH","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":"a0199fa88525026009ec069b9c0d9e91c74f6b97ac172058a858be1297b11c5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-11-12T20:31:39Z","title_canon_sha256":"6001c0fab7f88151a49c71c67fb0d093367e80d3c0cb64d2a5e98fb46fef77d1"},"schema_version":"1.0","source":{"id":"1411.3312","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.3312","created_at":"2026-05-18T02:25:19Z"},{"alias_kind":"arxiv_version","alias_value":"1411.3312v2","created_at":"2026-05-18T02:25:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3312","created_at":"2026-05-18T02:25:19Z"},{"alias_kind":"pith_short_12","alias_value":"L224HEAWB5U5","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"L224HEAWB5U5X5P6","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"L224HEAW","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:f7223177bfee49b1875f070392a967819487ed7bb34f1bcb00774a194dc3a405","target":"graph","created_at":"2026-05-18T02:25:19Z","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":"Finding dense substructures in a graph is a fundamental graph mining operation, with applications in bioinformatics, social networks, and visualization to name a few. Yet most standard formulations of this problem (like clique, quasiclique, k-densest subgraph) are NP-hard. Furthermore, the goal is rarely to find the \"true optimum\", but to identify many (if not all) dense substructures, understand their distribution in the graph, and ideally determine relationships among them. Current dense subgraph finding algorithms usually optimize some objective, and only find a few such subgraphs without p","authors_text":"Ahmet Erdem Sariyuce, Ali Pinar, C. Seshadhri, Umit V. Catalyurek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-11-12T20:31:39Z","title":"Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3312","kind":"arxiv","version":2},"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:5f74bf6e61e234296a487b43d1ffa38495bd9ca48c5edf3ca253fd237b301009","target":"record","created_at":"2026-05-18T02:25:19Z","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":"a0199fa88525026009ec069b9c0d9e91c74f6b97ac172058a858be1297b11c5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-11-12T20:31:39Z","title_canon_sha256":"6001c0fab7f88151a49c71c67fb0d093367e80d3c0cb64d2a5e98fb46fef77d1"},"schema_version":"1.0","source":{"id":"1411.3312","kind":"arxiv","version":2}},"canonical_sha256":"5eb5c390160f69dbf5fe5f7cb9d96b91d81bc9a20c80213dcd1bd0c77a0d7f4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5eb5c390160f69dbf5fe5f7cb9d96b91d81bc9a20c80213dcd1bd0c77a0d7f4c","first_computed_at":"2026-05-18T02:25:19.769056Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:19.769056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nmUxl2DG75ClyujsYlGtW7EhF/a3/VOnnPk5gvgbuqV5C2Xn/8KSP4HHLbb0w0rUwKDXB5dFnbu/uFlrAiMlDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:19.769454Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.3312","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f74bf6e61e234296a487b43d1ffa38495bd9ca48c5edf3ca253fd237b301009","sha256:f7223177bfee49b1875f070392a967819487ed7bb34f1bcb00774a194dc3a405"],"state_sha256":"1c90564753d72d9cd4dd52f9cf996f32bb8f3adbb7280c8594c3cd99dbd207f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5RMTRxX6FT6Wm3eYB0D3RuGm79jtwjzkNmKyv6pGOpPzu2XG/uFGI93TF5ufkUJniNVVWvQjeX8uIV2qn2HrCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T04:42:55.669712Z","bundle_sha256":"bfb1aa8987b78d20c8cea42fb502b5da1bfd156f9c7a1f1231906937d6f8b395"}}