{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FXUWSWA74REO35DFCOX6S5WUC3","short_pith_number":"pith:FXUWSWA7","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"},"canonical_sha256":"2de969581fe448edf46513afe976d416e8d11e2d85dc933d6a45c6d99f657fe3","source":{"kind":"arxiv","id":"1901.04873","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.04873","created_at":"2026-05-17T23:56:21Z"},{"alias_kind":"arxiv_version","alias_value":"1901.04873v1","created_at":"2026-05-17T23:56:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04873","created_at":"2026-05-17T23:56:21Z"},{"alias_kind":"pith_short_12","alias_value":"FXUWSWA74REO","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"FXUWSWA74REO35DF","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"FXUWSWA7","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FXUWSWA74REO35DFCOX6S5WUC3","target":"record","payload":{"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"},"canonical_sha256":"2de969581fe448edf46513afe976d416e8d11e2d85dc933d6a45c6d99f657fe3","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"},"source_kind":"arxiv","source_id":"1901.04873","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-17T23:56:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UTJV/4CS6+UXB3wvdPcjDU7aSh4Vw/42Z/TO29dDYoTPiIgmmLuvusaDThY3oy3XJSVtrRkEv5AWVoseQBJQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:54:33.174860Z"},"content_sha256":"d3e6b6e27dac17c1a3e434238603721170d356b05edd7087023e1f67ccbb1793","schema_version":"1.0","event_id":"sha256:d3e6b6e27dac17c1a3e434238603721170d356b05edd7087023e1f67ccbb1793"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FXUWSWA74REO35DFCOX6S5WUC3","target":"graph","payload":{"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"},"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-17T23:56:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nj9ePqXhHLAJA/0wkSkwicjK495OhjVYQfTFGPJLT/ET7eDwCBJRIFzEkv20trI37TmuWg15zcdbqDwrNC11Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:54:33.175520Z"},"content_sha256":"e1fb017000c782db6a84adf741eaeae9450cbfc301629db89566b788ef0438d8","schema_version":"1.0","event_id":"sha256:e1fb017000c782db6a84adf741eaeae9450cbfc301629db89566b788ef0438d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FXUWSWA74REO35DFCOX6S5WUC3/bundle.json","state_url":"https://pith.science/pith/FXUWSWA74REO35DFCOX6S5WUC3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FXUWSWA74REO35DFCOX6S5WUC3/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-05-26T13:54:33Z","links":{"resolver":"https://pith.science/pith/FXUWSWA74REO35DFCOX6S5WUC3","bundle":"https://pith.science/pith/FXUWSWA74REO35DFCOX6S5WUC3/bundle.json","state":"https://pith.science/pith/FXUWSWA74REO35DFCOX6S5WUC3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FXUWSWA74REO35DFCOX6S5WUC3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FXUWSWA74REO35DFCOX6S5WUC3","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":"f7203c37219a1bfd69c189014fefe36928e269a392bf6c9abe0fc0f0e53730e8","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-12T02:15:16Z","title_canon_sha256":"8f4f5bdb19bfdc0c2c66262358f9d45a3bf57433bb835eaa6e25db7382f17a16"},"schema_version":"1.0","source":{"id":"1901.04873","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.04873","created_at":"2026-05-17T23:56:21Z"},{"alias_kind":"arxiv_version","alias_value":"1901.04873v1","created_at":"2026-05-17T23:56:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04873","created_at":"2026-05-17T23:56:21Z"},{"alias_kind":"pith_short_12","alias_value":"FXUWSWA74REO","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"FXUWSWA74REO35DF","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"FXUWSWA7","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:e1fb017000c782db6a84adf741eaeae9450cbfc301629db89566b788ef0438d8","target":"graph","created_at":"2026-05-17T23:56:21Z","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":"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.","authors_text":"Clemens Adolphs, Daniel Crawford, Ehsan Zahedinejad, Jaspreet S. Oberoi","cross_cats":["physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-12T02:15:16Z","title":"Multi-Community Detection in Signed Graphs Using Quantum Hardware"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04873","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:d3e6b6e27dac17c1a3e434238603721170d356b05edd7087023e1f67ccbb1793","target":"record","created_at":"2026-05-17T23:56:21Z","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":"f7203c37219a1bfd69c189014fefe36928e269a392bf6c9abe0fc0f0e53730e8","cross_cats_sorted":["physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-12T02:15:16Z","title_canon_sha256":"8f4f5bdb19bfdc0c2c66262358f9d45a3bf57433bb835eaa6e25db7382f17a16"},"schema_version":"1.0","source":{"id":"1901.04873","kind":"arxiv","version":1}},"canonical_sha256":"2de969581fe448edf46513afe976d416e8d11e2d85dc933d6a45c6d99f657fe3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2de969581fe448edf46513afe976d416e8d11e2d85dc933d6a45c6d99f657fe3","first_computed_at":"2026-05-17T23:56:21.445110Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:21.445110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MwNhOHU+C3xTHOuT3ZK214pws8NhS4KR4JGYYicoTBQRgzCLD9hxIjtjeMzU4BuYTlDEEn4YGWsk/Nt+uFqNDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:21.445824Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.04873","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3e6b6e27dac17c1a3e434238603721170d356b05edd7087023e1f67ccbb1793","sha256:e1fb017000c782db6a84adf741eaeae9450cbfc301629db89566b788ef0438d8"],"state_sha256":"93ac9ece4c6f914e2e53abbd09f0f1cc707532d14cd421e404d3915f66610c50"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"anpJsC6CKKUqsaOGdUDFog2pf+Qx9opHQ9IY6yUvqV8G0y/RzSG+0WzPTYA07CV9wFPe3+izsjy2dXsjN9miAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:54:33.179275Z","bundle_sha256":"f608788ac801cb137396baf64c0f5e2f9f7c18e3559253913d795b237c779854"}}