{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HHIIZA5NH5UF6PW2J6VHM3XHRG","short_pith_number":"pith:HHIIZA5N","schema_version":"1.0","canonical_sha256":"39d08c83ad3f685f3eda4faa766ee78985a34e4f2c29801d159b3551989476d2","source":{"kind":"arxiv","id":"1311.3144","version":3},"attestation_state":"computed","paper":{"title":"Recent Advances in Graph Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.CO"],"primary_cat":"cs.DS","authors_text":"Aydin Buluc, Christian Schulz, Henning Meyerhenke, Ilya Safro, Peter Sanders","submitted_at":"2013-11-13T14:33:09Z","abstract_excerpt":"We survey recent trends in practical algorithms for balanced graph partitioning together with applications and future research directions."},"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":"1311.3144","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-13T14:33:09Z","cross_cats_sorted":["cs.DC","math.CO"],"title_canon_sha256":"a6d362a046b45a77007e2a11d7a4e489c5d439b70931769580f2c2db781930e6","abstract_canon_sha256":"182a905745eb0c9a7e1e785b6922e40a4c9bd506dd38a4153b6572e13d188b58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:05.502882Z","signature_b64":"U2/6RPjC158uXodU7NIS+ic6CpnPiXOd42GStG74dhDvoNkOdSFjeWc6MssltFq6FXxQG2sdb1JSVy3014e8Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39d08c83ad3f685f3eda4faa766ee78985a34e4f2c29801d159b3551989476d2","last_reissued_at":"2026-05-18T02:28:05.502460Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:05.502460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recent Advances in Graph Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.CO"],"primary_cat":"cs.DS","authors_text":"Aydin Buluc, Christian Schulz, Henning Meyerhenke, Ilya Safro, Peter Sanders","submitted_at":"2013-11-13T14:33:09Z","abstract_excerpt":"We survey recent trends in practical algorithms for balanced graph partitioning together with applications and future research directions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3144","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":"1311.3144","created_at":"2026-05-18T02:28:05.502523+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.3144v3","created_at":"2026-05-18T02:28:05.502523+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3144","created_at":"2026-05-18T02:28:05.502523+00:00"},{"alias_kind":"pith_short_12","alias_value":"HHIIZA5NH5UF","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HHIIZA5NH5UF6PW2","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HHIIZA5N","created_at":"2026-05-18T12:27:46.883200+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.04200","citing_title":"Restoring Sparsity in Potts Machines via Mean-Field Constraints","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HHIIZA5NH5UF6PW2J6VHM3XHRG","json":"https://pith.science/pith/HHIIZA5NH5UF6PW2J6VHM3XHRG.json","graph_json":"https://pith.science/api/pith-number/HHIIZA5NH5UF6PW2J6VHM3XHRG/graph.json","events_json":"https://pith.science/api/pith-number/HHIIZA5NH5UF6PW2J6VHM3XHRG/events.json","paper":"https://pith.science/paper/HHIIZA5N"},"agent_actions":{"view_html":"https://pith.science/pith/HHIIZA5NH5UF6PW2J6VHM3XHRG","download_json":"https://pith.science/pith/HHIIZA5NH5UF6PW2J6VHM3XHRG.json","view_paper":"https://pith.science/paper/HHIIZA5N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.3144&json=true","fetch_graph":"https://pith.science/api/pith-number/HHIIZA5NH5UF6PW2J6VHM3XHRG/graph.json","fetch_events":"https://pith.science/api/pith-number/HHIIZA5NH5UF6PW2J6VHM3XHRG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HHIIZA5NH5UF6PW2J6VHM3XHRG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HHIIZA5NH5UF6PW2J6VHM3XHRG/action/storage_attestation","attest_author":"https://pith.science/pith/HHIIZA5NH5UF6PW2J6VHM3XHRG/action/author_attestation","sign_citation":"https://pith.science/pith/HHIIZA5NH5UF6PW2J6VHM3XHRG/action/citation_signature","submit_replication":"https://pith.science/pith/HHIIZA5NH5UF6PW2J6VHM3XHRG/action/replication_record"}},"created_at":"2026-05-18T02:28:05.502523+00:00","updated_at":"2026-05-18T02:28:05.502523+00:00"}