{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HVKAEV5VBNNET62MUOKZVNZDZC","short_pith_number":"pith:HVKAEV5V","schema_version":"1.0","canonical_sha256":"3d540257b50b5a49fb4ca3959ab723c8b566fb56cba6b6288ff734763c69454f","source":{"kind":"arxiv","id":"1702.00109","version":1},"attestation_state":"computed","paper":{"title":"Info-Clustering: An Efficient Algorithm by Network Information Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Al-Bashabsheh, Chung Chan, Qiaoqiao Zhou","submitted_at":"2017-02-01T03:04:15Z","abstract_excerpt":"Motivated by the fact that entities in a social network or biological system often interact by exchanging information, we propose an efficient info-clustering algorithm that can group entities into communities using a parametric max-flow algorithm. This is a meaningful special case of the info-clustering paradigm where the dependency structure is graphical and can be learned readily from data."},"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":"1702.00109","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-02-01T03:04:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6067172fcbded6be1bb1dcd797c31c28a4da6c402c4d9d8942058bb3ff2f026f","abstract_canon_sha256":"dcf5c763950670d60fbb356c13f00d6e8917a637fb1db7bd61d4fd9ddaa1597d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:35.198998Z","signature_b64":"GHs3A0Aq0Ze0KF6s8Bz/sx7s0j5cXF89yxZP/Edrh7IwZjBsZr2vopwM4ZxIjI8FJqAJKqovTJwxA8HQNPGABw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d540257b50b5a49fb4ca3959ab723c8b566fb56cba6b6288ff734763c69454f","last_reissued_at":"2026-05-18T00:51:35.198639Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:35.198639Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Info-Clustering: An Efficient Algorithm by Network Information Flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Al-Bashabsheh, Chung Chan, Qiaoqiao Zhou","submitted_at":"2017-02-01T03:04:15Z","abstract_excerpt":"Motivated by the fact that entities in a social network or biological system often interact by exchanging information, we propose an efficient info-clustering algorithm that can group entities into communities using a parametric max-flow algorithm. This is a meaningful special case of the info-clustering paradigm where the dependency structure is graphical and can be learned readily from data."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.00109","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.00109","created_at":"2026-05-18T00:51:35.198692+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.00109v1","created_at":"2026-05-18T00:51:35.198692+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.00109","created_at":"2026-05-18T00:51:35.198692+00:00"},{"alias_kind":"pith_short_12","alias_value":"HVKAEV5VBNNE","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"HVKAEV5VBNNET62M","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"HVKAEV5V","created_at":"2026-05-18T12:31:21.493067+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/HVKAEV5VBNNET62MUOKZVNZDZC","json":"https://pith.science/pith/HVKAEV5VBNNET62MUOKZVNZDZC.json","graph_json":"https://pith.science/api/pith-number/HVKAEV5VBNNET62MUOKZVNZDZC/graph.json","events_json":"https://pith.science/api/pith-number/HVKAEV5VBNNET62MUOKZVNZDZC/events.json","paper":"https://pith.science/paper/HVKAEV5V"},"agent_actions":{"view_html":"https://pith.science/pith/HVKAEV5VBNNET62MUOKZVNZDZC","download_json":"https://pith.science/pith/HVKAEV5VBNNET62MUOKZVNZDZC.json","view_paper":"https://pith.science/paper/HVKAEV5V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.00109&json=true","fetch_graph":"https://pith.science/api/pith-number/HVKAEV5VBNNET62MUOKZVNZDZC/graph.json","fetch_events":"https://pith.science/api/pith-number/HVKAEV5VBNNET62MUOKZVNZDZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HVKAEV5VBNNET62MUOKZVNZDZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HVKAEV5VBNNET62MUOKZVNZDZC/action/storage_attestation","attest_author":"https://pith.science/pith/HVKAEV5VBNNET62MUOKZVNZDZC/action/author_attestation","sign_citation":"https://pith.science/pith/HVKAEV5VBNNET62MUOKZVNZDZC/action/citation_signature","submit_replication":"https://pith.science/pith/HVKAEV5VBNNET62MUOKZVNZDZC/action/replication_record"}},"created_at":"2026-05-18T00:51:35.198692+00:00","updated_at":"2026-05-18T00:51:35.198692+00:00"}