{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7HD54VTOYFG4MJGDCRA4UZOX4L","short_pith_number":"pith:7HD54VTO","schema_version":"1.0","canonical_sha256":"f9c7de566ec14dc624c31441ca65d7e2cf14c247bd42d49ce8740d6209e25728","source":{"kind":"arxiv","id":"1710.04633","version":1},"attestation_state":"computed","paper":{"title":"A generalization of Erd\\H{o}s' matching conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christos Pelekis, Israel Rocha","submitted_at":"2017-10-12T17:36:47Z","abstract_excerpt":"Let $\\mathcal{H}=(V,\\mathcal{E})$ be an $r$-uniform hypergraph on $n$ vertices and fix a positive integer $k$ such that $1\\le k\\le r$. A $k$-\\emph{matching} of $\\mathcal{H}$ is a collection of edges $\\mathcal{M}\\subset \\mathcal{E}$ such that every subset of $V$ whose cardinality equals $k$ is contained in at most one element of $\\mathcal{M}$. The $k$-matching number of $\\mathcal{H}$ is the maximum cardinality of a $k$-matching. A well-known problem, posed by Erd\\H{o}s, asks for the maximum number of edges in an $r$-uniform hypergraph under constraints on its $1$-matching number. In this articl"},"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":"1710.04633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-12T17:36:47Z","cross_cats_sorted":[],"title_canon_sha256":"f66c70b1a14ce42f7ff281368c4a69aaa2713ae3f9329dfad9546defad2d20d3","abstract_canon_sha256":"7cc108ebff7c24cb0904c158ceba46ddac53702814921c659a7d3372a45d7c73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:00.501235Z","signature_b64":"MMVsPB1xYm3YQs2qy/ANSJaKo1HtPdXaIb03L73g6B/zk4uH3uYwwAz9uJ0MOD0f/nV9Cgn5GX+OTsdJ+hkpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9c7de566ec14dc624c31441ca65d7e2cf14c247bd42d49ce8740d6209e25728","last_reissued_at":"2026-05-18T00:33:00.500596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:00.500596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A generalization of Erd\\H{o}s' matching conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christos Pelekis, Israel Rocha","submitted_at":"2017-10-12T17:36:47Z","abstract_excerpt":"Let $\\mathcal{H}=(V,\\mathcal{E})$ be an $r$-uniform hypergraph on $n$ vertices and fix a positive integer $k$ such that $1\\le k\\le r$. A $k$-\\emph{matching} of $\\mathcal{H}$ is a collection of edges $\\mathcal{M}\\subset \\mathcal{E}$ such that every subset of $V$ whose cardinality equals $k$ is contained in at most one element of $\\mathcal{M}$. The $k$-matching number of $\\mathcal{H}$ is the maximum cardinality of a $k$-matching. A well-known problem, posed by Erd\\H{o}s, asks for the maximum number of edges in an $r$-uniform hypergraph under constraints on its $1$-matching number. In this articl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04633","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":"1710.04633","created_at":"2026-05-18T00:33:00.500689+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.04633v1","created_at":"2026-05-18T00:33:00.500689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04633","created_at":"2026-05-18T00:33:00.500689+00:00"},{"alias_kind":"pith_short_12","alias_value":"7HD54VTOYFG4","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7HD54VTOYFG4MJGD","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7HD54VTO","created_at":"2026-05-18T12:31:05.417338+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/7HD54VTOYFG4MJGDCRA4UZOX4L","json":"https://pith.science/pith/7HD54VTOYFG4MJGDCRA4UZOX4L.json","graph_json":"https://pith.science/api/pith-number/7HD54VTOYFG4MJGDCRA4UZOX4L/graph.json","events_json":"https://pith.science/api/pith-number/7HD54VTOYFG4MJGDCRA4UZOX4L/events.json","paper":"https://pith.science/paper/7HD54VTO"},"agent_actions":{"view_html":"https://pith.science/pith/7HD54VTOYFG4MJGDCRA4UZOX4L","download_json":"https://pith.science/pith/7HD54VTOYFG4MJGDCRA4UZOX4L.json","view_paper":"https://pith.science/paper/7HD54VTO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.04633&json=true","fetch_graph":"https://pith.science/api/pith-number/7HD54VTOYFG4MJGDCRA4UZOX4L/graph.json","fetch_events":"https://pith.science/api/pith-number/7HD54VTOYFG4MJGDCRA4UZOX4L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7HD54VTOYFG4MJGDCRA4UZOX4L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7HD54VTOYFG4MJGDCRA4UZOX4L/action/storage_attestation","attest_author":"https://pith.science/pith/7HD54VTOYFG4MJGDCRA4UZOX4L/action/author_attestation","sign_citation":"https://pith.science/pith/7HD54VTOYFG4MJGDCRA4UZOX4L/action/citation_signature","submit_replication":"https://pith.science/pith/7HD54VTOYFG4MJGDCRA4UZOX4L/action/replication_record"}},"created_at":"2026-05-18T00:33:00.500689+00:00","updated_at":"2026-05-18T00:33:00.500689+00:00"}