{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:XLECVIVEGEOTAHTLAM3AGVQ4CT","short_pith_number":"pith:XLECVIVE","schema_version":"1.0","canonical_sha256":"bac82aa2a4311d301e6b033603561c14f191ca1e2e5172b799ca6d4c7d31e629","source":{"kind":"arxiv","id":"2104.13089","version":1},"attestation_state":"computed","paper":{"title":"Large non-trivial $t$-intersecting families for signed sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjian Lv, Kaishun Wang, Tian Yao","submitted_at":"2021-04-27T10:19:58Z","abstract_excerpt":"For positive integers $n,r,k$ with $n\\ge r$ and $k\\ge2$, a set $\\{(x_1,y_1),(x_2,y_2),\\dots,(x_r,y_r)\\}$ is called a $k$-signed $r$-set on $[n]$ if $x_1,\\dots,x_r$ are distinct elements of $[n]$ and $y_1\\dots,y_r\\in[k]$. We say a $t$-intersecting family consisting of $k$-signed $r$-sets on $[n]$ is trivial if each member of this family contains a fixed $k$-signed $t$-set. In this paper, we determine the structure of large maximal non-trivial $t$-intersecting families. In particular, we characterize the non-trivial $t$-intersecting families with maximum size for $t\\ge2$, extending a Hilton-Miln"},"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":"2104.13089","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-04-27T10:19:58Z","cross_cats_sorted":[],"title_canon_sha256":"5bcb61cf30d3a5c7440f72fe8e402a99d6c1afcbf2e0044167a0bb57ca089e9a","abstract_canon_sha256":"69fc1c44fce1a2ffbe3bc478fdbd5c0b645f45f9434ac42dc00c5f0b0a0ecf49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:35:45.372482Z","signature_b64":"ItOdbKlGUppqEi3oUMt1qTUCwy0+68y4Zco9wSvp//2xknzcH8oFwh4Y5c0hHEmzAPZyTY8D2FokKghRjn7LAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bac82aa2a4311d301e6b033603561c14f191ca1e2e5172b799ca6d4c7d31e629","last_reissued_at":"2026-07-05T02:35:45.372127Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:35:45.372127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large non-trivial $t$-intersecting families for signed sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjian Lv, Kaishun Wang, Tian Yao","submitted_at":"2021-04-27T10:19:58Z","abstract_excerpt":"For positive integers $n,r,k$ with $n\\ge r$ and $k\\ge2$, a set $\\{(x_1,y_1),(x_2,y_2),\\dots,(x_r,y_r)\\}$ is called a $k$-signed $r$-set on $[n]$ if $x_1,\\dots,x_r$ are distinct elements of $[n]$ and $y_1\\dots,y_r\\in[k]$. We say a $t$-intersecting family consisting of $k$-signed $r$-sets on $[n]$ is trivial if each member of this family contains a fixed $k$-signed $t$-set. In this paper, we determine the structure of large maximal non-trivial $t$-intersecting families. In particular, we characterize the non-trivial $t$-intersecting families with maximum size for $t\\ge2$, extending a Hilton-Miln"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.13089","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2104.13089/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2104.13089","created_at":"2026-07-05T02:35:45.372183+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.13089v1","created_at":"2026-07-05T02:35:45.372183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.13089","created_at":"2026-07-05T02:35:45.372183+00:00"},{"alias_kind":"pith_short_12","alias_value":"XLECVIVEGEOT","created_at":"2026-07-05T02:35:45.372183+00:00"},{"alias_kind":"pith_short_16","alias_value":"XLECVIVEGEOTAHTL","created_at":"2026-07-05T02:35:45.372183+00:00"},{"alias_kind":"pith_short_8","alias_value":"XLECVIVE","created_at":"2026-07-05T02:35:45.372183+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/XLECVIVEGEOTAHTLAM3AGVQ4CT","json":"https://pith.science/pith/XLECVIVEGEOTAHTLAM3AGVQ4CT.json","graph_json":"https://pith.science/api/pith-number/XLECVIVEGEOTAHTLAM3AGVQ4CT/graph.json","events_json":"https://pith.science/api/pith-number/XLECVIVEGEOTAHTLAM3AGVQ4CT/events.json","paper":"https://pith.science/paper/XLECVIVE"},"agent_actions":{"view_html":"https://pith.science/pith/XLECVIVEGEOTAHTLAM3AGVQ4CT","download_json":"https://pith.science/pith/XLECVIVEGEOTAHTLAM3AGVQ4CT.json","view_paper":"https://pith.science/paper/XLECVIVE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.13089&json=true","fetch_graph":"https://pith.science/api/pith-number/XLECVIVEGEOTAHTLAM3AGVQ4CT/graph.json","fetch_events":"https://pith.science/api/pith-number/XLECVIVEGEOTAHTLAM3AGVQ4CT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XLECVIVEGEOTAHTLAM3AGVQ4CT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XLECVIVEGEOTAHTLAM3AGVQ4CT/action/storage_attestation","attest_author":"https://pith.science/pith/XLECVIVEGEOTAHTLAM3AGVQ4CT/action/author_attestation","sign_citation":"https://pith.science/pith/XLECVIVEGEOTAHTLAM3AGVQ4CT/action/citation_signature","submit_replication":"https://pith.science/pith/XLECVIVEGEOTAHTLAM3AGVQ4CT/action/replication_record"}},"created_at":"2026-07-05T02:35:45.372183+00:00","updated_at":"2026-07-05T02:35:45.372183+00:00"}