{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:W32ETP57GDDPEBXWLBTS3WDAFE","short_pith_number":"pith:W32ETP57","schema_version":"1.0","canonical_sha256":"b6f449bfbf30c6f206f658672dd8602936691e02d7852f5957ff23f6a2680e95","source":{"kind":"arxiv","id":"1608.06114","version":1},"attestation_state":"computed","paper":{"title":"A hierarchy of maximal intersecting triple systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Rucinski, Joanna Polcyn","submitted_at":"2016-08-22T10:40:07Z","abstract_excerpt":"We reach beyond the celebrated theorems of Erd\\H{o}s-Ko-Rado and Hilton-Milner, and, a recent theorem of Han-Kohayakawa, and determine all maximal intersecting triples systems. It turns out that for each $n\\ge7$ there are exactly 15 pairwise non-isomorphic such systems (and 13 for $n=6$). We present our result in terms of a hierarchy of Tur\\'an numbers $\\ex^{(s)}(n, M_2^{3})$, $s\\ge1$, where $M_2^{3}$ is a pair of disjoint triples. Moreover, owing to our unified approach, we provide short proofs of the above mentioned results (for triple systems only). The triangle $C_3$ is defined as $C_3=\\{\\"},"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":"1608.06114","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-22T10:40:07Z","cross_cats_sorted":[],"title_canon_sha256":"7f796b17a2077ab9cc77a9925fa4c6fcd4958d3d3467b93494cd033fddf20b8b","abstract_canon_sha256":"c9d507282cfa24e977222d1d97f31890ae5a31e90a567ba8d517b7775965a9ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:22.236802Z","signature_b64":"2bgrd36lbT5KcJQsKjHVnwrjtGiowvbyj6SJUOJJfV2aUKGJd7LYsY1cywSC7HP0ZvPW3R97dFpuTXEeKEPuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6f449bfbf30c6f206f658672dd8602936691e02d7852f5957ff23f6a2680e95","last_reissued_at":"2026-05-18T01:08:22.235926Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:22.235926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A hierarchy of maximal intersecting triple systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Rucinski, Joanna Polcyn","submitted_at":"2016-08-22T10:40:07Z","abstract_excerpt":"We reach beyond the celebrated theorems of Erd\\H{o}s-Ko-Rado and Hilton-Milner, and, a recent theorem of Han-Kohayakawa, and determine all maximal intersecting triples systems. It turns out that for each $n\\ge7$ there are exactly 15 pairwise non-isomorphic such systems (and 13 for $n=6$). We present our result in terms of a hierarchy of Tur\\'an numbers $\\ex^{(s)}(n, M_2^{3})$, $s\\ge1$, where $M_2^{3}$ is a pair of disjoint triples. Moreover, owing to our unified approach, we provide short proofs of the above mentioned results (for triple systems only). The triangle $C_3$ is defined as $C_3=\\{\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06114","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":"1608.06114","created_at":"2026-05-18T01:08:22.236071+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.06114v1","created_at":"2026-05-18T01:08:22.236071+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06114","created_at":"2026-05-18T01:08:22.236071+00:00"},{"alias_kind":"pith_short_12","alias_value":"W32ETP57GDDP","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"W32ETP57GDDPEBXW","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"W32ETP57","created_at":"2026-05-18T12:30:48.956258+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/W32ETP57GDDPEBXWLBTS3WDAFE","json":"https://pith.science/pith/W32ETP57GDDPEBXWLBTS3WDAFE.json","graph_json":"https://pith.science/api/pith-number/W32ETP57GDDPEBXWLBTS3WDAFE/graph.json","events_json":"https://pith.science/api/pith-number/W32ETP57GDDPEBXWLBTS3WDAFE/events.json","paper":"https://pith.science/paper/W32ETP57"},"agent_actions":{"view_html":"https://pith.science/pith/W32ETP57GDDPEBXWLBTS3WDAFE","download_json":"https://pith.science/pith/W32ETP57GDDPEBXWLBTS3WDAFE.json","view_paper":"https://pith.science/paper/W32ETP57","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.06114&json=true","fetch_graph":"https://pith.science/api/pith-number/W32ETP57GDDPEBXWLBTS3WDAFE/graph.json","fetch_events":"https://pith.science/api/pith-number/W32ETP57GDDPEBXWLBTS3WDAFE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W32ETP57GDDPEBXWLBTS3WDAFE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W32ETP57GDDPEBXWLBTS3WDAFE/action/storage_attestation","attest_author":"https://pith.science/pith/W32ETP57GDDPEBXWLBTS3WDAFE/action/author_attestation","sign_citation":"https://pith.science/pith/W32ETP57GDDPEBXWLBTS3WDAFE/action/citation_signature","submit_replication":"https://pith.science/pith/W32ETP57GDDPEBXWLBTS3WDAFE/action/replication_record"}},"created_at":"2026-05-18T01:08:22.236071+00:00","updated_at":"2026-05-18T01:08:22.236071+00:00"}