{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VVOUGIWIE6N24JS4A7763EKGMM","short_pith_number":"pith:VVOUGIWI","schema_version":"1.0","canonical_sha256":"ad5d4322c8279bae265c07ffed91466306257c9f196088acc51c7d79d204fc58","source":{"kind":"arxiv","id":"1901.01616","version":1},"attestation_state":"computed","paper":{"title":"Connected-Intersecting Families of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aaron Berger, Harish Vemuri, Michael Doppelt, Pat Devlin, Ross Berkowitz, Sonali Durham, Tessa Murthy","submitted_at":"2019-01-06T22:35:12Z","abstract_excerpt":"For a graph property $\\mathcal{P}$ and a common vertex set $V = \\{1, 2, \\ldots, n\\}$, a family of graphs on $V$ is \\emph{$\\mathcal{P}$-intersecting} iff $G \\cap H$ satisfies $\\mathcal{P}$ for all $G,H$ in the family. Addressing a question of Chung, Graham, Frankl, and Shearer, we explore---for various $\\mathcal{P}$---the maximum cardinality among all $\\mathcal{P}$-intersecting families of graphs. In the connected-intersecting case, we resolve the question completely by a short linear algebraic proof showing this maximum is attained by taking all graphs containing a fixed spanning tree (though "},"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":"1901.01616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-06T22:35:12Z","cross_cats_sorted":[],"title_canon_sha256":"fcbd1f67a43495922c1791310fc03dc22041c82732b60b28b6d890aa62025430","abstract_canon_sha256":"7d45d7adabed988bf593a56e2bac38d0a3e64c5c2a8ea3aa26b3d89805e9304d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:51.616134Z","signature_b64":"2wUI9Wdz9+AHF152c1xb38hyezsWpu25H2ZaRuUOvc4G32kfkmis1KKh8TRyU4LmMAM1OHdLXaHAhgc8iKb8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad5d4322c8279bae265c07ffed91466306257c9f196088acc51c7d79d204fc58","last_reissued_at":"2026-05-17T23:56:51.615635Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:51.615635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connected-Intersecting Families of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aaron Berger, Harish Vemuri, Michael Doppelt, Pat Devlin, Ross Berkowitz, Sonali Durham, Tessa Murthy","submitted_at":"2019-01-06T22:35:12Z","abstract_excerpt":"For a graph property $\\mathcal{P}$ and a common vertex set $V = \\{1, 2, \\ldots, n\\}$, a family of graphs on $V$ is \\emph{$\\mathcal{P}$-intersecting} iff $G \\cap H$ satisfies $\\mathcal{P}$ for all $G,H$ in the family. Addressing a question of Chung, Graham, Frankl, and Shearer, we explore---for various $\\mathcal{P}$---the maximum cardinality among all $\\mathcal{P}$-intersecting families of graphs. In the connected-intersecting case, we resolve the question completely by a short linear algebraic proof showing this maximum is attained by taking all graphs containing a fixed spanning tree (though "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01616","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":"1901.01616","created_at":"2026-05-17T23:56:51.615711+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.01616v1","created_at":"2026-05-17T23:56:51.615711+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01616","created_at":"2026-05-17T23:56:51.615711+00:00"},{"alias_kind":"pith_short_12","alias_value":"VVOUGIWIE6N2","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"VVOUGIWIE6N24JS4","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"VVOUGIWI","created_at":"2026-05-18T12:33:30.264802+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/VVOUGIWIE6N24JS4A7763EKGMM","json":"https://pith.science/pith/VVOUGIWIE6N24JS4A7763EKGMM.json","graph_json":"https://pith.science/api/pith-number/VVOUGIWIE6N24JS4A7763EKGMM/graph.json","events_json":"https://pith.science/api/pith-number/VVOUGIWIE6N24JS4A7763EKGMM/events.json","paper":"https://pith.science/paper/VVOUGIWI"},"agent_actions":{"view_html":"https://pith.science/pith/VVOUGIWIE6N24JS4A7763EKGMM","download_json":"https://pith.science/pith/VVOUGIWIE6N24JS4A7763EKGMM.json","view_paper":"https://pith.science/paper/VVOUGIWI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.01616&json=true","fetch_graph":"https://pith.science/api/pith-number/VVOUGIWIE6N24JS4A7763EKGMM/graph.json","fetch_events":"https://pith.science/api/pith-number/VVOUGIWIE6N24JS4A7763EKGMM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VVOUGIWIE6N24JS4A7763EKGMM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VVOUGIWIE6N24JS4A7763EKGMM/action/storage_attestation","attest_author":"https://pith.science/pith/VVOUGIWIE6N24JS4A7763EKGMM/action/author_attestation","sign_citation":"https://pith.science/pith/VVOUGIWIE6N24JS4A7763EKGMM/action/citation_signature","submit_replication":"https://pith.science/pith/VVOUGIWIE6N24JS4A7763EKGMM/action/replication_record"}},"created_at":"2026-05-17T23:56:51.615711+00:00","updated_at":"2026-05-17T23:56:51.615711+00:00"}