{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RWGTGDEGJGP26HQBNNRMUHFFOO","short_pith_number":"pith:RWGTGDEG","schema_version":"1.0","canonical_sha256":"8d8d330c86499faf1e016b62ca1ca573a098a42a16affa7c9792ec32be7c6ffd","source":{"kind":"arxiv","id":"1310.5882","version":1},"attestation_state":"computed","paper":{"title":"Lower bounds on the maximum number of non-crossing acyclic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anna de Mier, Clemens Huemer","submitted_at":"2013-10-22T11:27:10Z","abstract_excerpt":"This paper is a contribution to the problem of counting geometric graphs on point sets. More concretely, we look at the maximum numbers of non-crossing spanning trees and forests. We show that the so-called double chain point configuration of N points has Omega(12.52^N) non-crossing spanning trees and Omega(13.61^N) non-crossing forests. This improves the previous lower bounds on the maximum number of non-crossing spanning trees and of non-crossing forests among all sets of N points in general position given by Dumitrescu, Schulz, Sheffer and T\\'oth. Our analysis relies on the tools of analyti"},"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":"1310.5882","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-22T11:27:10Z","cross_cats_sorted":[],"title_canon_sha256":"6ac66dd7bed46f4d02df914c4d37eef8eaac488eb981c85ef5fa43e5d8b91a97","abstract_canon_sha256":"476b1de5c5d1374964af7f0493983b4149c8990f81fecdcd6cfd627a70878984"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:24.346420Z","signature_b64":"L9omrWcXLcfTpS89/DNa7VjTAJwox12OeNAoj5lzOhtOcK84GeCXfxztnmVnhGaL2d6OVmiI5q3P7QAbh5yxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d8d330c86499faf1e016b62ca1ca573a098a42a16affa7c9792ec32be7c6ffd","last_reissued_at":"2026-05-18T03:09:24.345776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:24.345776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bounds on the maximum number of non-crossing acyclic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anna de Mier, Clemens Huemer","submitted_at":"2013-10-22T11:27:10Z","abstract_excerpt":"This paper is a contribution to the problem of counting geometric graphs on point sets. More concretely, we look at the maximum numbers of non-crossing spanning trees and forests. We show that the so-called double chain point configuration of N points has Omega(12.52^N) non-crossing spanning trees and Omega(13.61^N) non-crossing forests. This improves the previous lower bounds on the maximum number of non-crossing spanning trees and of non-crossing forests among all sets of N points in general position given by Dumitrescu, Schulz, Sheffer and T\\'oth. Our analysis relies on the tools of analyti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5882","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":"1310.5882","created_at":"2026-05-18T03:09:24.345866+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.5882v1","created_at":"2026-05-18T03:09:24.345866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5882","created_at":"2026-05-18T03:09:24.345866+00:00"},{"alias_kind":"pith_short_12","alias_value":"RWGTGDEGJGP2","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"RWGTGDEGJGP26HQB","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"RWGTGDEG","created_at":"2026-05-18T12:27:59.945178+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/RWGTGDEGJGP26HQBNNRMUHFFOO","json":"https://pith.science/pith/RWGTGDEGJGP26HQBNNRMUHFFOO.json","graph_json":"https://pith.science/api/pith-number/RWGTGDEGJGP26HQBNNRMUHFFOO/graph.json","events_json":"https://pith.science/api/pith-number/RWGTGDEGJGP26HQBNNRMUHFFOO/events.json","paper":"https://pith.science/paper/RWGTGDEG"},"agent_actions":{"view_html":"https://pith.science/pith/RWGTGDEGJGP26HQBNNRMUHFFOO","download_json":"https://pith.science/pith/RWGTGDEGJGP26HQBNNRMUHFFOO.json","view_paper":"https://pith.science/paper/RWGTGDEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.5882&json=true","fetch_graph":"https://pith.science/api/pith-number/RWGTGDEGJGP26HQBNNRMUHFFOO/graph.json","fetch_events":"https://pith.science/api/pith-number/RWGTGDEGJGP26HQBNNRMUHFFOO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RWGTGDEGJGP26HQBNNRMUHFFOO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RWGTGDEGJGP26HQBNNRMUHFFOO/action/storage_attestation","attest_author":"https://pith.science/pith/RWGTGDEGJGP26HQBNNRMUHFFOO/action/author_attestation","sign_citation":"https://pith.science/pith/RWGTGDEGJGP26HQBNNRMUHFFOO/action/citation_signature","submit_replication":"https://pith.science/pith/RWGTGDEGJGP26HQBNNRMUHFFOO/action/replication_record"}},"created_at":"2026-05-18T03:09:24.345866+00:00","updated_at":"2026-05-18T03:09:24.345866+00:00"}