{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FYILY7VFXWKRMC3DALPHZJDR5R","short_pith_number":"pith:FYILY7VF","schema_version":"1.0","canonical_sha256":"2e10bc7ea5bd95160b6302de7ca471ec63eab31df399449c8613f6fa4a1c1943","source":{"kind":"arxiv","id":"2504.20795","version":1},"attestation_state":"computed","paper":{"title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guanming Jiang, Peng Xu, Philip S.Yu, Shengli Sun, Yi Li","submitted_at":"2025-04-29T14:10:39Z","abstract_excerpt":"Computing $(k,\\eta)$-cores from uncertain graphs is a fundamental problem in uncertain graph analysis. UCF-Index is the state-of-the-art resolution to support $(k,\\eta)$-core queries, allowing the $(k,\\eta)$-core for any combination of $k$ and $\\eta$ to be computed in an optimal time. However, this index constructed by current algorithm is usually incorrect. During decomposition, the key is to obtain the $k$-probabilities of its neighbors when the vertex with minimum $k$-probability is deleted. Current method uses recursive floating-point division to update it, which can lead to serious errors"},"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":"2504.20795","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-04-29T14:10:39Z","cross_cats_sorted":[],"title_canon_sha256":"5f396cca458283c02e52ab0a79970f417b8122c630ef43de0eec54419e2dcb48","abstract_canon_sha256":"322562cdb99a60c5c949c14183c07709005780c51fb7ae2a7e8b831895c71ad0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:48.956497Z","signature_b64":"aTuet0cBK04ZJYEcTmSGCkjgtPI+iC+R5oLTQ0tMofast3sVjyNcXhJmYqhRs/eZRd6m2stQONawCU5K00qdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e10bc7ea5bd95160b6302de7ca471ec63eab31df399449c8613f6fa4a1c1943","last_reissued_at":"2026-07-05T10:55:48.956026Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:48.956026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guanming Jiang, Peng Xu, Philip S.Yu, Shengli Sun, Yi Li","submitted_at":"2025-04-29T14:10:39Z","abstract_excerpt":"Computing $(k,\\eta)$-cores from uncertain graphs is a fundamental problem in uncertain graph analysis. UCF-Index is the state-of-the-art resolution to support $(k,\\eta)$-core queries, allowing the $(k,\\eta)$-core for any combination of $k$ and $\\eta$ to be computed in an optimal time. However, this index constructed by current algorithm is usually incorrect. During decomposition, the key is to obtain the $k$-probabilities of its neighbors when the vertex with minimum $k$-probability is deleted. Current method uses recursive floating-point division to update it, which can lead to serious errors"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.20795","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/2504.20795/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":"2504.20795","created_at":"2026-07-05T10:55:48.956084+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.20795v1","created_at":"2026-07-05T10:55:48.956084+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.20795","created_at":"2026-07-05T10:55:48.956084+00:00"},{"alias_kind":"pith_short_12","alias_value":"FYILY7VFXWKR","created_at":"2026-07-05T10:55:48.956084+00:00"},{"alias_kind":"pith_short_16","alias_value":"FYILY7VFXWKRMC3D","created_at":"2026-07-05T10:55:48.956084+00:00"},{"alias_kind":"pith_short_8","alias_value":"FYILY7VF","created_at":"2026-07-05T10:55:48.956084+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/FYILY7VFXWKRMC3DALPHZJDR5R","json":"https://pith.science/pith/FYILY7VFXWKRMC3DALPHZJDR5R.json","graph_json":"https://pith.science/api/pith-number/FYILY7VFXWKRMC3DALPHZJDR5R/graph.json","events_json":"https://pith.science/api/pith-number/FYILY7VFXWKRMC3DALPHZJDR5R/events.json","paper":"https://pith.science/paper/FYILY7VF"},"agent_actions":{"view_html":"https://pith.science/pith/FYILY7VFXWKRMC3DALPHZJDR5R","download_json":"https://pith.science/pith/FYILY7VFXWKRMC3DALPHZJDR5R.json","view_paper":"https://pith.science/paper/FYILY7VF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.20795&json=true","fetch_graph":"https://pith.science/api/pith-number/FYILY7VFXWKRMC3DALPHZJDR5R/graph.json","fetch_events":"https://pith.science/api/pith-number/FYILY7VFXWKRMC3DALPHZJDR5R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FYILY7VFXWKRMC3DALPHZJDR5R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FYILY7VFXWKRMC3DALPHZJDR5R/action/storage_attestation","attest_author":"https://pith.science/pith/FYILY7VFXWKRMC3DALPHZJDR5R/action/author_attestation","sign_citation":"https://pith.science/pith/FYILY7VFXWKRMC3DALPHZJDR5R/action/citation_signature","submit_replication":"https://pith.science/pith/FYILY7VFXWKRMC3DALPHZJDR5R/action/replication_record"}},"created_at":"2026-07-05T10:55:48.956084+00:00","updated_at":"2026-07-05T10:55:48.956084+00:00"}