{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FXUWSWA74REO35DFCOX6S5WUC3","short_pith_number":"pith:FXUWSWA7","schema_version":"1.0","canonical_sha256":"2de969581fe448edf46513afe976d416e8d11e2d85dc933d6a45c6d99f657fe3","source":{"kind":"arxiv","id":"1901.04873","version":1},"attestation_state":"computed","paper":{"title":"Multi-Community Detection in Signed Graphs Using Quantum Hardware","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"quant-ph","authors_text":"Clemens Adolphs, Daniel Crawford, Ehsan Zahedinejad, Jaspreet S. Oberoi","submitted_at":"2019-01-12T02:15:16Z","abstract_excerpt":"Signed graphs serve as a primary tool for modelling social networks. They can represent relationships between individuals (i.e., nodes) with the use of signed edges. Finding communities in a signed graph is of great importance in many areas, for example, targeted advertisement. We propose an algorithm to detect multiple communities in a signed graph. Our method reduces the multi-community detection problem to a quadratic binary unconstrained optimization problem and uses state-of-the-art quantum or classical optimizers to find an optimal assignment of each individual to a specific community."},"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":"1901.04873","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-12T02:15:16Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"8f4f5bdb19bfdc0c2c66262358f9d45a3bf57433bb835eaa6e25db7382f17a16","abstract_canon_sha256":"f7203c37219a1bfd69c189014fefe36928e269a392bf6c9abe0fc0f0e53730e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:21.445824Z","signature_b64":"MwNhOHU+C3xTHOuT3ZK214pws8NhS4KR4JGYYicoTBQRgzCLD9hxIjtjeMzU4BuYTlDEEn4YGWsk/Nt+uFqNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2de969581fe448edf46513afe976d416e8d11e2d85dc933d6a45c6d99f657fe3","last_reissued_at":"2026-05-17T23:56:21.445110Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:21.445110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Community Detection in Signed Graphs Using Quantum Hardware","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"quant-ph","authors_text":"Clemens Adolphs, Daniel Crawford, Ehsan Zahedinejad, Jaspreet S. Oberoi","submitted_at":"2019-01-12T02:15:16Z","abstract_excerpt":"Signed graphs serve as a primary tool for modelling social networks. They can represent relationships between individuals (i.e., nodes) with the use of signed edges. Finding communities in a signed graph is of great importance in many areas, for example, targeted advertisement. We propose an algorithm to detect multiple communities in a signed graph. Our method reduces the multi-community detection problem to a quadratic binary unconstrained optimization problem and uses state-of-the-art quantum or classical optimizers to find an optimal assignment of each individual to a specific community."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04873","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":"1901.04873","created_at":"2026-05-17T23:56:21.445217+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.04873v1","created_at":"2026-05-17T23:56:21.445217+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04873","created_at":"2026-05-17T23:56:21.445217+00:00"},{"alias_kind":"pith_short_12","alias_value":"FXUWSWA74REO","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"FXUWSWA74REO35DF","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"FXUWSWA7","created_at":"2026-05-18T12:33:18.533446+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/FXUWSWA74REO35DFCOX6S5WUC3","json":"https://pith.science/pith/FXUWSWA74REO35DFCOX6S5WUC3.json","graph_json":"https://pith.science/api/pith-number/FXUWSWA74REO35DFCOX6S5WUC3/graph.json","events_json":"https://pith.science/api/pith-number/FXUWSWA74REO35DFCOX6S5WUC3/events.json","paper":"https://pith.science/paper/FXUWSWA7"},"agent_actions":{"view_html":"https://pith.science/pith/FXUWSWA74REO35DFCOX6S5WUC3","download_json":"https://pith.science/pith/FXUWSWA74REO35DFCOX6S5WUC3.json","view_paper":"https://pith.science/paper/FXUWSWA7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.04873&json=true","fetch_graph":"https://pith.science/api/pith-number/FXUWSWA74REO35DFCOX6S5WUC3/graph.json","fetch_events":"https://pith.science/api/pith-number/FXUWSWA74REO35DFCOX6S5WUC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FXUWSWA74REO35DFCOX6S5WUC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FXUWSWA74REO35DFCOX6S5WUC3/action/storage_attestation","attest_author":"https://pith.science/pith/FXUWSWA74REO35DFCOX6S5WUC3/action/author_attestation","sign_citation":"https://pith.science/pith/FXUWSWA74REO35DFCOX6S5WUC3/action/citation_signature","submit_replication":"https://pith.science/pith/FXUWSWA74REO35DFCOX6S5WUC3/action/replication_record"}},"created_at":"2026-05-17T23:56:21.445217+00:00","updated_at":"2026-05-17T23:56:21.445217+00:00"}