{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:J7E4EPJABQYFJ4RD56B6QNUGUE","short_pith_number":"pith:J7E4EPJA","schema_version":"1.0","canonical_sha256":"4fc9c23d200c3054f223ef83e83686a1311ae9cad0842076ff365757b6d4614a","source":{"kind":"arxiv","id":"2309.00322","version":2},"attestation_state":"computed","paper":{"title":"Connectedness and combinatorial interplay in the moduli space of line arrangements","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AG","authors_text":"Beno\\^it Guerville-Ball\\'e, Juan Viu-Sos","submitted_at":"2023-09-01T08:11:48Z","abstract_excerpt":"This paper aims to undertake an exploration of the behavior of the moduli space of line arrangements while establishing its combinatorial interplay with the incidence structure of the arrangement. In the first part, we investigate combinatorial classes of arrangements whose moduli space is connected. We unify the classes of simple and inductively connected arrangements appearing in the literature. Then, we introduce the notion of arrangements with a rigid pencil form. It ensures the connectedness of the moduli space and is less restrictive that the class of $C_3$ arrangements of simple type. I"},"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":"2309.00322","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.AG","submitted_at":"2023-09-01T08:11:48Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"69d6fb77390cfd62562edcc12cc2dc16ec9ae5250510dc1b96dd03fd9c96e745","abstract_canon_sha256":"1289c2a15be65455157683edc6d7025af5a8689b07bcc77c2f31b4443bd381f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:48:31.351143Z","signature_b64":"SDVQkOg13345f7aceNP/kkiistQpPcPQFLlThwovExOEApMk5eTOO0Mdgeio4HFO4HvAqG6ZCqcQd3bh7m+cAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fc9c23d200c3054f223ef83e83686a1311ae9cad0842076ff365757b6d4614a","last_reissued_at":"2026-07-05T07:48:31.350704Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:48:31.350704Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connectedness and combinatorial interplay in the moduli space of line arrangements","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AG","authors_text":"Beno\\^it Guerville-Ball\\'e, Juan Viu-Sos","submitted_at":"2023-09-01T08:11:48Z","abstract_excerpt":"This paper aims to undertake an exploration of the behavior of the moduli space of line arrangements while establishing its combinatorial interplay with the incidence structure of the arrangement. In the first part, we investigate combinatorial classes of arrangements whose moduli space is connected. We unify the classes of simple and inductively connected arrangements appearing in the literature. Then, we introduce the notion of arrangements with a rigid pencil form. It ensures the connectedness of the moduli space and is less restrictive that the class of $C_3$ arrangements of simple type. I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.00322","kind":"arxiv","version":2},"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/2309.00322/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":"2309.00322","created_at":"2026-07-05T07:48:31.350761+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.00322v2","created_at":"2026-07-05T07:48:31.350761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.00322","created_at":"2026-07-05T07:48:31.350761+00:00"},{"alias_kind":"pith_short_12","alias_value":"J7E4EPJABQYF","created_at":"2026-07-05T07:48:31.350761+00:00"},{"alias_kind":"pith_short_16","alias_value":"J7E4EPJABQYFJ4RD","created_at":"2026-07-05T07:48:31.350761+00:00"},{"alias_kind":"pith_short_8","alias_value":"J7E4EPJA","created_at":"2026-07-05T07:48:31.350761+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.00799","citing_title":"Minimal matroids in dependency posets: algorithms and applications to computing irreducible decompositions of circuit varieties","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J7E4EPJABQYFJ4RD56B6QNUGUE","json":"https://pith.science/pith/J7E4EPJABQYFJ4RD56B6QNUGUE.json","graph_json":"https://pith.science/api/pith-number/J7E4EPJABQYFJ4RD56B6QNUGUE/graph.json","events_json":"https://pith.science/api/pith-number/J7E4EPJABQYFJ4RD56B6QNUGUE/events.json","paper":"https://pith.science/paper/J7E4EPJA"},"agent_actions":{"view_html":"https://pith.science/pith/J7E4EPJABQYFJ4RD56B6QNUGUE","download_json":"https://pith.science/pith/J7E4EPJABQYFJ4RD56B6QNUGUE.json","view_paper":"https://pith.science/paper/J7E4EPJA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.00322&json=true","fetch_graph":"https://pith.science/api/pith-number/J7E4EPJABQYFJ4RD56B6QNUGUE/graph.json","fetch_events":"https://pith.science/api/pith-number/J7E4EPJABQYFJ4RD56B6QNUGUE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J7E4EPJABQYFJ4RD56B6QNUGUE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J7E4EPJABQYFJ4RD56B6QNUGUE/action/storage_attestation","attest_author":"https://pith.science/pith/J7E4EPJABQYFJ4RD56B6QNUGUE/action/author_attestation","sign_citation":"https://pith.science/pith/J7E4EPJABQYFJ4RD56B6QNUGUE/action/citation_signature","submit_replication":"https://pith.science/pith/J7E4EPJABQYFJ4RD56B6QNUGUE/action/replication_record"}},"created_at":"2026-07-05T07:48:31.350761+00:00","updated_at":"2026-07-05T07:48:31.350761+00:00"}