{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FGXEP6XUB5XFI7AEWHVM2J254J","short_pith_number":"pith:FGXEP6XU","schema_version":"1.0","canonical_sha256":"29ae47faf40f6e547c04b1eacd275de25057a8c8866bc15f38c94dc1759051c5","source":{"kind":"arxiv","id":"1412.5666","version":5},"attestation_state":"computed","paper":{"title":"Bipartite Communities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"math.CO","authors_text":"Kelly Yancey, Matthew Yancey","submitted_at":"2014-12-17T22:54:49Z","abstract_excerpt":"For a given graph, $G$, let $A$ be the adjacency matrix, $D$ is the diagonal matrix of degrees, $L' = D - A$ is the combinatorial Laplacian, and $L = D^{-1/2}L'D^{-1/2}$ is the normalized Laplacian. Recently, the eigenvectors corresponding to the smallest eigenvalues of $L$ and $L'$ have been of great interest because of their application to community detection, which is a nebulously defined problem that essentially seeks to find a vertex set $S$ such that there are few edges incident with exactly one vertex of $S$. The connection between community detection and the second smallest eigenvalue "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1412.5666","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-17T22:54:49Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"685fc244ba110bfe4f6fa60728d30fc623118de224815dd3f6e2deb95a3744b2","abstract_canon_sha256":"aa4f49c487cce227a9463c9101bbffa5adb51c225dc50d93099687f1bb47381d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:25.637156Z","signature_b64":"TeoyCNiHZnfOGf2s00Id0BdWz8TavyhyIRz0YsKrVBf/pg6zdH/dpKC6l5y+XwJ72ZDPz98pZmlljfqcJaYMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29ae47faf40f6e547c04b1eacd275de25057a8c8866bc15f38c94dc1759051c5","last_reissued_at":"2026-05-18T01:18:25.636737Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:25.636737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bipartite Communities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"math.CO","authors_text":"Kelly Yancey, Matthew Yancey","submitted_at":"2014-12-17T22:54:49Z","abstract_excerpt":"For a given graph, $G$, let $A$ be the adjacency matrix, $D$ is the diagonal matrix of degrees, $L' = D - A$ is the combinatorial Laplacian, and $L = D^{-1/2}L'D^{-1/2}$ is the normalized Laplacian. Recently, the eigenvectors corresponding to the smallest eigenvalues of $L$ and $L'$ have been of great interest because of their application to community detection, which is a nebulously defined problem that essentially seeks to find a vertex set $S$ such that there are few edges incident with exactly one vertex of $S$. The connection between community detection and the second smallest eigenvalue "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.5666","kind":"arxiv","version":5},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.5666","created_at":"2026-05-18T01:18:25.636798+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.5666v5","created_at":"2026-05-18T01:18:25.636798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.5666","created_at":"2026-05-18T01:18:25.636798+00:00"},{"alias_kind":"pith_short_12","alias_value":"FGXEP6XUB5XF","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FGXEP6XUB5XFI7AE","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FGXEP6XU","created_at":"2026-05-18T12:28:28.263976+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FGXEP6XUB5XFI7AEWHVM2J254J","json":"https://pith.science/pith/FGXEP6XUB5XFI7AEWHVM2J254J.json","graph_json":"https://pith.science/api/pith-number/FGXEP6XUB5XFI7AEWHVM2J254J/graph.json","events_json":"https://pith.science/api/pith-number/FGXEP6XUB5XFI7AEWHVM2J254J/events.json","paper":"https://pith.science/paper/FGXEP6XU"},"agent_actions":{"view_html":"https://pith.science/pith/FGXEP6XUB5XFI7AEWHVM2J254J","download_json":"https://pith.science/pith/FGXEP6XUB5XFI7AEWHVM2J254J.json","view_paper":"https://pith.science/paper/FGXEP6XU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.5666&json=true","fetch_graph":"https://pith.science/api/pith-number/FGXEP6XUB5XFI7AEWHVM2J254J/graph.json","fetch_events":"https://pith.science/api/pith-number/FGXEP6XUB5XFI7AEWHVM2J254J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FGXEP6XUB5XFI7AEWHVM2J254J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FGXEP6XUB5XFI7AEWHVM2J254J/action/storage_attestation","attest_author":"https://pith.science/pith/FGXEP6XUB5XFI7AEWHVM2J254J/action/author_attestation","sign_citation":"https://pith.science/pith/FGXEP6XUB5XFI7AEWHVM2J254J/action/citation_signature","submit_replication":"https://pith.science/pith/FGXEP6XUB5XFI7AEWHVM2J254J/action/replication_record"}},"created_at":"2026-05-18T01:18:25.636798+00:00","updated_at":"2026-05-18T01:18:25.636798+00:00"}