{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OOZA4DP5B3DAADDH47A4FIGHSH","short_pith_number":"pith:OOZA4DP5","schema_version":"1.0","canonical_sha256":"73b20e0dfd0ec6000c67e7c1c2a0c791d1e8de9321bb0dc56ab919f89df874ba","source":{"kind":"arxiv","id":"1809.10261","version":3},"attestation_state":"computed","paper":{"title":"A robust algorithm for $k$-point grid generation and symmetry reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mtrl-sci"],"primary_cat":"physics.comp-ph","authors_text":"Gus L. W. Hart, Jeremy J. Jorgensen, Rodney W. Forcade, Wiley S. Morgan","submitted_at":"2018-09-26T22:55:38Z","abstract_excerpt":"We develop an algorithm for i) computing generalized regular $k$-point grids, ii) reducing the grids to their symmetrically distinct points, and iii) mapping the reduced grid points into the Brillouin zone. The algorithm exploits the connection between integer matrices and finite groups to achieve a computational complexity that is linear with the number of $k$-points. The favorable scaling means that, at a given $k$-point density, all possible commensurate grids can be generated (as suggested by Moreno and Soler) and quickly reduced to identify the grid with the fewest symmetrically unique $k"},"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":"1809.10261","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2018-09-26T22:55:38Z","cross_cats_sorted":["cond-mat.mtrl-sci"],"title_canon_sha256":"81fcf715fa7fb6f9504b5802e1f2e562fd7a7172f6137fa95105b956b63c0b72","abstract_canon_sha256":"c1f83c078d5994bad5bc0ddafe4751f622423db4f1187fec642cb06de26308d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:02.997305Z","signature_b64":"G5z/XEsAy8RsNGnCly7dz3s9BYoyOxNWQVL15Zi/jAgPJLA6tez9tli71NAbL+f9YlCcCHDtWEz/45ENN6cACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73b20e0dfd0ec6000c67e7c1c2a0c791d1e8de9321bb0dc56ab919f89df874ba","last_reissued_at":"2026-05-17T23:42:02.996708Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:02.996708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A robust algorithm for $k$-point grid generation and symmetry reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mtrl-sci"],"primary_cat":"physics.comp-ph","authors_text":"Gus L. W. Hart, Jeremy J. Jorgensen, Rodney W. Forcade, Wiley S. Morgan","submitted_at":"2018-09-26T22:55:38Z","abstract_excerpt":"We develop an algorithm for i) computing generalized regular $k$-point grids, ii) reducing the grids to their symmetrically distinct points, and iii) mapping the reduced grid points into the Brillouin zone. The algorithm exploits the connection between integer matrices and finite groups to achieve a computational complexity that is linear with the number of $k$-points. The favorable scaling means that, at a given $k$-point density, all possible commensurate grids can be generated (as suggested by Moreno and Soler) and quickly reduced to identify the grid with the fewest symmetrically unique $k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10261","kind":"arxiv","version":3},"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":"1809.10261","created_at":"2026-05-17T23:42:02.996806+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.10261v3","created_at":"2026-05-17T23:42:02.996806+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10261","created_at":"2026-05-17T23:42:02.996806+00:00"},{"alias_kind":"pith_short_12","alias_value":"OOZA4DP5B3DA","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OOZA4DP5B3DAADDH","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OOZA4DP5","created_at":"2026-05-18T12:32:43.782077+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/OOZA4DP5B3DAADDH47A4FIGHSH","json":"https://pith.science/pith/OOZA4DP5B3DAADDH47A4FIGHSH.json","graph_json":"https://pith.science/api/pith-number/OOZA4DP5B3DAADDH47A4FIGHSH/graph.json","events_json":"https://pith.science/api/pith-number/OOZA4DP5B3DAADDH47A4FIGHSH/events.json","paper":"https://pith.science/paper/OOZA4DP5"},"agent_actions":{"view_html":"https://pith.science/pith/OOZA4DP5B3DAADDH47A4FIGHSH","download_json":"https://pith.science/pith/OOZA4DP5B3DAADDH47A4FIGHSH.json","view_paper":"https://pith.science/paper/OOZA4DP5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.10261&json=true","fetch_graph":"https://pith.science/api/pith-number/OOZA4DP5B3DAADDH47A4FIGHSH/graph.json","fetch_events":"https://pith.science/api/pith-number/OOZA4DP5B3DAADDH47A4FIGHSH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OOZA4DP5B3DAADDH47A4FIGHSH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OOZA4DP5B3DAADDH47A4FIGHSH/action/storage_attestation","attest_author":"https://pith.science/pith/OOZA4DP5B3DAADDH47A4FIGHSH/action/author_attestation","sign_citation":"https://pith.science/pith/OOZA4DP5B3DAADDH47A4FIGHSH/action/citation_signature","submit_replication":"https://pith.science/pith/OOZA4DP5B3DAADDH47A4FIGHSH/action/replication_record"}},"created_at":"2026-05-17T23:42:02.996806+00:00","updated_at":"2026-05-17T23:42:02.996806+00:00"}