{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:YAZFHGQHG2ZPTXP2IW5PEKARGV","short_pith_number":"pith:YAZFHGQH","schema_version":"1.0","canonical_sha256":"c032539a0736b2f9ddfa45baf22811354d205afd0f898f39211c16f2c5779c6c","source":{"kind":"arxiv","id":"1109.3390","version":1},"attestation_state":"computed","paper":{"title":"Not All Saturated 3-Forests Are Tight","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Anna Gundert, Heidi Gebauer, Robin A. Moser, Yoshio Okamoto","submitted_at":"2011-09-15T15:41:59Z","abstract_excerpt":"A basic statement in graph theory is that every inclusion-maximal forest is connected, i.e. a tree. Using a definiton for higher dimensional forests by Graham and Lovasz and the connectivity-related notion of tightness for hypergraphs introduced by Arocha, Bracho and Neumann-Lara in, we provide an example of a saturated, i.e. inclusion-maximal 3-forest that is not tight. This resolves an open problem posed by Strausz."},"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":"1109.3390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-15T15:41:59Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a75f262426a7d556c9eb182cc24d0f9fb2167056af79cc4df208739e7cd311bf","abstract_canon_sha256":"8088c40d0d341863a329c0b55a85cb708848db134e6b99c92c316e0d7f1dc679"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:56.837813Z","signature_b64":"TtnlQpXduGYh5xJaKRbpkVVNxvc3mgcjWGE3Z3hg45lcazrcRWXmDAurRirLrTt7Qrjc/YvjthyJ0xMdFKaiAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c032539a0736b2f9ddfa45baf22811354d205afd0f898f39211c16f2c5779c6c","last_reissued_at":"2026-05-18T04:12:56.837434Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:56.837434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Not All Saturated 3-Forests Are Tight","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Anna Gundert, Heidi Gebauer, Robin A. Moser, Yoshio Okamoto","submitted_at":"2011-09-15T15:41:59Z","abstract_excerpt":"A basic statement in graph theory is that every inclusion-maximal forest is connected, i.e. a tree. Using a definiton for higher dimensional forests by Graham and Lovasz and the connectivity-related notion of tightness for hypergraphs introduced by Arocha, Bracho and Neumann-Lara in, we provide an example of a saturated, i.e. inclusion-maximal 3-forest that is not tight. This resolves an open problem posed by Strausz."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3390","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":"1109.3390","created_at":"2026-05-18T04:12:56.837485+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.3390v1","created_at":"2026-05-18T04:12:56.837485+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3390","created_at":"2026-05-18T04:12:56.837485+00:00"},{"alias_kind":"pith_short_12","alias_value":"YAZFHGQHG2ZP","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"YAZFHGQHG2ZPTXP2","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"YAZFHGQH","created_at":"2026-05-18T12:26:47.523578+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/YAZFHGQHG2ZPTXP2IW5PEKARGV","json":"https://pith.science/pith/YAZFHGQHG2ZPTXP2IW5PEKARGV.json","graph_json":"https://pith.science/api/pith-number/YAZFHGQHG2ZPTXP2IW5PEKARGV/graph.json","events_json":"https://pith.science/api/pith-number/YAZFHGQHG2ZPTXP2IW5PEKARGV/events.json","paper":"https://pith.science/paper/YAZFHGQH"},"agent_actions":{"view_html":"https://pith.science/pith/YAZFHGQHG2ZPTXP2IW5PEKARGV","download_json":"https://pith.science/pith/YAZFHGQHG2ZPTXP2IW5PEKARGV.json","view_paper":"https://pith.science/paper/YAZFHGQH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.3390&json=true","fetch_graph":"https://pith.science/api/pith-number/YAZFHGQHG2ZPTXP2IW5PEKARGV/graph.json","fetch_events":"https://pith.science/api/pith-number/YAZFHGQHG2ZPTXP2IW5PEKARGV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YAZFHGQHG2ZPTXP2IW5PEKARGV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YAZFHGQHG2ZPTXP2IW5PEKARGV/action/storage_attestation","attest_author":"https://pith.science/pith/YAZFHGQHG2ZPTXP2IW5PEKARGV/action/author_attestation","sign_citation":"https://pith.science/pith/YAZFHGQHG2ZPTXP2IW5PEKARGV/action/citation_signature","submit_replication":"https://pith.science/pith/YAZFHGQHG2ZPTXP2IW5PEKARGV/action/replication_record"}},"created_at":"2026-05-18T04:12:56.837485+00:00","updated_at":"2026-05-18T04:12:56.837485+00:00"}