{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LJXGY3PUFKOQN63MZ3RXNK7SIC","short_pith_number":"pith:LJXGY3PU","schema_version":"1.0","canonical_sha256":"5a6e6c6df42a9d06fb6ccee376abf240beb15af8a7a216569e3dd5c25fae6e2e","source":{"kind":"arxiv","id":"1507.02763","version":1},"attestation_state":"computed","paper":{"title":"Analytic connectivity of $k$-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"An Chang, Joshua Cooper, Wei Li","submitted_at":"2015-07-10T01:35:57Z","abstract_excerpt":"In this paper, we study the analytic connectivity of a $k$-uniform hypergraph $H$, denoted by $\\alpha(H)$. In addition to computing the analytic connectivity of a complete $k$-graph, we present several bounds on analytic connectivity that relate it with other graph invariants, such as degree, vertex connectivity, diameter, and isoperimetric number."},"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":"1507.02763","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-10T01:35:57Z","cross_cats_sorted":[],"title_canon_sha256":"4464dbbdb4503a623ce5412f0d18dbbff3b62833f7f66ca5f1e4fee3992098f6","abstract_canon_sha256":"1237bf7202b2f932acfc7771c0a7cffa130cb23df01af62287a9595cddfd2d0a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:03.254749Z","signature_b64":"VnxmhfHgV6ya1mczgnA2tXT24g+adP53oPeKhJSSS3yuJKt1Gw87OYmSvrl8x7fCDw8tT0Ld74S8UtRhCGkXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a6e6c6df42a9d06fb6ccee376abf240beb15af8a7a216569e3dd5c25fae6e2e","last_reissued_at":"2026-05-18T01:37:03.254282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:03.254282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analytic connectivity of $k$-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"An Chang, Joshua Cooper, Wei Li","submitted_at":"2015-07-10T01:35:57Z","abstract_excerpt":"In this paper, we study the analytic connectivity of a $k$-uniform hypergraph $H$, denoted by $\\alpha(H)$. In addition to computing the analytic connectivity of a complete $k$-graph, we present several bounds on analytic connectivity that relate it with other graph invariants, such as degree, vertex connectivity, diameter, and isoperimetric number."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02763","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":"1507.02763","created_at":"2026-05-18T01:37:03.254360+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.02763v1","created_at":"2026-05-18T01:37:03.254360+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02763","created_at":"2026-05-18T01:37:03.254360+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJXGY3PUFKOQ","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJXGY3PUFKOQN63M","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJXGY3PU","created_at":"2026-05-18T12:29:29.992203+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/LJXGY3PUFKOQN63MZ3RXNK7SIC","json":"https://pith.science/pith/LJXGY3PUFKOQN63MZ3RXNK7SIC.json","graph_json":"https://pith.science/api/pith-number/LJXGY3PUFKOQN63MZ3RXNK7SIC/graph.json","events_json":"https://pith.science/api/pith-number/LJXGY3PUFKOQN63MZ3RXNK7SIC/events.json","paper":"https://pith.science/paper/LJXGY3PU"},"agent_actions":{"view_html":"https://pith.science/pith/LJXGY3PUFKOQN63MZ3RXNK7SIC","download_json":"https://pith.science/pith/LJXGY3PUFKOQN63MZ3RXNK7SIC.json","view_paper":"https://pith.science/paper/LJXGY3PU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.02763&json=true","fetch_graph":"https://pith.science/api/pith-number/LJXGY3PUFKOQN63MZ3RXNK7SIC/graph.json","fetch_events":"https://pith.science/api/pith-number/LJXGY3PUFKOQN63MZ3RXNK7SIC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJXGY3PUFKOQN63MZ3RXNK7SIC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJXGY3PUFKOQN63MZ3RXNK7SIC/action/storage_attestation","attest_author":"https://pith.science/pith/LJXGY3PUFKOQN63MZ3RXNK7SIC/action/author_attestation","sign_citation":"https://pith.science/pith/LJXGY3PUFKOQN63MZ3RXNK7SIC/action/citation_signature","submit_replication":"https://pith.science/pith/LJXGY3PUFKOQN63MZ3RXNK7SIC/action/replication_record"}},"created_at":"2026-05-18T01:37:03.254360+00:00","updated_at":"2026-05-18T01:37:03.254360+00:00"}