{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VVOUGIWIE6N24JS4A7763EKGMM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7d45d7adabed988bf593a56e2bac38d0a3e64c5c2a8ea3aa26b3d89805e9304d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-06T22:35:12Z","title_canon_sha256":"fcbd1f67a43495922c1791310fc03dc22041c82732b60b28b6d890aa62025430"},"schema_version":"1.0","source":{"id":"1901.01616","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.01616","created_at":"2026-05-17T23:56:51Z"},{"alias_kind":"arxiv_version","alias_value":"1901.01616v1","created_at":"2026-05-17T23:56:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01616","created_at":"2026-05-17T23:56:51Z"},{"alias_kind":"pith_short_12","alias_value":"VVOUGIWIE6N2","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VVOUGIWIE6N24JS4","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VVOUGIWI","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:233a1e124c71e717955979a93867c898fc1dba2a6debadc7f9c1a8b8cc77eae6","target":"graph","created_at":"2026-05-17T23:56:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Aaron Berger, Harish Vemuri, Michael Doppelt, Pat Devlin, Ross Berkowitz, Sonali Durham, Tessa Murthy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-06T22:35:12Z","title":"Connected-Intersecting Families of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01616","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7d69d8dc286c22c9d08d513ee5064495c3e5595d520f29df0ee8737d80c44a3a","target":"record","created_at":"2026-05-17T23:56:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7d45d7adabed988bf593a56e2bac38d0a3e64c5c2a8ea3aa26b3d89805e9304d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-06T22:35:12Z","title_canon_sha256":"fcbd1f67a43495922c1791310fc03dc22041c82732b60b28b6d890aa62025430"},"schema_version":"1.0","source":{"id":"1901.01616","kind":"arxiv","version":1}},"canonical_sha256":"ad5d4322c8279bae265c07ffed91466306257c9f196088acc51c7d79d204fc58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad5d4322c8279bae265c07ffed91466306257c9f196088acc51c7d79d204fc58","first_computed_at":"2026-05-17T23:56:51.615635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:51.615635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2wUI9Wdz9+AHF152c1xb38hyezsWpu25H2ZaRuUOvc4G32kfkmis1KKh8TRyU4LmMAM1OHdLXaHAhgc8iKb8AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:51.616134Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.01616","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d69d8dc286c22c9d08d513ee5064495c3e5595d520f29df0ee8737d80c44a3a","sha256:233a1e124c71e717955979a93867c898fc1dba2a6debadc7f9c1a8b8cc77eae6"],"state_sha256":"6e56083523806180cef779c4cc3d6064fc04609ee6952db7a67982977c7b4bb6"}