{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FYILY7VFXWKRMC3DALPHZJDR5R","short_pith_number":"pith:FYILY7VF","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"},"canonical_sha256":"2e10bc7ea5bd95160b6302de7ca471ec63eab31df399449c8613f6fa4a1c1943","source":{"kind":"arxiv","id":"2504.20795","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.20795","created_at":"2026-07-05T10:55:48Z"},{"alias_kind":"arxiv_version","alias_value":"2504.20795v1","created_at":"2026-07-05T10:55:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.20795","created_at":"2026-07-05T10:55:48Z"},{"alias_kind":"pith_short_12","alias_value":"FYILY7VFXWKR","created_at":"2026-07-05T10:55:48Z"},{"alias_kind":"pith_short_16","alias_value":"FYILY7VFXWKRMC3D","created_at":"2026-07-05T10:55:48Z"},{"alias_kind":"pith_short_8","alias_value":"FYILY7VF","created_at":"2026-07-05T10:55:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FYILY7VFXWKRMC3DALPHZJDR5R","target":"record","payload":{"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"},"canonical_sha256":"2e10bc7ea5bd95160b6302de7ca471ec63eab31df399449c8613f6fa4a1c1943","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"},"source_kind":"arxiv","source_id":"2504.20795","source_version":1,"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-07-05T10:55:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wa64DikhMs+6gvLJbzxICrial85BcE8Ux5EvlxfPvqTurO9CX6WXNyU5guBmM5uGME/YruQOJnBbJszeYC/2AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T14:17:23.559831Z"},"content_sha256":"3925b32b8bf7c9c21fb0578eed647999be9b249e3d1ef7aa4aacfa3ea6e87555","schema_version":"1.0","event_id":"sha256:3925b32b8bf7c9c21fb0578eed647999be9b249e3d1ef7aa4aacfa3ea6e87555"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FYILY7VFXWKRMC3DALPHZJDR5R","target":"graph","payload":{"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"},"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-07-05T10:55:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v2lF8LkKh2gYzSkDnGolYSbO+nzC5tnhZnU5mAThec7R7fdUDhYz5mZYo/SLnton7erW1DlKdT9NCBLSITS5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T14:17:23.560740Z"},"content_sha256":"9a5d563871b54bf8037770c2b79fb6736262d095b417c4ca6eb2f22a0d4f43e5","schema_version":"1.0","event_id":"sha256:9a5d563871b54bf8037770c2b79fb6736262d095b417c4ca6eb2f22a0d4f43e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FYILY7VFXWKRMC3DALPHZJDR5R/bundle.json","state_url":"https://pith.science/pith/FYILY7VFXWKRMC3DALPHZJDR5R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FYILY7VFXWKRMC3DALPHZJDR5R/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-08-18T14:17:23Z","links":{"resolver":"https://pith.science/pith/FYILY7VFXWKRMC3DALPHZJDR5R","bundle":"https://pith.science/pith/FYILY7VFXWKRMC3DALPHZJDR5R/bundle.json","state":"https://pith.science/pith/FYILY7VFXWKRMC3DALPHZJDR5R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FYILY7VFXWKRMC3DALPHZJDR5R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FYILY7VFXWKRMC3DALPHZJDR5R","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":"322562cdb99a60c5c949c14183c07709005780c51fb7ae2a7e8b831895c71ad0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-04-29T14:10:39Z","title_canon_sha256":"5f396cca458283c02e52ab0a79970f417b8122c630ef43de0eec54419e2dcb48"},"schema_version":"1.0","source":{"id":"2504.20795","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.20795","created_at":"2026-07-05T10:55:48Z"},{"alias_kind":"arxiv_version","alias_value":"2504.20795v1","created_at":"2026-07-05T10:55:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.20795","created_at":"2026-07-05T10:55:48Z"},{"alias_kind":"pith_short_12","alias_value":"FYILY7VFXWKR","created_at":"2026-07-05T10:55:48Z"},{"alias_kind":"pith_short_16","alias_value":"FYILY7VFXWKRMC3D","created_at":"2026-07-05T10:55:48Z"},{"alias_kind":"pith_short_8","alias_value":"FYILY7VF","created_at":"2026-07-05T10:55:48Z"}],"graph_snapshots":[{"event_id":"sha256:9a5d563871b54bf8037770c2b79fb6736262d095b417c4ca6eb2f22a0d4f43e5","target":"graph","created_at":"2026-07-05T10:55:48Z","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/2504.20795/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Guanming Jiang, Peng Xu, Philip S.Yu, Shengli Sun, Yi Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-04-29T14:10:39Z","title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.20795","kind":"arxiv","version":1},"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:3925b32b8bf7c9c21fb0578eed647999be9b249e3d1ef7aa4aacfa3ea6e87555","target":"record","created_at":"2026-07-05T10:55:48Z","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":"322562cdb99a60c5c949c14183c07709005780c51fb7ae2a7e8b831895c71ad0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-04-29T14:10:39Z","title_canon_sha256":"5f396cca458283c02e52ab0a79970f417b8122c630ef43de0eec54419e2dcb48"},"schema_version":"1.0","source":{"id":"2504.20795","kind":"arxiv","version":1}},"canonical_sha256":"2e10bc7ea5bd95160b6302de7ca471ec63eab31df399449c8613f6fa4a1c1943","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e10bc7ea5bd95160b6302de7ca471ec63eab31df399449c8613f6fa4a1c1943","first_computed_at":"2026-07-05T10:55:48.956026Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:55:48.956026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aTuet0cBK04ZJYEcTmSGCkjgtPI+iC+R5oLTQ0tMofast3sVjyNcXhJmYqhRs/eZRd6m2stQONawCU5K00qdAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:55:48.956497Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.20795","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3925b32b8bf7c9c21fb0578eed647999be9b249e3d1ef7aa4aacfa3ea6e87555","sha256:9a5d563871b54bf8037770c2b79fb6736262d095b417c4ca6eb2f22a0d4f43e5"],"state_sha256":"ead2d78dbb3265a0a4f459afc718aea9c10990cbfacdaef05d01016ce8116b1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dwLAoiPcB6wWeJ86D8OydYv3gTrxNqJRFUzbOOkHwdDLBPe8fWL9KePHSck7vTaIVZSwnYdMEluF6SahVxheCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T14:17:23.568321Z","bundle_sha256":"ea1839faefc6dc5c06d8f2bd575bed99aedfe24698f7ec60fa21bb5e161ddb31"}}