{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5QUBZ3HVJV6ISKX7OBTNSPPICA","short_pith_number":"pith:5QUBZ3HV","schema_version":"1.0","canonical_sha256":"ec281cecf54d7c892aff7066d93de81009a2c00792e9b612028441bebd0ea99f","source":{"kind":"arxiv","id":"1505.05949","version":1},"attestation_state":"computed","paper":{"title":"More nonexistence results for symmetric pair coverings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Horsley, Nevena Franceti\\'c, Sarada Herke","submitted_at":"2015-05-22T04:51:59Z","abstract_excerpt":"A $(v,k,\\lambda)$-covering is a pair $(V, \\mathcal{B})$, where $V$ is a $v$-set of points and $\\mathcal{B}$ is a collection of $k$-subsets of $V$ (called blocks), such that every unordered pair of points in $V$ is contained in at least $\\lambda$ blocks in $\\mathcal{B}$. The excess of such a covering is the multigraph on vertex set $V$ in which the edge between vertices $x$ and $y$ has multiplicity $r_{xy}-\\lambda$, where $r_{xy}$ is the number of blocks which contain the pair $\\{x,y\\}$. A covering is symmetric if it has the same number of blocks as points. Bryant et al.(2011) adapted the deter"},"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":"1505.05949","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-22T04:51:59Z","cross_cats_sorted":[],"title_canon_sha256":"608f332d89a80f2398e05005f3e82d5aa6447e2d07de9107d6f8548d90e60740","abstract_canon_sha256":"baae892448900f84e2d2f5bf1e6ee91753c20b2755ebb81084890e80289ae92f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:49.585437Z","signature_b64":"LGo7hqGmoDFfu3plg/2vEZncZ9AeJTMKUHfOyrcDcsq/qnB4SozGK1D/C5lHxSTR3W6CxIoJ8ngGbW6qyGQyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec281cecf54d7c892aff7066d93de81009a2c00792e9b612028441bebd0ea99f","last_reissued_at":"2026-05-18T02:03:49.584971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:49.584971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"More nonexistence results for symmetric pair coverings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Horsley, Nevena Franceti\\'c, Sarada Herke","submitted_at":"2015-05-22T04:51:59Z","abstract_excerpt":"A $(v,k,\\lambda)$-covering is a pair $(V, \\mathcal{B})$, where $V$ is a $v$-set of points and $\\mathcal{B}$ is a collection of $k$-subsets of $V$ (called blocks), such that every unordered pair of points in $V$ is contained in at least $\\lambda$ blocks in $\\mathcal{B}$. The excess of such a covering is the multigraph on vertex set $V$ in which the edge between vertices $x$ and $y$ has multiplicity $r_{xy}-\\lambda$, where $r_{xy}$ is the number of blocks which contain the pair $\\{x,y\\}$. A covering is symmetric if it has the same number of blocks as points. Bryant et al.(2011) adapted the deter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05949","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":"1505.05949","created_at":"2026-05-18T02:03:49.585039+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.05949v1","created_at":"2026-05-18T02:03:49.585039+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05949","created_at":"2026-05-18T02:03:49.585039+00:00"},{"alias_kind":"pith_short_12","alias_value":"5QUBZ3HVJV6I","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5QUBZ3HVJV6ISKX7","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5QUBZ3HV","created_at":"2026-05-18T12:29:05.191682+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/5QUBZ3HVJV6ISKX7OBTNSPPICA","json":"https://pith.science/pith/5QUBZ3HVJV6ISKX7OBTNSPPICA.json","graph_json":"https://pith.science/api/pith-number/5QUBZ3HVJV6ISKX7OBTNSPPICA/graph.json","events_json":"https://pith.science/api/pith-number/5QUBZ3HVJV6ISKX7OBTNSPPICA/events.json","paper":"https://pith.science/paper/5QUBZ3HV"},"agent_actions":{"view_html":"https://pith.science/pith/5QUBZ3HVJV6ISKX7OBTNSPPICA","download_json":"https://pith.science/pith/5QUBZ3HVJV6ISKX7OBTNSPPICA.json","view_paper":"https://pith.science/paper/5QUBZ3HV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.05949&json=true","fetch_graph":"https://pith.science/api/pith-number/5QUBZ3HVJV6ISKX7OBTNSPPICA/graph.json","fetch_events":"https://pith.science/api/pith-number/5QUBZ3HVJV6ISKX7OBTNSPPICA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5QUBZ3HVJV6ISKX7OBTNSPPICA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5QUBZ3HVJV6ISKX7OBTNSPPICA/action/storage_attestation","attest_author":"https://pith.science/pith/5QUBZ3HVJV6ISKX7OBTNSPPICA/action/author_attestation","sign_citation":"https://pith.science/pith/5QUBZ3HVJV6ISKX7OBTNSPPICA/action/citation_signature","submit_replication":"https://pith.science/pith/5QUBZ3HVJV6ISKX7OBTNSPPICA/action/replication_record"}},"created_at":"2026-05-18T02:03:49.585039+00:00","updated_at":"2026-05-18T02:03:49.585039+00:00"}