{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:W3JPDGSYZKCNG2AQRBJBGHUAT2","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":"d5751d4eee486b3bc5f8d5c7bea95673c2017de51ef2d6965cd5447cadca6095","cross_cats_sorted":["math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-28T15:27:07Z","title_canon_sha256":"7a2188628c6223f6e3a315a9ae89e79d38d75df648474a650edfa76512796632"},"schema_version":"1.0","source":{"id":"2504.19893","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.19893","created_at":"2026-07-05T10:55:05Z"},{"alias_kind":"arxiv_version","alias_value":"2504.19893v1","created_at":"2026-07-05T10:55:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.19893","created_at":"2026-07-05T10:55:05Z"},{"alias_kind":"pith_short_12","alias_value":"W3JPDGSYZKCN","created_at":"2026-07-05T10:55:05Z"},{"alias_kind":"pith_short_16","alias_value":"W3JPDGSYZKCNG2AQ","created_at":"2026-07-05T10:55:05Z"},{"alias_kind":"pith_short_8","alias_value":"W3JPDGSY","created_at":"2026-07-05T10:55:05Z"}],"graph_snapshots":[{"event_id":"sha256:cbbc3c8f53cd51276d44eb8410c8ce6b90a45df3a7411bed69949a6b4592f9ef","target":"graph","created_at":"2026-07-05T10:55:05Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.19893/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Leonie M\\\"uhlherr","cross_cats":["math.AC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-28T15:27:07Z","title":"Separator-based derivations of graphic arrangements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.19893","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:01520bf5f79bc6a71a6e5e2bcbf9874e33aac076957bf8b776a7b38c3d06e30e","target":"record","created_at":"2026-07-05T10:55:05Z","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":"d5751d4eee486b3bc5f8d5c7bea95673c2017de51ef2d6965cd5447cadca6095","cross_cats_sorted":["math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-28T15:27:07Z","title_canon_sha256":"7a2188628c6223f6e3a315a9ae89e79d38d75df648474a650edfa76512796632"},"schema_version":"1.0","source":{"id":"2504.19893","kind":"arxiv","version":1}},"canonical_sha256":"b6d2f19a58ca84d368108852131e809e82579582d2f66508dac0aee301f45e2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6d2f19a58ca84d368108852131e809e82579582d2f66508dac0aee301f45e2c","first_computed_at":"2026-07-05T10:55:05.717932Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:55:05.717932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lsExaozUDCU1ptvE0fNN6qKIMiCwbdmF/HWm6aoi0Q7M3vzEiVany9NB/idGVTwmfKT7UYOXL5GCr99nZjFzDg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:55:05.718423Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.19893","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01520bf5f79bc6a71a6e5e2bcbf9874e33aac076957bf8b776a7b38c3d06e30e","sha256:cbbc3c8f53cd51276d44eb8410c8ce6b90a45df3a7411bed69949a6b4592f9ef"],"state_sha256":"efc5479408a673a0b4dcc4aa14d3454baab5cbd214d3b492eb764ce064f38d6c"}