{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3A2PHZ4E4RTI4QTWXQST2LQZKL","short_pith_number":"pith:3A2PHZ4E","schema_version":"1.0","canonical_sha256":"d834f3e784e4668e4276bc253d2e1952f09ad981c2e6d71b18763b0bf8d416d0","source":{"kind":"arxiv","id":"1110.0162","version":1},"attestation_state":"computed","paper":{"title":"On computation of the characteristic polynomials of the discriminantal arrangements and the arrangements generated by generic points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Akimichi Takemura, Yasuhide Numata","submitted_at":"2011-10-02T09:15:25Z","abstract_excerpt":"In this article we give a computational study of combinatorics of the discriminantal arrangements. The discriminantal arrangements are parametrized by two positive integers n and k such that n>k. The intersection lattice of the discriminantal arrangement with the parameter (n,k) is isomorphic to the intersection lattice of the hyperplane arrangement generated by n generic points in the d-dimensional vector space where d=n-k-1. The combinatorics of the discriminantal arrangements is very hard, except for the special cases of the Boolean arrangements (k=0) and the braid arrangements (k=1). We re"},"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":"1110.0162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-02T09:15:25Z","cross_cats_sorted":[],"title_canon_sha256":"ef65612c40c982ae1f9b3c69d8871d04b52ebf8cd57388df680fe2a58f667d14","abstract_canon_sha256":"f4a244f1822ec61a2b7326f3ec267e187fcdef536647c42c4f6217016c0b4f5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:46.661990Z","signature_b64":"FuD23LnWeYEJLDvut07rB0fy25HwL1SslodLYy5owb4Mwtun797vKFiRP8GbJIT2TVFJng46M9osMpeaa/t7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d834f3e784e4668e4276bc253d2e1952f09ad981c2e6d71b18763b0bf8d416d0","last_reissued_at":"2026-05-18T03:36:46.661333Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:46.661333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On computation of the characteristic polynomials of the discriminantal arrangements and the arrangements generated by generic points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Akimichi Takemura, Yasuhide Numata","submitted_at":"2011-10-02T09:15:25Z","abstract_excerpt":"In this article we give a computational study of combinatorics of the discriminantal arrangements. The discriminantal arrangements are parametrized by two positive integers n and k such that n>k. The intersection lattice of the discriminantal arrangement with the parameter (n,k) is isomorphic to the intersection lattice of the hyperplane arrangement generated by n generic points in the d-dimensional vector space where d=n-k-1. The combinatorics of the discriminantal arrangements is very hard, except for the special cases of the Boolean arrangements (k=0) and the braid arrangements (k=1). We re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0162","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":"1110.0162","created_at":"2026-05-18T03:36:46.661439+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.0162v1","created_at":"2026-05-18T03:36:46.661439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0162","created_at":"2026-05-18T03:36:46.661439+00:00"},{"alias_kind":"pith_short_12","alias_value":"3A2PHZ4E4RTI","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"3A2PHZ4E4RTI4QTW","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"3A2PHZ4E","created_at":"2026-05-18T12:26:18.847500+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/3A2PHZ4E4RTI4QTWXQST2LQZKL","json":"https://pith.science/pith/3A2PHZ4E4RTI4QTWXQST2LQZKL.json","graph_json":"https://pith.science/api/pith-number/3A2PHZ4E4RTI4QTWXQST2LQZKL/graph.json","events_json":"https://pith.science/api/pith-number/3A2PHZ4E4RTI4QTWXQST2LQZKL/events.json","paper":"https://pith.science/paper/3A2PHZ4E"},"agent_actions":{"view_html":"https://pith.science/pith/3A2PHZ4E4RTI4QTWXQST2LQZKL","download_json":"https://pith.science/pith/3A2PHZ4E4RTI4QTWXQST2LQZKL.json","view_paper":"https://pith.science/paper/3A2PHZ4E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.0162&json=true","fetch_graph":"https://pith.science/api/pith-number/3A2PHZ4E4RTI4QTWXQST2LQZKL/graph.json","fetch_events":"https://pith.science/api/pith-number/3A2PHZ4E4RTI4QTWXQST2LQZKL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3A2PHZ4E4RTI4QTWXQST2LQZKL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3A2PHZ4E4RTI4QTWXQST2LQZKL/action/storage_attestation","attest_author":"https://pith.science/pith/3A2PHZ4E4RTI4QTWXQST2LQZKL/action/author_attestation","sign_citation":"https://pith.science/pith/3A2PHZ4E4RTI4QTWXQST2LQZKL/action/citation_signature","submit_replication":"https://pith.science/pith/3A2PHZ4E4RTI4QTWXQST2LQZKL/action/replication_record"}},"created_at":"2026-05-18T03:36:46.661439+00:00","updated_at":"2026-05-18T03:36:46.661439+00:00"}