{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OOZA4DP5B3DAADDH47A4FIGHSH","short_pith_number":"pith:OOZA4DP5","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"},"canonical_sha256":"73b20e0dfd0ec6000c67e7c1c2a0c791d1e8de9321bb0dc56ab919f89df874ba","source":{"kind":"arxiv","id":"1809.10261","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10261","created_at":"2026-05-17T23:42:02Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10261v3","created_at":"2026-05-17T23:42:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10261","created_at":"2026-05-17T23:42:02Z"},{"alias_kind":"pith_short_12","alias_value":"OOZA4DP5B3DA","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OOZA4DP5B3DAADDH","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OOZA4DP5","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OOZA4DP5B3DAADDH47A4FIGHSH","target":"record","payload":{"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"},"canonical_sha256":"73b20e0dfd0ec6000c67e7c1c2a0c791d1e8de9321bb0dc56ab919f89df874ba","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"},"source_kind":"arxiv","source_id":"1809.10261","source_version":3,"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:42:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wV+u/9A/AhNUus3YeoBwYfeVANNB8L5fgolxGwbKTIkBkCaKjwpdPxIO4GkdkjKxFkBsbLl742YhSryRF9bhCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:06:01.837032Z"},"content_sha256":"9e2367f89fe1409d96a2ed2e227f95793517af8bd612cd200535df1a0d0ee318","schema_version":"1.0","event_id":"sha256:9e2367f89fe1409d96a2ed2e227f95793517af8bd612cd200535df1a0d0ee318"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OOZA4DP5B3DAADDH47A4FIGHSH","target":"graph","payload":{"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"},"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:42:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7oucTxCtZzMx87Ged0xZaW4fuA2Wm7WD+mH/T7bhsrkhErv5faBpgo1bcG/o9ZiCclVGA89WVW/qa56FkuMLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:06:01.837718Z"},"content_sha256":"39978e84ff12f39b38c34c9405de6890fb85ab681202847e11bdc2c7ae92aedc","schema_version":"1.0","event_id":"sha256:39978e84ff12f39b38c34c9405de6890fb85ab681202847e11bdc2c7ae92aedc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OOZA4DP5B3DAADDH47A4FIGHSH/bundle.json","state_url":"https://pith.science/pith/OOZA4DP5B3DAADDH47A4FIGHSH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OOZA4DP5B3DAADDH47A4FIGHSH/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-05-26T16:06:01Z","links":{"resolver":"https://pith.science/pith/OOZA4DP5B3DAADDH47A4FIGHSH","bundle":"https://pith.science/pith/OOZA4DP5B3DAADDH47A4FIGHSH/bundle.json","state":"https://pith.science/pith/OOZA4DP5B3DAADDH47A4FIGHSH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OOZA4DP5B3DAADDH47A4FIGHSH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OOZA4DP5B3DAADDH47A4FIGHSH","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":"c1f83c078d5994bad5bc0ddafe4751f622423db4f1187fec642cb06de26308d3","cross_cats_sorted":["cond-mat.mtrl-sci"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2018-09-26T22:55:38Z","title_canon_sha256":"81fcf715fa7fb6f9504b5802e1f2e562fd7a7172f6137fa95105b956b63c0b72"},"schema_version":"1.0","source":{"id":"1809.10261","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.10261","created_at":"2026-05-17T23:42:02Z"},{"alias_kind":"arxiv_version","alias_value":"1809.10261v3","created_at":"2026-05-17T23:42:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10261","created_at":"2026-05-17T23:42:02Z"},{"alias_kind":"pith_short_12","alias_value":"OOZA4DP5B3DA","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OOZA4DP5B3DAADDH","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OOZA4DP5","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:39978e84ff12f39b38c34c9405de6890fb85ab681202847e11bdc2c7ae92aedc","target":"graph","created_at":"2026-05-17T23:42:02Z","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 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","authors_text":"Gus L. W. Hart, Jeremy J. Jorgensen, Rodney W. Forcade, Wiley S. Morgan","cross_cats":["cond-mat.mtrl-sci"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2018-09-26T22:55:38Z","title":"A robust algorithm for $k$-point grid generation and symmetry reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10261","kind":"arxiv","version":3},"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:9e2367f89fe1409d96a2ed2e227f95793517af8bd612cd200535df1a0d0ee318","target":"record","created_at":"2026-05-17T23:42:02Z","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":"c1f83c078d5994bad5bc0ddafe4751f622423db4f1187fec642cb06de26308d3","cross_cats_sorted":["cond-mat.mtrl-sci"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2018-09-26T22:55:38Z","title_canon_sha256":"81fcf715fa7fb6f9504b5802e1f2e562fd7a7172f6137fa95105b956b63c0b72"},"schema_version":"1.0","source":{"id":"1809.10261","kind":"arxiv","version":3}},"canonical_sha256":"73b20e0dfd0ec6000c67e7c1c2a0c791d1e8de9321bb0dc56ab919f89df874ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73b20e0dfd0ec6000c67e7c1c2a0c791d1e8de9321bb0dc56ab919f89df874ba","first_computed_at":"2026-05-17T23:42:02.996708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:02.996708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G5z/XEsAy8RsNGnCly7dz3s9BYoyOxNWQVL15Zi/jAgPJLA6tez9tli71NAbL+f9YlCcCHDtWEz/45ENN6cACw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:02.997305Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.10261","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e2367f89fe1409d96a2ed2e227f95793517af8bd612cd200535df1a0d0ee318","sha256:39978e84ff12f39b38c34c9405de6890fb85ab681202847e11bdc2c7ae92aedc"],"state_sha256":"215b00b2ef01c7c890334076b09a5ec7e340d24efd5263cdba973e2689c74272"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GhQY+VhK/Z2TVbfia7RNYIzThaLazYsbz8maqTrWsblaN5Q6kYORNsumEzKif/rUP4kUxEc1n33LwtKMdQ9jAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:06:01.841486Z","bundle_sha256":"e3ccb60bd0d1f5a96c1f87fe28a1217412ccced1bc0bec5a16e3dd19626a65c0"}}