{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WZGA24H2SSME5A2HR47HBUTBSV","short_pith_number":"pith:WZGA24H2","schema_version":"1.0","canonical_sha256":"b64c0d70fa94984e83478f3e70d261955b5326bfc51f258bf84257a78625b92a","source":{"kind":"arxiv","id":"1408.6573","version":1},"attestation_state":"computed","paper":{"title":"Threefold triple systems with nonsingular $N_2$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kseniya Garaschuk, Peter J. Dukes","submitted_at":"2014-08-27T21:32:56Z","abstract_excerpt":"There are various results connecting ranks of incidence matrices of graphs and hypergraphs with their combinatorial structure. Here, we consider the generalized incidence matrix $N_2$ (defined by inclusion of pairs in edges) for one natural class of hypergraphs: the triple systems with index three. Such systems with nonsingular $N_2$ (over the rationals) appear to be quite rare, yet they can be constructed with PBD closure. In fact, a range of ranks near $\\binom{v}{2}$ is obtained for large orders $v$."},"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":"1408.6573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-27T21:32:56Z","cross_cats_sorted":[],"title_canon_sha256":"64c9a77b11bd1c6a0a0ecdc2e95d70c2f26a0f2443a2097b3d6fefdc9420bfc2","abstract_canon_sha256":"8024dce23d7cc09b2339370295d1f8fb1c037961821d3c77674941c956c837c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:01.301094Z","signature_b64":"CJa/PJBG4HuAQAtStSBwnzEVAh/gwdP9uHB14HGjpTznksYu8hNxvrJm9MnOG8CPOV2fJyNgGI2BKt+KKxM8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b64c0d70fa94984e83478f3e70d261955b5326bfc51f258bf84257a78625b92a","last_reissued_at":"2026-05-18T02:44:01.300688Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:01.300688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Threefold triple systems with nonsingular $N_2$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kseniya Garaschuk, Peter J. Dukes","submitted_at":"2014-08-27T21:32:56Z","abstract_excerpt":"There are various results connecting ranks of incidence matrices of graphs and hypergraphs with their combinatorial structure. Here, we consider the generalized incidence matrix $N_2$ (defined by inclusion of pairs in edges) for one natural class of hypergraphs: the triple systems with index three. Such systems with nonsingular $N_2$ (over the rationals) appear to be quite rare, yet they can be constructed with PBD closure. In fact, a range of ranks near $\\binom{v}{2}$ is obtained for large orders $v$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.6573","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":"1408.6573","created_at":"2026-05-18T02:44:01.300742+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.6573v1","created_at":"2026-05-18T02:44:01.300742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.6573","created_at":"2026-05-18T02:44:01.300742+00:00"},{"alias_kind":"pith_short_12","alias_value":"WZGA24H2SSME","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WZGA24H2SSME5A2H","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WZGA24H2","created_at":"2026-05-18T12:28:54.890064+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/WZGA24H2SSME5A2HR47HBUTBSV","json":"https://pith.science/pith/WZGA24H2SSME5A2HR47HBUTBSV.json","graph_json":"https://pith.science/api/pith-number/WZGA24H2SSME5A2HR47HBUTBSV/graph.json","events_json":"https://pith.science/api/pith-number/WZGA24H2SSME5A2HR47HBUTBSV/events.json","paper":"https://pith.science/paper/WZGA24H2"},"agent_actions":{"view_html":"https://pith.science/pith/WZGA24H2SSME5A2HR47HBUTBSV","download_json":"https://pith.science/pith/WZGA24H2SSME5A2HR47HBUTBSV.json","view_paper":"https://pith.science/paper/WZGA24H2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.6573&json=true","fetch_graph":"https://pith.science/api/pith-number/WZGA24H2SSME5A2HR47HBUTBSV/graph.json","fetch_events":"https://pith.science/api/pith-number/WZGA24H2SSME5A2HR47HBUTBSV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WZGA24H2SSME5A2HR47HBUTBSV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WZGA24H2SSME5A2HR47HBUTBSV/action/storage_attestation","attest_author":"https://pith.science/pith/WZGA24H2SSME5A2HR47HBUTBSV/action/author_attestation","sign_citation":"https://pith.science/pith/WZGA24H2SSME5A2HR47HBUTBSV/action/citation_signature","submit_replication":"https://pith.science/pith/WZGA24H2SSME5A2HR47HBUTBSV/action/replication_record"}},"created_at":"2026-05-18T02:44:01.300742+00:00","updated_at":"2026-05-18T02:44:01.300742+00:00"}