{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PC7BBFG3ISCPPW5RBRYVSM5SKI","short_pith_number":"pith:PC7BBFG3","canonical_record":{"source":{"id":"1611.03624","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-11T09:06:56Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"38cd3e2af09cc9a5df2b5f78451eb0336af99a9e1c8f0371e26550db555c2b45","abstract_canon_sha256":"57ec866286b516ed74714632a9f91ff9dfd4b548e7cd5fd1597fc1eb5c0e8317"},"schema_version":"1.0"},"canonical_sha256":"78be1094db4484f7dbb10c715933b25213083ff7c26133eb939fb64b989560ee","source":{"kind":"arxiv","id":"1611.03624","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03624","created_at":"2026-05-18T00:39:47Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03624v2","created_at":"2026-05-18T00:39:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03624","created_at":"2026-05-18T00:39:47Z"},{"alias_kind":"pith_short_12","alias_value":"PC7BBFG3ISCP","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PC7BBFG3ISCPPW5R","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PC7BBFG3","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PC7BBFG3ISCPPW5RBRYVSM5SKI","target":"record","payload":{"canonical_record":{"source":{"id":"1611.03624","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-11T09:06:56Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"38cd3e2af09cc9a5df2b5f78451eb0336af99a9e1c8f0371e26550db555c2b45","abstract_canon_sha256":"57ec866286b516ed74714632a9f91ff9dfd4b548e7cd5fd1597fc1eb5c0e8317"},"schema_version":"1.0"},"canonical_sha256":"78be1094db4484f7dbb10c715933b25213083ff7c26133eb939fb64b989560ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:47.212598Z","signature_b64":"hgUfKiKVKpwv9YF9eaEmc/fTrwihB2461c/GwKU+Qe+5pYDnVeTphPNpeDYEmD2P6Xt2pPOdFtjmI/LKQywECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78be1094db4484f7dbb10c715933b25213083ff7c26133eb939fb64b989560ee","last_reissued_at":"2026-05-18T00:39:47.212004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:47.212004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.03624","source_version":2,"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-18T00:39:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aeqndO2dSIszOkZQavEhNgYlde1lX3BPO029+pRGuh+t5DclmEpYtumTJdFHKwbt4QznwVU12pwMvbm2ojszDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T12:43:02.414687Z"},"content_sha256":"ddec568b6c9c4547d8f98539278b645fd9f26f810e7418bd1b9c6dfd3a7108b2","schema_version":"1.0","event_id":"sha256:ddec568b6c9c4547d8f98539278b645fd9f26f810e7418bd1b9c6dfd3a7108b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PC7BBFG3ISCPPW5RBRYVSM5SKI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Invertibility and Largest Eigenvalue of Symmetric Matrix Signings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Alexandra Kolla, Charles Carlson, Hsien-Chih Chang, Karthekeyan Chandrasekaran","submitted_at":"2016-11-11T09:06:56Z","abstract_excerpt":"The spectra of signed matrices have played a fundamental role in social sciences, graph theory, and control theory. In this work, we investigate the computational problems of identifying symmetric signings of matrices with natural spectral properties. Our results are twofold:\n  1. We show NP-completeness for the following three problems: verifying whether a given matrix has a symmetric signing that is positive semi-definite/singular/has bounded eigenvalues. However, we also illustrate that the complexity could substantially differ for input matrices that are adjacency matrices of graphs.\n  2. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03624","kind":"arxiv","version":2},"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-18T00:39:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+XDUe/hrWbc/aMvalnMyLp/f/Eew745OEY88YgRpu1bou+iaoGYlROl1VtSlHTZkVHWN9QpwERyvkTL36DQ6Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T12:43:02.415455Z"},"content_sha256":"6bde26a1a09e38ee05f07cd248a8b60a9e84345819f729d5003c41227f04e419","schema_version":"1.0","event_id":"sha256:6bde26a1a09e38ee05f07cd248a8b60a9e84345819f729d5003c41227f04e419"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PC7BBFG3ISCPPW5RBRYVSM5SKI/bundle.json","state_url":"https://pith.science/pith/PC7BBFG3ISCPPW5RBRYVSM5SKI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PC7BBFG3ISCPPW5RBRYVSM5SKI/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-23T12:43:02Z","links":{"resolver":"https://pith.science/pith/PC7BBFG3ISCPPW5RBRYVSM5SKI","bundle":"https://pith.science/pith/PC7BBFG3ISCPPW5RBRYVSM5SKI/bundle.json","state":"https://pith.science/pith/PC7BBFG3ISCPPW5RBRYVSM5SKI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PC7BBFG3ISCPPW5RBRYVSM5SKI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PC7BBFG3ISCPPW5RBRYVSM5SKI","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":"57ec866286b516ed74714632a9f91ff9dfd4b548e7cd5fd1597fc1eb5c0e8317","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-11T09:06:56Z","title_canon_sha256":"38cd3e2af09cc9a5df2b5f78451eb0336af99a9e1c8f0371e26550db555c2b45"},"schema_version":"1.0","source":{"id":"1611.03624","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03624","created_at":"2026-05-18T00:39:47Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03624v2","created_at":"2026-05-18T00:39:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03624","created_at":"2026-05-18T00:39:47Z"},{"alias_kind":"pith_short_12","alias_value":"PC7BBFG3ISCP","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PC7BBFG3ISCPPW5R","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PC7BBFG3","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:6bde26a1a09e38ee05f07cd248a8b60a9e84345819f729d5003c41227f04e419","target":"graph","created_at":"2026-05-18T00:39:47Z","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":"The spectra of signed matrices have played a fundamental role in social sciences, graph theory, and control theory. In this work, we investigate the computational problems of identifying symmetric signings of matrices with natural spectral properties. Our results are twofold:\n  1. We show NP-completeness for the following three problems: verifying whether a given matrix has a symmetric signing that is positive semi-definite/singular/has bounded eigenvalues. However, we also illustrate that the complexity could substantially differ for input matrices that are adjacency matrices of graphs.\n  2. ","authors_text":"Alexandra Kolla, Charles Carlson, Hsien-Chih Chang, Karthekeyan Chandrasekaran","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-11T09:06:56Z","title":"Invertibility and Largest Eigenvalue of Symmetric Matrix Signings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03624","kind":"arxiv","version":2},"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:ddec568b6c9c4547d8f98539278b645fd9f26f810e7418bd1b9c6dfd3a7108b2","target":"record","created_at":"2026-05-18T00:39:47Z","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":"57ec866286b516ed74714632a9f91ff9dfd4b548e7cd5fd1597fc1eb5c0e8317","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-11T09:06:56Z","title_canon_sha256":"38cd3e2af09cc9a5df2b5f78451eb0336af99a9e1c8f0371e26550db555c2b45"},"schema_version":"1.0","source":{"id":"1611.03624","kind":"arxiv","version":2}},"canonical_sha256":"78be1094db4484f7dbb10c715933b25213083ff7c26133eb939fb64b989560ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78be1094db4484f7dbb10c715933b25213083ff7c26133eb939fb64b989560ee","first_computed_at":"2026-05-18T00:39:47.212004Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:47.212004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hgUfKiKVKpwv9YF9eaEmc/fTrwihB2461c/GwKU+Qe+5pYDnVeTphPNpeDYEmD2P6Xt2pPOdFtjmI/LKQywECA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:47.212598Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.03624","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ddec568b6c9c4547d8f98539278b645fd9f26f810e7418bd1b9c6dfd3a7108b2","sha256:6bde26a1a09e38ee05f07cd248a8b60a9e84345819f729d5003c41227f04e419"],"state_sha256":"0efb15056b1c5cdfe9620e4991f3b9d2a66b82b8c8adbd156663222c0f35b44d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mqszyI6yCOCEvGpZUD6alaDadOtt9YLB0snIjy5yph3HPtTKLpFaY/Me4kNSutnoklbZ9PjUtZlovZW7K/XyCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T12:43:02.421104Z","bundle_sha256":"9c9705ab01e56c2165cb4ffa2803b11bcc176d9111b5c1cc4f4f0e1b8368f014"}}