{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KAJ4ER3PVQGQUR6XNCDWKA3X2M","short_pith_number":"pith:KAJ4ER3P","canonical_record":{"source":{"id":"1505.04300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-16T17:44:46Z","cross_cats_sorted":[],"title_canon_sha256":"0c1215aceb9431edfe01382d81419569e71bf366f34ab3cafafd4fb48d205bee","abstract_canon_sha256":"ce78b1441340c3a180889713592c369105a5c9f2ee7b6d915c2d2f51d78bdb42"},"schema_version":"1.0"},"canonical_sha256":"5013c2476fac0d0a47d76887650377d3276327d08b86fdb9a7fedb3fb6a8f046","source":{"kind":"arxiv","id":"1505.04300","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KAJ4ER3PVQGQUR6XNCDWKA3X2M","target":"record","payload":{"canonical_record":{"source":{"id":"1505.04300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-16T17:44:46Z","cross_cats_sorted":[],"title_canon_sha256":"0c1215aceb9431edfe01382d81419569e71bf366f34ab3cafafd4fb48d205bee","abstract_canon_sha256":"ce78b1441340c3a180889713592c369105a5c9f2ee7b6d915c2d2f51d78bdb42"},"schema_version":"1.0"},"canonical_sha256":"5013c2476fac0d0a47d76887650377d3276327d08b86fdb9a7fedb3fb6a8f046","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:25.805408Z","signature_b64":"vCPOKp4Fr2XlDSuLgDwxYp5E6ADSZslP/YmcTHgrLS7HXY4JGyNERIO9cyjRqKKzc5ALXSDDYwj8uRZtEw9zBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5013c2476fac0d0a47d76887650377d3276327d08b86fdb9a7fedb3fb6a8f046","last_reissued_at":"2026-05-18T02:07:25.805022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:25.805022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.04300","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-18T02:07:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BFREBZmWIuaxaV4pFRwuM1iTeSzh5Hqzi1yLE6Jlf9z/AJigp2SpIZAJl/JeH+mKFqQXUG9OfF/i+17wBgpHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T04:36:28.601786Z"},"content_sha256":"eda9341694a7fa3ba60b90e3b85db03b4d1bcceda135b0d54801899fdaf88d67","schema_version":"1.0","event_id":"sha256:eda9341694a7fa3ba60b90e3b85db03b4d1bcceda135b0d54801899fdaf88d67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KAJ4ER3PVQGQUR6XNCDWKA3X2M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Graph Theoretical Analysis of the Number of Edges in k-dense Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Henry Escuardo, Karl R.B. Schmitt, Linda Eroh, Ralucca Gera, Samuel Prahlow","submitted_at":"2015-05-16T17:44:46Z","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_"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04300","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-18T02:07:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d37hukRC6lfmkMWiwG5wnvQgirppAnjIyXjyL5fdYccOeegn/vyE6NFjkB1OlkAianreNcffOL5YmOCC2R7CCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T04:36:28.602118Z"},"content_sha256":"1c0d6aa06c69a297d6c261299c60d59d9679e75d04a44662765374ebabb2fcee","schema_version":"1.0","event_id":"sha256:1c0d6aa06c69a297d6c261299c60d59d9679e75d04a44662765374ebabb2fcee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KAJ4ER3PVQGQUR6XNCDWKA3X2M/bundle.json","state_url":"https://pith.science/pith/KAJ4ER3PVQGQUR6XNCDWKA3X2M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KAJ4ER3PVQGQUR6XNCDWKA3X2M/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-06-25T04:36:28Z","links":{"resolver":"https://pith.science/pith/KAJ4ER3PVQGQUR6XNCDWKA3X2M","bundle":"https://pith.science/pith/KAJ4ER3PVQGQUR6XNCDWKA3X2M/bundle.json","state":"https://pith.science/pith/KAJ4ER3PVQGQUR6XNCDWKA3X2M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KAJ4ER3PVQGQUR6XNCDWKA3X2M/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HwAQd1fm7B7M7mvkDkQHfqHEPtSVe2EnAXlxCQ7acVhhe7RaLxR90B2Obh/mDwAw/Gj/gSCGCXByJ03fjDiJDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T04:36:28.604016Z","bundle_sha256":"2e74b2b64984e172bd47602718240030fcbd49f648868ab6f93c5fa469812246"}}