{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7VKLNA6K4ZFVMSUPXYFOBPLNOC","short_pith_number":"pith:7VKLNA6K","schema_version":"1.0","canonical_sha256":"fd54b683cae64b564a8fbe0ae0bd6d70b62612c14095f42e8ab83ca731e596cf","source":{"kind":"arxiv","id":"1611.01372","version":1},"attestation_state":"computed","paper":{"title":"Computing The Analytic Connectivity of A Uniform Hypergraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chufeng Cui, Hong Yan, Liqun Qi, Ziyan Luo","submitted_at":"2016-11-04T13:53:27Z","abstract_excerpt":"The analytic connectivity, proposed as a substitute of the algebraic connectivity in the setting of hypergraphs, is an important quantity in spectral hypergraph theory. The definition of the analytic connectivity for a uniform hypergraph involves a series of optimization problems (POPs) associated with the Laplacian tensor of the hypergraph with nonnegativity constraints and a sphere constraint, which poses difficulties in computation. To reduce the involved computation, properties on the algebraic connectivity are further exploited, and several important structured uniform hypergraphs are sho"},"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":"1611.01372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-04T13:53:27Z","cross_cats_sorted":[],"title_canon_sha256":"cca237360f8456986ce0ddd64ddf15679367bbeab711292ded85507534fbb3e8","abstract_canon_sha256":"7459b8a433a926220b571417ab18ee7fd59c42327422e2dbc53083dfcc81505e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:11.204295Z","signature_b64":"KE87euvPuuoGnYauxkITXAgwt6qIbFoKh3d7r67LGAV1drcz/itH2cb3+4rCr6NlhtMpwUKgrYJZDPodNZnuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd54b683cae64b564a8fbe0ae0bd6d70b62612c14095f42e8ab83ca731e596cf","last_reissued_at":"2026-05-18T01:00:11.203593Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:11.203593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing The Analytic Connectivity of A Uniform Hypergraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chufeng Cui, Hong Yan, Liqun Qi, Ziyan Luo","submitted_at":"2016-11-04T13:53:27Z","abstract_excerpt":"The analytic connectivity, proposed as a substitute of the algebraic connectivity in the setting of hypergraphs, is an important quantity in spectral hypergraph theory. The definition of the analytic connectivity for a uniform hypergraph involves a series of optimization problems (POPs) associated with the Laplacian tensor of the hypergraph with nonnegativity constraints and a sphere constraint, which poses difficulties in computation. To reduce the involved computation, properties on the algebraic connectivity are further exploited, and several important structured uniform hypergraphs are sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01372","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":"1611.01372","created_at":"2026-05-18T01:00:11.203713+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.01372v1","created_at":"2026-05-18T01:00:11.203713+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01372","created_at":"2026-05-18T01:00:11.203713+00:00"},{"alias_kind":"pith_short_12","alias_value":"7VKLNA6K4ZFV","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7VKLNA6K4ZFVMSUP","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7VKLNA6K","created_at":"2026-05-18T12:30:04.600751+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/7VKLNA6K4ZFVMSUPXYFOBPLNOC","json":"https://pith.science/pith/7VKLNA6K4ZFVMSUPXYFOBPLNOC.json","graph_json":"https://pith.science/api/pith-number/7VKLNA6K4ZFVMSUPXYFOBPLNOC/graph.json","events_json":"https://pith.science/api/pith-number/7VKLNA6K4ZFVMSUPXYFOBPLNOC/events.json","paper":"https://pith.science/paper/7VKLNA6K"},"agent_actions":{"view_html":"https://pith.science/pith/7VKLNA6K4ZFVMSUPXYFOBPLNOC","download_json":"https://pith.science/pith/7VKLNA6K4ZFVMSUPXYFOBPLNOC.json","view_paper":"https://pith.science/paper/7VKLNA6K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.01372&json=true","fetch_graph":"https://pith.science/api/pith-number/7VKLNA6K4ZFVMSUPXYFOBPLNOC/graph.json","fetch_events":"https://pith.science/api/pith-number/7VKLNA6K4ZFVMSUPXYFOBPLNOC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7VKLNA6K4ZFVMSUPXYFOBPLNOC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7VKLNA6K4ZFVMSUPXYFOBPLNOC/action/storage_attestation","attest_author":"https://pith.science/pith/7VKLNA6K4ZFVMSUPXYFOBPLNOC/action/author_attestation","sign_citation":"https://pith.science/pith/7VKLNA6K4ZFVMSUPXYFOBPLNOC/action/citation_signature","submit_replication":"https://pith.science/pith/7VKLNA6K4ZFVMSUPXYFOBPLNOC/action/replication_record"}},"created_at":"2026-05-18T01:00:11.203713+00:00","updated_at":"2026-05-18T01:00:11.203713+00:00"}