{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3O45WEFEPL6NK5JSQA7UZ5HEUE","short_pith_number":"pith:3O45WEFE","canonical_record":{"source":{"id":"1704.00386","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-04-02T23:24:06Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"09d32310d0f8a5bfa1b3809416f713ff676cec4b7b214ff9b75ab1f2998e622a","abstract_canon_sha256":"4d40f872a88e6e9d93edd1f45095c7fd0e20ceee86861e38da7d4b6945025866"},"schema_version":"1.0"},"canonical_sha256":"dbb9db10a47afcd57532803f4cf4e4a117430df84a8634b46fc796be2ffe48ae","source":{"kind":"arxiv","id":"1704.00386","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00386","created_at":"2026-05-18T00:05:46Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00386v2","created_at":"2026-05-18T00:05:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00386","created_at":"2026-05-18T00:05:46Z"},{"alias_kind":"pith_short_12","alias_value":"3O45WEFEPL6N","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3O45WEFEPL6NK5JS","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3O45WEFE","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3O45WEFEPL6NK5JSQA7UZ5HEUE","target":"record","payload":{"canonical_record":{"source":{"id":"1704.00386","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-04-02T23:24:06Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"09d32310d0f8a5bfa1b3809416f713ff676cec4b7b214ff9b75ab1f2998e622a","abstract_canon_sha256":"4d40f872a88e6e9d93edd1f45095c7fd0e20ceee86861e38da7d4b6945025866"},"schema_version":"1.0"},"canonical_sha256":"dbb9db10a47afcd57532803f4cf4e4a117430df84a8634b46fc796be2ffe48ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:46.346705Z","signature_b64":"GOz6uPbLLLC35Aj8vwRPkMWynVgsfq8i+celQOuwK+0KkeZG/ViZCBmJkHE+h76H1oOytSr+fVAkrteFKnlICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbb9db10a47afcd57532803f4cf4e4a117430df84a8634b46fc796be2ffe48ae","last_reissued_at":"2026-05-18T00:05:46.346165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:46.346165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.00386","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-18T00:05:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m3qVPI5MLWUnqvDP1WMCzYd6dUbqbeqRo/NSFNs7wXvSrACiGzcWH5tyZ0bH5ooh4fNAL8s1tikSUB3NfMO5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:43:13.262705Z"},"content_sha256":"e6e24548ad7b00e773fc96b0b36990b73e5fcaa85c70e17c073fdc5c6d0eb972","schema_version":"1.0","event_id":"sha256:e6e24548ad7b00e773fc96b0b36990b73e5fcaa85c70e17c073fdc5c6d0eb972"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3O45WEFEPL6NK5JSQA7UZ5HEUE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Algorithms for Hierarchical Dense Subgraph Discovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.SI","authors_text":"Ahmet Erdem Sariyuce, Ali Pinar, C. Seshadhri","submitted_at":"2017-04-02T23:24:06Z","abstract_excerpt":"Finding the dense regions of a graph and relations among them is a fundamental problem in network analysis. Core and truss decompositions reveal dense subgraphs with hierarchical relations. The incremental nature of algorithms for computing these decompositions and the need for global information at each step of the algorithm hinders scalable parallelization and approximations since the densest regions are not revealed until the end. In a previous work, Lu et al. proposed to iteratively compute the $h$-indices of neighbor vertex degrees to obtain the core numbers and prove that the convergence"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00386","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-18T00:05:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1LhrpaBsiNVC/ny3DbJcjTk3MFMhca5RZSyeKVhA9YaaLXoES2QaW8LLZLbWsKV2onsGTHZtAzfWL3uIZVoBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:43:13.263361Z"},"content_sha256":"7ab3ad7c8a2b911d3a562dd41d777c79a95dc00ccf7d3dfb61a89bea05d5ecfb","schema_version":"1.0","event_id":"sha256:7ab3ad7c8a2b911d3a562dd41d777c79a95dc00ccf7d3dfb61a89bea05d5ecfb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3O45WEFEPL6NK5JSQA7UZ5HEUE/bundle.json","state_url":"https://pith.science/pith/3O45WEFEPL6NK5JSQA7UZ5HEUE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3O45WEFEPL6NK5JSQA7UZ5HEUE/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:43:13Z","links":{"resolver":"https://pith.science/pith/3O45WEFEPL6NK5JSQA7UZ5HEUE","bundle":"https://pith.science/pith/3O45WEFEPL6NK5JSQA7UZ5HEUE/bundle.json","state":"https://pith.science/pith/3O45WEFEPL6NK5JSQA7UZ5HEUE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3O45WEFEPL6NK5JSQA7UZ5HEUE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3O45WEFEPL6NK5JSQA7UZ5HEUE","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":"4d40f872a88e6e9d93edd1f45095c7fd0e20ceee86861e38da7d4b6945025866","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-04-02T23:24:06Z","title_canon_sha256":"09d32310d0f8a5bfa1b3809416f713ff676cec4b7b214ff9b75ab1f2998e622a"},"schema_version":"1.0","source":{"id":"1704.00386","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00386","created_at":"2026-05-18T00:05:46Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00386v2","created_at":"2026-05-18T00:05:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00386","created_at":"2026-05-18T00:05:46Z"},{"alias_kind":"pith_short_12","alias_value":"3O45WEFEPL6N","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3O45WEFEPL6NK5JS","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3O45WEFE","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:7ab3ad7c8a2b911d3a562dd41d777c79a95dc00ccf7d3dfb61a89bea05d5ecfb","target":"graph","created_at":"2026-05-18T00:05: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":"Finding the dense regions of a graph and relations among them is a fundamental problem in network analysis. Core and truss decompositions reveal dense subgraphs with hierarchical relations. The incremental nature of algorithms for computing these decompositions and the need for global information at each step of the algorithm hinders scalable parallelization and approximations since the densest regions are not revealed until the end. In a previous work, Lu et al. proposed to iteratively compute the $h$-indices of neighbor vertex degrees to obtain the core numbers and prove that the convergence","authors_text":"Ahmet Erdem Sariyuce, Ali Pinar, C. Seshadhri","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-04-02T23:24:06Z","title":"Local Algorithms for Hierarchical Dense Subgraph Discovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00386","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:e6e24548ad7b00e773fc96b0b36990b73e5fcaa85c70e17c073fdc5c6d0eb972","target":"record","created_at":"2026-05-18T00:05: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":"4d40f872a88e6e9d93edd1f45095c7fd0e20ceee86861e38da7d4b6945025866","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-04-02T23:24:06Z","title_canon_sha256":"09d32310d0f8a5bfa1b3809416f713ff676cec4b7b214ff9b75ab1f2998e622a"},"schema_version":"1.0","source":{"id":"1704.00386","kind":"arxiv","version":2}},"canonical_sha256":"dbb9db10a47afcd57532803f4cf4e4a117430df84a8634b46fc796be2ffe48ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dbb9db10a47afcd57532803f4cf4e4a117430df84a8634b46fc796be2ffe48ae","first_computed_at":"2026-05-18T00:05:46.346165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:46.346165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GOz6uPbLLLC35Aj8vwRPkMWynVgsfq8i+celQOuwK+0KkeZG/ViZCBmJkHE+h76H1oOytSr+fVAkrteFKnlICw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:46.346705Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.00386","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6e24548ad7b00e773fc96b0b36990b73e5fcaa85c70e17c073fdc5c6d0eb972","sha256:7ab3ad7c8a2b911d3a562dd41d777c79a95dc00ccf7d3dfb61a89bea05d5ecfb"],"state_sha256":"4c1bb45ead91b1f839740a280320f013962afa35bb1ff3b803142fc1b2aca895"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eo4B20JfUSUhrx8kM6Vf6UNzUf6UzMx3mYz/gxRiv+uC6mdsAYTgC6DeJa1OjK1tKFdqmVgKjWJv7PtT/22GDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T04:43:13.266824Z","bundle_sha256":"8391b19149ec7cfb5f753c576a898df02984505c042709c2954fbcab4f5ba261"}}