{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KAJ4ER3PVQGQUR6XNCDWKA3X2M","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":"ce78b1441340c3a180889713592c369105a5c9f2ee7b6d915c2d2f51d78bdb42","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-16T17:44:46Z","title_canon_sha256":"0c1215aceb9431edfe01382d81419569e71bf366f34ab3cafafd4fb48d205bee"},"schema_version":"1.0","source":{"id":"1505.04300","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04300","created_at":"2026-05-18T02:07:25Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04300v1","created_at":"2026-05-18T02:07:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04300","created_at":"2026-05-18T02:07:25Z"},{"alias_kind":"pith_short_12","alias_value":"KAJ4ER3PVQGQ","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KAJ4ER3PVQGQUR6X","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KAJ4ER3P","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:1c0d6aa06c69a297d6c261299c60d59d9679e75d04a44662765374ebabb2fcee","target":"graph","created_at":"2026-05-18T02:07:25Z","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":"Due to the increasing discovery and implementation of networks within all disciplines of life, the study of subgraph connectivity has become increasingly important. Motivated by the idea of community (or sub-graph) detection within a network/graph, we focused on finding characterizations of k-dense communities. For each edge $uv\\in E(G)$, the {\\bf edge multiplicity} of $uv$ in $G$ is given by $m_G(uv)=|N_{G}(u)\\cap N_{G}(v)|.$ For an integer $k$ with $k\\ge 2$, a {\\bf $k$-dense community} of a graph $G$, denoted by $DC_k(G)$, is a maximal connected subgraph of $G$ induced by the vertex set $$V_","authors_text":"Henry Escuardo, Karl R.B. Schmitt, Linda Eroh, Ralucca Gera, Samuel Prahlow","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-16T17:44:46Z","title":"A Graph Theoretical Analysis of the Number of Edges in k-dense Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04300","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:eda9341694a7fa3ba60b90e3b85db03b4d1bcceda135b0d54801899fdaf88d67","target":"record","created_at":"2026-05-18T02:07:25Z","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":"ce78b1441340c3a180889713592c369105a5c9f2ee7b6d915c2d2f51d78bdb42","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-16T17:44:46Z","title_canon_sha256":"0c1215aceb9431edfe01382d81419569e71bf366f34ab3cafafd4fb48d205bee"},"schema_version":"1.0","source":{"id":"1505.04300","kind":"arxiv","version":1}},"canonical_sha256":"5013c2476fac0d0a47d76887650377d3276327d08b86fdb9a7fedb3fb6a8f046","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5013c2476fac0d0a47d76887650377d3276327d08b86fdb9a7fedb3fb6a8f046","first_computed_at":"2026-05-18T02:07:25.805022Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:07:25.805022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vCPOKp4Fr2XlDSuLgDwxYp5E6ADSZslP/YmcTHgrLS7HXY4JGyNERIO9cyjRqKKzc5ALXSDDYwj8uRZtEw9zBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:07:25.805408Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.04300","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eda9341694a7fa3ba60b90e3b85db03b4d1bcceda135b0d54801899fdaf88d67","sha256:1c0d6aa06c69a297d6c261299c60d59d9679e75d04a44662765374ebabb2fcee"],"state_sha256":"23b29156ca1ade23af62e628a71ce8be4a354954cbd7b17c24d46cebc83a2ccf"}