{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KYIESK43EZPU4N4OVJ7S45QYMN","short_pith_number":"pith:KYIESK43","canonical_record":{"source":{"id":"2602.00898","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GR","submitted_at":"2026-01-31T20:56:42Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"65b8ec11ce1c1850a45e400c22ef8cbd8e7fc6722f9de7d9ad451b1c957bff59","abstract_canon_sha256":"db60c17fca73d005a7f891dedfd5e9836c17982a6568fc33622b960fa6618aaa"},"schema_version":"1.0"},"canonical_sha256":"5610492b9b265f4e378eaa7f2e7618635efde25acd74af8efbc9c43894702ba9","source":{"kind":"arxiv","id":"2602.00898","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.00898","created_at":"2026-06-05T01:14:34Z"},{"alias_kind":"arxiv_version","alias_value":"2602.00898v2","created_at":"2026-06-05T01:14:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.00898","created_at":"2026-06-05T01:14:34Z"},{"alias_kind":"pith_short_12","alias_value":"KYIESK43EZPU","created_at":"2026-06-05T01:14:34Z"},{"alias_kind":"pith_short_16","alias_value":"KYIESK43EZPU4N4O","created_at":"2026-06-05T01:14:34Z"},{"alias_kind":"pith_short_8","alias_value":"KYIESK43","created_at":"2026-06-05T01:14:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KYIESK43EZPU4N4OVJ7S45QYMN","target":"record","payload":{"canonical_record":{"source":{"id":"2602.00898","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GR","submitted_at":"2026-01-31T20:56:42Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"65b8ec11ce1c1850a45e400c22ef8cbd8e7fc6722f9de7d9ad451b1c957bff59","abstract_canon_sha256":"db60c17fca73d005a7f891dedfd5e9836c17982a6568fc33622b960fa6618aaa"},"schema_version":"1.0"},"canonical_sha256":"5610492b9b265f4e378eaa7f2e7618635efde25acd74af8efbc9c43894702ba9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:14:34.063420Z","signature_b64":"03f2krttLWRQZftWqzCFrnGnYQtfF3+M9Q1NRtxYAhVK+2Iq9tbMOjcKqJhSRBnHVxDAgzcyz/yHW7rwqcKpBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5610492b9b265f4e378eaa7f2e7618635efde25acd74af8efbc9c43894702ba9","last_reissued_at":"2026-06-05T01:14:34.062446Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:14:34.062446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2602.00898","source_version":2,"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-06-05T01:14:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2jHZIhLm5ENV2DTAQqbc35QyycWs7sEUBZTLMgecIDEAC1tV/5wr9kBHDDEQTYkpCaF4Gc9DQp5kZRDvRwq6Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:58:59.641416Z"},"content_sha256":"58c40c0dfc1718dbc3e523c727a6020c571f55fdbb27cce38c9eca48edbc6789","schema_version":"1.0","event_id":"sha256:58c40c0dfc1718dbc3e523c727a6020c571f55fdbb27cce38c9eca48edbc6789"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KYIESK43EZPU4N4OVJ7S45QYMN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Sparse Matrix Permutation for Mesh-Based Direct Solvers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.GR","authors_text":"Ahmed H. Mahmoud, Ana Dodik, Behrooz Zarebavami, Changcheng Yuan, John D. Owens, Justin Solomon, Maryam Mehri Dehnavi, Serban D. Porumbescu","submitted_at":"2026-01-31T20:56:42Z","abstract_excerpt":"We present a fast sparse matrix permutation algorithm tailored to linear systems arising from triangle meshes. Our approach produces nested-dissection-style permutations while significantly reducing permutation runtime overhead. Rather than enforcing strict balance and separator optimality, the algorithm deliberately relaxes these design decisions to favor fast partitioning and efficient elimination-tree construction. Our method decomposes permutation into patch-level local orderings and a compact quotient-graph ordering of separators, preserving the essential structure required by sparse Chol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.00898","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.00898/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-05T01:14:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b7T3LtAdXkGtfuiJIFoS1b2gvtSLyqB+dXtsjkRxs14zeRLKuzWo5MrHn4Neav09C1khkFSJNJaEME+bHxA2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:58:59.641824Z"},"content_sha256":"c04454c07d5aba3d0d5d91aad754999a6af1cc7c7c89f1dea130c0435b260206","schema_version":"1.0","event_id":"sha256:c04454c07d5aba3d0d5d91aad754999a6af1cc7c7c89f1dea130c0435b260206"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KYIESK43EZPU4N4OVJ7S45QYMN/bundle.json","state_url":"https://pith.science/pith/KYIESK43EZPU4N4OVJ7S45QYMN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KYIESK43EZPU4N4OVJ7S45QYMN/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-07-07T15:58:59Z","links":{"resolver":"https://pith.science/pith/KYIESK43EZPU4N4OVJ7S45QYMN","bundle":"https://pith.science/pith/KYIESK43EZPU4N4OVJ7S45QYMN/bundle.json","state":"https://pith.science/pith/KYIESK43EZPU4N4OVJ7S45QYMN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KYIESK43EZPU4N4OVJ7S45QYMN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KYIESK43EZPU4N4OVJ7S45QYMN","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":"db60c17fca73d005a7f891dedfd5e9836c17982a6568fc33622b960fa6618aaa","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GR","submitted_at":"2026-01-31T20:56:42Z","title_canon_sha256":"65b8ec11ce1c1850a45e400c22ef8cbd8e7fc6722f9de7d9ad451b1c957bff59"},"schema_version":"1.0","source":{"id":"2602.00898","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.00898","created_at":"2026-06-05T01:14:34Z"},{"alias_kind":"arxiv_version","alias_value":"2602.00898v2","created_at":"2026-06-05T01:14:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.00898","created_at":"2026-06-05T01:14:34Z"},{"alias_kind":"pith_short_12","alias_value":"KYIESK43EZPU","created_at":"2026-06-05T01:14:34Z"},{"alias_kind":"pith_short_16","alias_value":"KYIESK43EZPU4N4O","created_at":"2026-06-05T01:14:34Z"},{"alias_kind":"pith_short_8","alias_value":"KYIESK43","created_at":"2026-06-05T01:14:34Z"}],"graph_snapshots":[{"event_id":"sha256:c04454c07d5aba3d0d5d91aad754999a6af1cc7c7c89f1dea130c0435b260206","target":"graph","created_at":"2026-06-05T01:14:34Z","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/2602.00898/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a fast sparse matrix permutation algorithm tailored to linear systems arising from triangle meshes. Our approach produces nested-dissection-style permutations while significantly reducing permutation runtime overhead. Rather than enforcing strict balance and separator optimality, the algorithm deliberately relaxes these design decisions to favor fast partitioning and efficient elimination-tree construction. Our method decomposes permutation into patch-level local orderings and a compact quotient-graph ordering of separators, preserving the essential structure required by sparse Chol","authors_text":"Ahmed H. Mahmoud, Ana Dodik, Behrooz Zarebavami, Changcheng Yuan, John D. Owens, Justin Solomon, Maryam Mehri Dehnavi, Serban D. Porumbescu","cross_cats":["cs.DC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GR","submitted_at":"2026-01-31T20:56:42Z","title":"Fast Sparse Matrix Permutation for Mesh-Based Direct Solvers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.00898","kind":"arxiv","version":2},"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:58c40c0dfc1718dbc3e523c727a6020c571f55fdbb27cce38c9eca48edbc6789","target":"record","created_at":"2026-06-05T01:14:34Z","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":"db60c17fca73d005a7f891dedfd5e9836c17982a6568fc33622b960fa6618aaa","cross_cats_sorted":["cs.DC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GR","submitted_at":"2026-01-31T20:56:42Z","title_canon_sha256":"65b8ec11ce1c1850a45e400c22ef8cbd8e7fc6722f9de7d9ad451b1c957bff59"},"schema_version":"1.0","source":{"id":"2602.00898","kind":"arxiv","version":2}},"canonical_sha256":"5610492b9b265f4e378eaa7f2e7618635efde25acd74af8efbc9c43894702ba9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5610492b9b265f4e378eaa7f2e7618635efde25acd74af8efbc9c43894702ba9","first_computed_at":"2026-06-05T01:14:34.062446Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-05T01:14:34.062446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"03f2krttLWRQZftWqzCFrnGnYQtfF3+M9Q1NRtxYAhVK+2Iq9tbMOjcKqJhSRBnHVxDAgzcyz/yHW7rwqcKpBg==","signature_status":"signed_v1","signed_at":"2026-06-05T01:14:34.063420Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.00898","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58c40c0dfc1718dbc3e523c727a6020c571f55fdbb27cce38c9eca48edbc6789","sha256:c04454c07d5aba3d0d5d91aad754999a6af1cc7c7c89f1dea130c0435b260206"],"state_sha256":"6349b7a1c5d9b26c2ef7c4f6eb2fe466841f62b38d70e2d262d51b1f32670ac4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tdW6H15w++xvpAPeClYxy1o0Dfw4XhFJaL66jRvjtFeHvKoocLH/Y7ENmDbR+3VPkoe9uGzJS1MrraHHEIwhCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T15:58:59.643837Z","bundle_sha256":"8067f574477f31aa689457083fe0cf8875dc8023b8afb60d78630666a00297a0"}}