{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DL7INJXQFHSSSV3OEREYG26V5A","short_pith_number":"pith:DL7INJXQ","schema_version":"1.0","canonical_sha256":"1afe86a6f029e529576e2449836bd5e83f7be7225c788f134558c320bf51a205","source":{"kind":"arxiv","id":"1905.03148","version":1},"attestation_state":"computed","paper":{"title":"The asymptotic induced matching number of hypergraphs: balanced binary strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","quant-ph"],"primary_cat":"math.CO","authors_text":"Jeroen Zuiddam, P\\'eter Vrana, Srinivasan Arunachalam","submitted_at":"2019-05-08T15:23:22Z","abstract_excerpt":"We compute the asymptotic induced matching number of the $k$-partite $k$-uniform hypergraphs whose edges are the $k$-bit strings of Hamming weight $k/2$, for any large enough even number $k$. Our lower bound relies on the higher-order extension of the well-known Coppersmith-Winograd method from algebraic complexity theory, which was proven by Christandl, Vrana and Zuiddam. Our result is motivated by the study of the power of this method as well as of the power of the Strassen support functionals (which provide upper bounds on the asymptotic induced matching number), and the connections to ques"},"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":"1905.03148","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-08T15:23:22Z","cross_cats_sorted":["cs.CC","quant-ph"],"title_canon_sha256":"5e4ed31843bff7e2b2a2c37102616e66ad1f8baab6ac72a3486a4ec66e1a37c7","abstract_canon_sha256":"6ae0314587bafb8056fd949603f03bb9ee6ab9af97d444e7705576fcaa2457be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:42.724630Z","signature_b64":"Baceek7Jhc7oLIELz1Qe04fbs/hTKCgOaJFuAl/nihdBMsqcZDCaTsAr+QW/ijfnGlCD2t4Mdi/aKOruTtftAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1afe86a6f029e529576e2449836bd5e83f7be7225c788f134558c320bf51a205","last_reissued_at":"2026-05-17T23:46:42.723890Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:42.723890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The asymptotic induced matching number of hypergraphs: balanced binary strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","quant-ph"],"primary_cat":"math.CO","authors_text":"Jeroen Zuiddam, P\\'eter Vrana, Srinivasan Arunachalam","submitted_at":"2019-05-08T15:23:22Z","abstract_excerpt":"We compute the asymptotic induced matching number of the $k$-partite $k$-uniform hypergraphs whose edges are the $k$-bit strings of Hamming weight $k/2$, for any large enough even number $k$. Our lower bound relies on the higher-order extension of the well-known Coppersmith-Winograd method from algebraic complexity theory, which was proven by Christandl, Vrana and Zuiddam. Our result is motivated by the study of the power of this method as well as of the power of the Strassen support functionals (which provide upper bounds on the asymptotic induced matching number), and the connections to ques"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03148","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":"1905.03148","created_at":"2026-05-17T23:46:42.724011+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.03148v1","created_at":"2026-05-17T23:46:42.724011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03148","created_at":"2026-05-17T23:46:42.724011+00:00"},{"alias_kind":"pith_short_12","alias_value":"DL7INJXQFHSS","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"DL7INJXQFHSSSV3O","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"DL7INJXQ","created_at":"2026-05-18T12:33:15.570797+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/DL7INJXQFHSSSV3OEREYG26V5A","json":"https://pith.science/pith/DL7INJXQFHSSSV3OEREYG26V5A.json","graph_json":"https://pith.science/api/pith-number/DL7INJXQFHSSSV3OEREYG26V5A/graph.json","events_json":"https://pith.science/api/pith-number/DL7INJXQFHSSSV3OEREYG26V5A/events.json","paper":"https://pith.science/paper/DL7INJXQ"},"agent_actions":{"view_html":"https://pith.science/pith/DL7INJXQFHSSSV3OEREYG26V5A","download_json":"https://pith.science/pith/DL7INJXQFHSSSV3OEREYG26V5A.json","view_paper":"https://pith.science/paper/DL7INJXQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.03148&json=true","fetch_graph":"https://pith.science/api/pith-number/DL7INJXQFHSSSV3OEREYG26V5A/graph.json","fetch_events":"https://pith.science/api/pith-number/DL7INJXQFHSSSV3OEREYG26V5A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DL7INJXQFHSSSV3OEREYG26V5A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DL7INJXQFHSSSV3OEREYG26V5A/action/storage_attestation","attest_author":"https://pith.science/pith/DL7INJXQFHSSSV3OEREYG26V5A/action/author_attestation","sign_citation":"https://pith.science/pith/DL7INJXQFHSSSV3OEREYG26V5A/action/citation_signature","submit_replication":"https://pith.science/pith/DL7INJXQFHSSSV3OEREYG26V5A/action/replication_record"}},"created_at":"2026-05-17T23:46:42.724011+00:00","updated_at":"2026-05-17T23:46:42.724011+00:00"}