{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:W3JPDGSYZKCNG2AQRBJBGHUAT2","short_pith_number":"pith:W3JPDGSY","schema_version":"1.0","canonical_sha256":"b6d2f19a58ca84d368108852131e809e82579582d2f66508dac0aee301f45e2c","source":{"kind":"arxiv","id":"2504.19893","version":1},"attestation_state":"computed","paper":{"title":"Separator-based derivations of graphic arrangements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.CO","authors_text":"Leonie M\\\"uhlherr","submitted_at":"2025-04-28T15:27:07Z","abstract_excerpt":"The class of subarrangements of the well-studied braid arrangement, so-called graphic hyperplane arrangements, is important for analysing new concepts and properties in hyperplane arrangement theory. While there is a nice characterization of free graphic arrangements, many interesting questions beyond the free case remain open. This paper introduces an explicit set of generators for the module of logarithmic derivations of a general graphic arrangement based on graph separators. We obtain new insights in the derivation degree sequence in the non-free case and give bounds on the highest degree "},"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":"2504.19893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-28T15:27:07Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"7a2188628c6223f6e3a315a9ae89e79d38d75df648474a650edfa76512796632","abstract_canon_sha256":"d5751d4eee486b3bc5f8d5c7bea95673c2017de51ef2d6965cd5447cadca6095"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:05.718423Z","signature_b64":"lsExaozUDCU1ptvE0fNN6qKIMiCwbdmF/HWm6aoi0Q7M3vzEiVany9NB/idGVTwmfKT7UYOXL5GCr99nZjFzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6d2f19a58ca84d368108852131e809e82579582d2f66508dac0aee301f45e2c","last_reissued_at":"2026-07-05T10:55:05.717932Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:05.717932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Separator-based derivations of graphic arrangements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.CO","authors_text":"Leonie M\\\"uhlherr","submitted_at":"2025-04-28T15:27:07Z","abstract_excerpt":"The class of subarrangements of the well-studied braid arrangement, so-called graphic hyperplane arrangements, is important for analysing new concepts and properties in hyperplane arrangement theory. While there is a nice characterization of free graphic arrangements, many interesting questions beyond the free case remain open. This paper introduces an explicit set of generators for the module of logarithmic derivations of a general graphic arrangement based on graph separators. We obtain new insights in the derivation degree sequence in the non-free case and give bounds on the highest degree "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.19893","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.19893/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":"2504.19893","created_at":"2026-07-05T10:55:05.717983+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.19893v1","created_at":"2026-07-05T10:55:05.717983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.19893","created_at":"2026-07-05T10:55:05.717983+00:00"},{"alias_kind":"pith_short_12","alias_value":"W3JPDGSYZKCN","created_at":"2026-07-05T10:55:05.717983+00:00"},{"alias_kind":"pith_short_16","alias_value":"W3JPDGSYZKCNG2AQ","created_at":"2026-07-05T10:55:05.717983+00:00"},{"alias_kind":"pith_short_8","alias_value":"W3JPDGSY","created_at":"2026-07-05T10:55:05.717983+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.16091","citing_title":"Residue ideals of hyperplane arrangements","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W3JPDGSYZKCNG2AQRBJBGHUAT2","json":"https://pith.science/pith/W3JPDGSYZKCNG2AQRBJBGHUAT2.json","graph_json":"https://pith.science/api/pith-number/W3JPDGSYZKCNG2AQRBJBGHUAT2/graph.json","events_json":"https://pith.science/api/pith-number/W3JPDGSYZKCNG2AQRBJBGHUAT2/events.json","paper":"https://pith.science/paper/W3JPDGSY"},"agent_actions":{"view_html":"https://pith.science/pith/W3JPDGSYZKCNG2AQRBJBGHUAT2","download_json":"https://pith.science/pith/W3JPDGSYZKCNG2AQRBJBGHUAT2.json","view_paper":"https://pith.science/paper/W3JPDGSY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.19893&json=true","fetch_graph":"https://pith.science/api/pith-number/W3JPDGSYZKCNG2AQRBJBGHUAT2/graph.json","fetch_events":"https://pith.science/api/pith-number/W3JPDGSYZKCNG2AQRBJBGHUAT2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W3JPDGSYZKCNG2AQRBJBGHUAT2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W3JPDGSYZKCNG2AQRBJBGHUAT2/action/storage_attestation","attest_author":"https://pith.science/pith/W3JPDGSYZKCNG2AQRBJBGHUAT2/action/author_attestation","sign_citation":"https://pith.science/pith/W3JPDGSYZKCNG2AQRBJBGHUAT2/action/citation_signature","submit_replication":"https://pith.science/pith/W3JPDGSYZKCNG2AQRBJBGHUAT2/action/replication_record"}},"created_at":"2026-07-05T10:55:05.717983+00:00","updated_at":"2026-07-05T10:55:05.717983+00:00"}