{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:GA5M4UVXFOOJHBSRF44WKEAVW5","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":"ceb80128f41e00aaa2163a5a5ba51a212c32d062e87b321c2adec4132be7f288","cross_cats_sorted":["cond-mat.stat-mech","q-fin.RM","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-30T07:18:53Z","title_canon_sha256":"139017f3bc9d260fba58fb5f7aadb1ed25f97a95a3438d2d3ff6004c813a6210"},"schema_version":"1.0","source":{"id":"2501.00075","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.00075","created_at":"2026-07-05T09:55:38Z"},{"alias_kind":"arxiv_version","alias_value":"2501.00075v1","created_at":"2026-07-05T09:55:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.00075","created_at":"2026-07-05T09:55:38Z"},{"alias_kind":"pith_short_12","alias_value":"GA5M4UVXFOOJ","created_at":"2026-07-05T09:55:38Z"},{"alias_kind":"pith_short_16","alias_value":"GA5M4UVXFOOJHBSR","created_at":"2026-07-05T09:55:38Z"},{"alias_kind":"pith_short_8","alias_value":"GA5M4UVX","created_at":"2026-07-05T09:55:38Z"}],"graph_snapshots":[{"event_id":"sha256:38b5ac874398df4cd0c62c9854993bb7a59e79e722b942d11e3e942e9a9bcbf2","target":"graph","created_at":"2026-07-05T09:55:38Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.00075/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Community detection, also known as graph partitioning, is a well-known NP-hard combinatorial optimization problem with applications in diverse fields such as complex network theory, transportation, and smart power grids. The problem's solution space grows drastically with the number of vertices and subgroups, making efficient algorithms crucial. In recent years, quantum computing has emerged as a promising approach to tackling NP-hard problems. This study explores the use of a quantum-inspired algorithm, Simulated Bifurcation (SB), for community detection. Modularity is employed as both the ob","authors_text":"Horst St\\\"ocker, Konrad Tywoniuk, Kyle Godbey, Nan Su, Wei Li, Yi-lun Du","cross_cats":["cond-mat.stat-mech","q-fin.RM","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-30T07:18:53Z","title":"Community detection by simulated bifurcation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.00075","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:a05acd950ac433a8c7e00139ca88697d8397f8ba1bd378232efb83f4998f289f","target":"record","created_at":"2026-07-05T09:55:38Z","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":"ceb80128f41e00aaa2163a5a5ba51a212c32d062e87b321c2adec4132be7f288","cross_cats_sorted":["cond-mat.stat-mech","q-fin.RM","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-30T07:18:53Z","title_canon_sha256":"139017f3bc9d260fba58fb5f7aadb1ed25f97a95a3438d2d3ff6004c813a6210"},"schema_version":"1.0","source":{"id":"2501.00075","kind":"arxiv","version":1}},"canonical_sha256":"303ace52b72b9c9386512f39651015b740da7b3689746b40cccc4c642f965f2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"303ace52b72b9c9386512f39651015b740da7b3689746b40cccc4c642f965f2b","first_computed_at":"2026-07-05T09:55:38.734173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:55:38.734173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+mLHgMJwsCsnIbTzejkPbfzmdwUW1t22hr0PWv1ag0U5sEhUzrEBuy0TvC8gn3wHZS4m/h1KAxMmB4hwznrLCA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:55:38.734698Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.00075","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a05acd950ac433a8c7e00139ca88697d8397f8ba1bd378232efb83f4998f289f","sha256:38b5ac874398df4cd0c62c9854993bb7a59e79e722b942d11e3e942e9a9bcbf2"],"state_sha256":"5ea2d1f317f2643b859ebd288c002f729d62536bf7c15dc388d7ac87925ab38d"}