{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IDLDGDPGEYL6KVY2XH6XU4Q33Q","short_pith_number":"pith:IDLDGDPG","canonical_record":{"source":{"id":"1907.07712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2019-07-17T18:33:24Z","cross_cats_sorted":[],"title_canon_sha256":"3b5a9d907b4d9f657640bcf50d1fa2ed7d042da34178c4e98528378337d95425","abstract_canon_sha256":"3b6457f93ffec9b70af3b5bfeb4c30cbc84e47dc429bbe8c147cba6cddabc567"},"schema_version":"1.0"},"canonical_sha256":"40d6330de62617e5571ab9fd7a721bdc12583630d2cb7ed2796467db2021f1ab","source":{"kind":"arxiv","id":"1907.07712","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07712","created_at":"2026-05-17T23:40:16Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07712v1","created_at":"2026-05-17T23:40:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07712","created_at":"2026-05-17T23:40:16Z"},{"alias_kind":"pith_short_12","alias_value":"IDLDGDPGEYL6","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IDLDGDPGEYL6KVY2","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IDLDGDPG","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IDLDGDPGEYL6KVY2XH6XU4Q33Q","target":"record","payload":{"canonical_record":{"source":{"id":"1907.07712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2019-07-17T18:33:24Z","cross_cats_sorted":[],"title_canon_sha256":"3b5a9d907b4d9f657640bcf50d1fa2ed7d042da34178c4e98528378337d95425","abstract_canon_sha256":"3b6457f93ffec9b70af3b5bfeb4c30cbc84e47dc429bbe8c147cba6cddabc567"},"schema_version":"1.0"},"canonical_sha256":"40d6330de62617e5571ab9fd7a721bdc12583630d2cb7ed2796467db2021f1ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:16.685329Z","signature_b64":"xDxu5z5KNsqXiOO824di6UMeHQwIf5u5UafiFXCKyhcGpczUVpgid7rBZt//GFUrz/t5Si90YkOSvVSmb5eFAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40d6330de62617e5571ab9fd7a721bdc12583630d2cb7ed2796467db2021f1ab","last_reissued_at":"2026-05-17T23:40:16.684665Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:16.684665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.07712","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5LmGCo/nVmROhkbBQoUYSve+BMxGHHXvkVDohMUm5KqsshsFOwXGTolSvrV/pzOAUWDOhc6mD6qEidP0pcsaAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T17:32:07.944063Z"},"content_sha256":"1382a734c6216989ae487239e84c154f77105fc35f3beb9c958e6a47a8d0f3a1","schema_version":"1.0","event_id":"sha256:1382a734c6216989ae487239e84c154f77105fc35f3beb9c958e6a47a8d0f3a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IDLDGDPGEYL6KVY2XH6XU4Q33Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Real and complex supersolvable line arrangements in the projective plane","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AG","authors_text":"Brian Harbourne, Krishna Hanumanthu","submitted_at":"2019-07-17T18:33:24Z","abstract_excerpt":"We study supersolvable line arrangements in ${\\mathbb P}^2$ over the reals and over the complex numbers, as the first step toward a combinatorial classification. Our main results show that a nontrivial (i.e., not a pencil or near pencil) complex line arrangement cannot have more than 4 modular points, and if all of the crossing points of a complex line arrangement have multiplicity 3 or 4, then the arrangement must have 0 modular points (i.e., it cannot be supersolvable). This provides at least a little evidence for our conjecture that every nontrivial complex supersolvable line arrangement ha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07712","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C9PmlV/SpcsF/7EuF9Spgj5EzLXN2W6DvsLGYSxZYNVXX6Rd19CTb4mMvrQTzXOWTqkTKlMEThLykX5LunZ1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T17:32:07.944445Z"},"content_sha256":"ba9679afe4c0e9a652103d1d38bcdc27fed4f3ad8f4684fa7fd8dde8e5c1320b","schema_version":"1.0","event_id":"sha256:ba9679afe4c0e9a652103d1d38bcdc27fed4f3ad8f4684fa7fd8dde8e5c1320b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IDLDGDPGEYL6KVY2XH6XU4Q33Q/bundle.json","state_url":"https://pith.science/pith/IDLDGDPGEYL6KVY2XH6XU4Q33Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IDLDGDPGEYL6KVY2XH6XU4Q33Q/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T17:32:07Z","links":{"resolver":"https://pith.science/pith/IDLDGDPGEYL6KVY2XH6XU4Q33Q","bundle":"https://pith.science/pith/IDLDGDPGEYL6KVY2XH6XU4Q33Q/bundle.json","state":"https://pith.science/pith/IDLDGDPGEYL6KVY2XH6XU4Q33Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IDLDGDPGEYL6KVY2XH6XU4Q33Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IDLDGDPGEYL6KVY2XH6XU4Q33Q","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":"3b6457f93ffec9b70af3b5bfeb4c30cbc84e47dc429bbe8c147cba6cddabc567","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2019-07-17T18:33:24Z","title_canon_sha256":"3b5a9d907b4d9f657640bcf50d1fa2ed7d042da34178c4e98528378337d95425"},"schema_version":"1.0","source":{"id":"1907.07712","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.07712","created_at":"2026-05-17T23:40:16Z"},{"alias_kind":"arxiv_version","alias_value":"1907.07712v1","created_at":"2026-05-17T23:40:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07712","created_at":"2026-05-17T23:40:16Z"},{"alias_kind":"pith_short_12","alias_value":"IDLDGDPGEYL6","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IDLDGDPGEYL6KVY2","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IDLDGDPG","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:ba9679afe4c0e9a652103d1d38bcdc27fed4f3ad8f4684fa7fd8dde8e5c1320b","target":"graph","created_at":"2026-05-17T23:40:16Z","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"},"paper":{"abstract_excerpt":"We study supersolvable line arrangements in ${\\mathbb P}^2$ over the reals and over the complex numbers, as the first step toward a combinatorial classification. Our main results show that a nontrivial (i.e., not a pencil or near pencil) complex line arrangement cannot have more than 4 modular points, and if all of the crossing points of a complex line arrangement have multiplicity 3 or 4, then the arrangement must have 0 modular points (i.e., it cannot be supersolvable). This provides at least a little evidence for our conjecture that every nontrivial complex supersolvable line arrangement ha","authors_text":"Brian Harbourne, Krishna Hanumanthu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2019-07-17T18:33:24Z","title":"Real and complex supersolvable line arrangements in the projective plane"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07712","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:1382a734c6216989ae487239e84c154f77105fc35f3beb9c958e6a47a8d0f3a1","target":"record","created_at":"2026-05-17T23:40:16Z","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":"3b6457f93ffec9b70af3b5bfeb4c30cbc84e47dc429bbe8c147cba6cddabc567","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2019-07-17T18:33:24Z","title_canon_sha256":"3b5a9d907b4d9f657640bcf50d1fa2ed7d042da34178c4e98528378337d95425"},"schema_version":"1.0","source":{"id":"1907.07712","kind":"arxiv","version":1}},"canonical_sha256":"40d6330de62617e5571ab9fd7a721bdc12583630d2cb7ed2796467db2021f1ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40d6330de62617e5571ab9fd7a721bdc12583630d2cb7ed2796467db2021f1ab","first_computed_at":"2026-05-17T23:40:16.684665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:16.684665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xDxu5z5KNsqXiOO824di6UMeHQwIf5u5UafiFXCKyhcGpczUVpgid7rBZt//GFUrz/t5Si90YkOSvVSmb5eFAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:16.685329Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.07712","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1382a734c6216989ae487239e84c154f77105fc35f3beb9c958e6a47a8d0f3a1","sha256:ba9679afe4c0e9a652103d1d38bcdc27fed4f3ad8f4684fa7fd8dde8e5c1320b"],"state_sha256":"e532535933aacdd55bc4a8f9833231177c6af728bc3e5acf36e4285b5b83ae58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NcfNP2pO1bprFHmezzv5p2UKKTEkWzTRXacqSzk5RTquo1D3pUut6VBp9Db3yG5Nmfvhbsc5uX6OfdGuTkf7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T17:32:07.946553Z","bundle_sha256":"69480f96e2b696112727c4ed1e2fe6e334a4008a4ffb17a7df43806bbdfc279a"}}