{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GM4V6TL6NMIZSULGLFGAC33F3T","short_pith_number":"pith:GM4V6TL6","schema_version":"1.0","canonical_sha256":"33395f4d7e6b11995166594c016f65dcc2b0d83b8fcaddb4c355bed36704ce92","source":{"kind":"arxiv","id":"1301.1503","version":1},"attestation_state":"computed","paper":{"title":"Application of semidefinite programming to maximize the spectral gap produced by node removal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cond-mat.dis-nn","authors_text":"Kazuo Murota, Naoki Masuda, Tetsuya Fujie","submitted_at":"2013-01-08T11:52:24Z","abstract_excerpt":"The smallest positive eigenvalue of the Laplacian of a network is called the spectral gap and characterizes various dynamics on networks. We propose mathematical programming methods to maximize the spectral gap of a given network by removing a fixed number of nodes. We formulate relaxed versions of the original problem using semidefinite programming and apply them to example networks."},"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":"1301.1503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2013-01-08T11:52:24Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"bea8fbebe9a096c31acd63429deaaedc9c85588b6b3ab68bc7d6707844a072db","abstract_canon_sha256":"dd085eb221ad9e2a498143bfdebd1c225c1cdb4b2283f3185d56a2babf544e78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:57.301952Z","signature_b64":"6Ov9DVJSLdjVP+4hnmxsaT3R1FK7DC71nc8q25mwEbUs4KEuPuGEAZjoqyPNSW42grazLOQ9DIUM4Fs0DqkSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33395f4d7e6b11995166594c016f65dcc2b0d83b8fcaddb4c355bed36704ce92","last_reissued_at":"2026-05-18T03:36:57.301408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:57.301408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Application of semidefinite programming to maximize the spectral gap produced by node removal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cond-mat.dis-nn","authors_text":"Kazuo Murota, Naoki Masuda, Tetsuya Fujie","submitted_at":"2013-01-08T11:52:24Z","abstract_excerpt":"The smallest positive eigenvalue of the Laplacian of a network is called the spectral gap and characterizes various dynamics on networks. We propose mathematical programming methods to maximize the spectral gap of a given network by removing a fixed number of nodes. We formulate relaxed versions of the original problem using semidefinite programming and apply them to example networks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1503","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":"1301.1503","created_at":"2026-05-18T03:36:57.301484+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.1503v1","created_at":"2026-05-18T03:36:57.301484+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1503","created_at":"2026-05-18T03:36:57.301484+00:00"},{"alias_kind":"pith_short_12","alias_value":"GM4V6TL6NMIZ","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GM4V6TL6NMIZSULG","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GM4V6TL6","created_at":"2026-05-18T12:27:45.050594+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/GM4V6TL6NMIZSULGLFGAC33F3T","json":"https://pith.science/pith/GM4V6TL6NMIZSULGLFGAC33F3T.json","graph_json":"https://pith.science/api/pith-number/GM4V6TL6NMIZSULGLFGAC33F3T/graph.json","events_json":"https://pith.science/api/pith-number/GM4V6TL6NMIZSULGLFGAC33F3T/events.json","paper":"https://pith.science/paper/GM4V6TL6"},"agent_actions":{"view_html":"https://pith.science/pith/GM4V6TL6NMIZSULGLFGAC33F3T","download_json":"https://pith.science/pith/GM4V6TL6NMIZSULGLFGAC33F3T.json","view_paper":"https://pith.science/paper/GM4V6TL6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.1503&json=true","fetch_graph":"https://pith.science/api/pith-number/GM4V6TL6NMIZSULGLFGAC33F3T/graph.json","fetch_events":"https://pith.science/api/pith-number/GM4V6TL6NMIZSULGLFGAC33F3T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GM4V6TL6NMIZSULGLFGAC33F3T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GM4V6TL6NMIZSULGLFGAC33F3T/action/storage_attestation","attest_author":"https://pith.science/pith/GM4V6TL6NMIZSULGLFGAC33F3T/action/author_attestation","sign_citation":"https://pith.science/pith/GM4V6TL6NMIZSULGLFGAC33F3T/action/citation_signature","submit_replication":"https://pith.science/pith/GM4V6TL6NMIZSULGLFGAC33F3T/action/replication_record"}},"created_at":"2026-05-18T03:36:57.301484+00:00","updated_at":"2026-05-18T03:36:57.301484+00:00"}