{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:JDOHOJZR2M5Y63AROGQX5WR5JM","short_pith_number":"pith:JDOHOJZR","schema_version":"1.0","canonical_sha256":"48dc772731d33b8f6c1171a17eda3d4b1487ad5166995311ad652c3a5cf91a1c","source":{"kind":"arxiv","id":"cs/0310051","version":10},"attestation_state":"computed","paper":{"title":"Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"Daniel A. Spielman, Shang-Hua Teng","submitted_at":"2003-10-28T09:23:25Z","abstract_excerpt":"This paper has been divided into three papers. arXiv:0809.3232, arXiv:0808.4134, arXiv:cs/0607105"},"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":"cs/0310051","kind":"arxiv","version":10},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2003-10-28T09:23:25Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"102a19876171eb5853cd7205f36d31343ab3472d5ab9c27f5326a46d6f83c933","abstract_canon_sha256":"572e8483cfeaa7aafd2df2696667d46c55fb777e2866cc986349bb5f75825c74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T19:05:16.573931Z","signature_b64":"l5yAkpBZBXWdtSwuA9xAZgJVk+1R7R+XXxUcStDo/h478LbReUC0/48WAI9LOLACrgODtfr9WCSC9IMoJeVtCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48dc772731d33b8f6c1171a17eda3d4b1487ad5166995311ad652c3a5cf91a1c","last_reissued_at":"2026-06-08T19:05:16.572692Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T19:05:16.572692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"Daniel A. Spielman, Shang-Hua Teng","submitted_at":"2003-10-28T09:23:25Z","abstract_excerpt":"This paper has been divided into three papers. arXiv:0809.3232, arXiv:0808.4134, arXiv:cs/0607105"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0310051","kind":"arxiv","version":10},"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/cs/0310051/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0310051","created_at":"2026-06-08T19:05:16.572994+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0310051v10","created_at":"2026-06-08T19:05:16.572994+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0310051","created_at":"2026-06-08T19:05:16.572994+00:00"},{"alias_kind":"pith_short_12","alias_value":"JDOHOJZR2M5Y","created_at":"2026-06-08T19:05:16.572994+00:00"},{"alias_kind":"pith_short_16","alias_value":"JDOHOJZR2M5Y63AR","created_at":"2026-06-08T19:05:16.572994+00:00"},{"alias_kind":"pith_short_8","alias_value":"JDOHOJZR","created_at":"2026-06-08T19:05:16.572994+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/JDOHOJZR2M5Y63AROGQX5WR5JM","json":"https://pith.science/pith/JDOHOJZR2M5Y63AROGQX5WR5JM.json","graph_json":"https://pith.science/api/pith-number/JDOHOJZR2M5Y63AROGQX5WR5JM/graph.json","events_json":"https://pith.science/api/pith-number/JDOHOJZR2M5Y63AROGQX5WR5JM/events.json","paper":"https://pith.science/paper/JDOHOJZR"},"agent_actions":{"view_html":"https://pith.science/pith/JDOHOJZR2M5Y63AROGQX5WR5JM","download_json":"https://pith.science/pith/JDOHOJZR2M5Y63AROGQX5WR5JM.json","view_paper":"https://pith.science/paper/JDOHOJZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0310051&json=true","fetch_graph":"https://pith.science/api/pith-number/JDOHOJZR2M5Y63AROGQX5WR5JM/graph.json","fetch_events":"https://pith.science/api/pith-number/JDOHOJZR2M5Y63AROGQX5WR5JM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JDOHOJZR2M5Y63AROGQX5WR5JM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JDOHOJZR2M5Y63AROGQX5WR5JM/action/storage_attestation","attest_author":"https://pith.science/pith/JDOHOJZR2M5Y63AROGQX5WR5JM/action/author_attestation","sign_citation":"https://pith.science/pith/JDOHOJZR2M5Y63AROGQX5WR5JM/action/citation_signature","submit_replication":"https://pith.science/pith/JDOHOJZR2M5Y63AROGQX5WR5JM/action/replication_record"}},"created_at":"2026-06-08T19:05:16.572994+00:00","updated_at":"2026-06-08T19:05:16.572994+00:00"}