{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5HH77LGYIBXP33IM3SDZGUYPNV","short_pith_number":"pith:5HH77LGY","schema_version":"1.0","canonical_sha256":"e9cfffacd8406efded0cdc8793530f6d77738bbe6d7b3cfae2f7720386580cf7","source":{"kind":"arxiv","id":"2312.13861","version":1},"attestation_state":"computed","paper":{"title":"Graph partition method based on finite projective planes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anna Mastikhina, Dmitry Sirotkin, Oleg Kruglov, Oleg Senkevich, Stanislav Moiseev","submitted_at":"2023-12-21T13:58:05Z","abstract_excerpt":"We present a novel graph partition algorithm with a theoretical bound for the replication factor of \\sqrt(n), which improves known constrained approaches (grid: 2* \\sqrt(n)-1, torus: 1.5*\\sqrt(n)+1) and provides better performance"},"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":"2312.13861","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-21T13:58:05Z","cross_cats_sorted":[],"title_canon_sha256":"b280d9271f57d08760997ee99f61c7946b23d43294b46d079bc1f18c40a64343","abstract_canon_sha256":"b41b9e5cd85e879d43eaf11b164350fb2e5a6508f1af9927cd0ce945615de790"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:26:57.351283Z","signature_b64":"QwYkEtEEsep8JjfPi1gyR+O/53vF3aFXValwfGsYF74C9Z8vCwVSbtcrcJGxiiWD4Eu8DBn1Re+ZZX8PEme1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9cfffacd8406efded0cdc8793530f6d77738bbe6d7b3cfae2f7720386580cf7","last_reissued_at":"2026-07-05T07:26:57.350791Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:26:57.350791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph partition method based on finite projective planes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anna Mastikhina, Dmitry Sirotkin, Oleg Kruglov, Oleg Senkevich, Stanislav Moiseev","submitted_at":"2023-12-21T13:58:05Z","abstract_excerpt":"We present a novel graph partition algorithm with a theoretical bound for the replication factor of \\sqrt(n), which improves known constrained approaches (grid: 2* \\sqrt(n)-1, torus: 1.5*\\sqrt(n)+1) and provides better performance"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.13861","kind":"arxiv","version":1},"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/2312.13861/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":"2312.13861","created_at":"2026-07-05T07:26:57.350867+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.13861v1","created_at":"2026-07-05T07:26:57.350867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.13861","created_at":"2026-07-05T07:26:57.350867+00:00"},{"alias_kind":"pith_short_12","alias_value":"5HH77LGYIBXP","created_at":"2026-07-05T07:26:57.350867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5HH77LGYIBXP33IM","created_at":"2026-07-05T07:26:57.350867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5HH77LGY","created_at":"2026-07-05T07:26:57.350867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.13491","citing_title":"Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling","ref_index":41,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5HH77LGYIBXP33IM3SDZGUYPNV","json":"https://pith.science/pith/5HH77LGYIBXP33IM3SDZGUYPNV.json","graph_json":"https://pith.science/api/pith-number/5HH77LGYIBXP33IM3SDZGUYPNV/graph.json","events_json":"https://pith.science/api/pith-number/5HH77LGYIBXP33IM3SDZGUYPNV/events.json","paper":"https://pith.science/paper/5HH77LGY"},"agent_actions":{"view_html":"https://pith.science/pith/5HH77LGYIBXP33IM3SDZGUYPNV","download_json":"https://pith.science/pith/5HH77LGYIBXP33IM3SDZGUYPNV.json","view_paper":"https://pith.science/paper/5HH77LGY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.13861&json=true","fetch_graph":"https://pith.science/api/pith-number/5HH77LGYIBXP33IM3SDZGUYPNV/graph.json","fetch_events":"https://pith.science/api/pith-number/5HH77LGYIBXP33IM3SDZGUYPNV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5HH77LGYIBXP33IM3SDZGUYPNV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5HH77LGYIBXP33IM3SDZGUYPNV/action/storage_attestation","attest_author":"https://pith.science/pith/5HH77LGYIBXP33IM3SDZGUYPNV/action/author_attestation","sign_citation":"https://pith.science/pith/5HH77LGYIBXP33IM3SDZGUYPNV/action/citation_signature","submit_replication":"https://pith.science/pith/5HH77LGYIBXP33IM3SDZGUYPNV/action/replication_record"}},"created_at":"2026-07-05T07:26:57.350867+00:00","updated_at":"2026-07-05T07:26:57.350867+00:00"}