{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FCZGSBSKN422T6HLUJPDUXHXVC","short_pith_number":"pith:FCZGSBSK","schema_version":"1.0","canonical_sha256":"28b269064a6f35a9f8eba25e3a5cf7a88a7f847b8ff64afcce69dd661cfb7182","source":{"kind":"arxiv","id":"2509.13584","version":2},"attestation_state":"computed","paper":{"title":"Hardness of Dynamic Core and Truss Decompositions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Cristina G. Fernandes, Yan S. Couto","submitted_at":"2025-09-16T22:59:51Z","abstract_excerpt":"The k-core of a graph is its maximal subgraph with minimum degree at least k, and the core value of a vertex u is the largest k for which u is contained in the k-core of the graph. Among cohesive subgraphs, k-core and its variants have received a lot of attention recently, particularly on dynamic graphs, as reported by Hanauer, Henzinger, and Schulz in their recent survey on dynamic graph algorithms. We answer questions on k-core stated in the survey, proving that there is no efficient dynamic algorithm for k-core or to find (2 - {\\epsilon})-approximations for the core values, unless we can im"},"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":"2509.13584","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-09-16T22:59:51Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"92799fd37016e0791068b3307e74e0535cff7ec797c77079d02d675a9f7ca5d5","abstract_canon_sha256":"9bb0e8c2ff50468d29a48aa5e2474d27aaade6d2ceda982145e5cd4d8b74b16f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T00:18:11.619940Z","signature_b64":"estpJK4XVo8yl6WBEVGi8fYRVCuim8Yzw39BDofqfq9yVvZ3cPzkEjFAB0+4121sYfxrLpFswAi34hvQyVBSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28b269064a6f35a9f8eba25e3a5cf7a88a7f847b8ff64afcce69dd661cfb7182","last_reissued_at":"2026-06-25T00:18:11.619454Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T00:18:11.619454Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardness of Dynamic Core and Truss Decompositions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Cristina G. Fernandes, Yan S. Couto","submitted_at":"2025-09-16T22:59:51Z","abstract_excerpt":"The k-core of a graph is its maximal subgraph with minimum degree at least k, and the core value of a vertex u is the largest k for which u is contained in the k-core of the graph. Among cohesive subgraphs, k-core and its variants have received a lot of attention recently, particularly on dynamic graphs, as reported by Hanauer, Henzinger, and Schulz in their recent survey on dynamic graph algorithms. We answer questions on k-core stated in the survey, proving that there is no efficient dynamic algorithm for k-core or to find (2 - {\\epsilon})-approximations for the core values, unless we can im"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.13584","kind":"arxiv","version":2},"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/2509.13584/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":"2509.13584","created_at":"2026-06-25T00:18:11.619513+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.13584v2","created_at":"2026-06-25T00:18:11.619513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.13584","created_at":"2026-06-25T00:18:11.619513+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCZGSBSKN422","created_at":"2026-06-25T00:18:11.619513+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCZGSBSKN422T6HL","created_at":"2026-06-25T00:18:11.619513+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCZGSBSK","created_at":"2026-06-25T00:18:11.619513+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/FCZGSBSKN422T6HLUJPDUXHXVC","json":"https://pith.science/pith/FCZGSBSKN422T6HLUJPDUXHXVC.json","graph_json":"https://pith.science/api/pith-number/FCZGSBSKN422T6HLUJPDUXHXVC/graph.json","events_json":"https://pith.science/api/pith-number/FCZGSBSKN422T6HLUJPDUXHXVC/events.json","paper":"https://pith.science/paper/FCZGSBSK"},"agent_actions":{"view_html":"https://pith.science/pith/FCZGSBSKN422T6HLUJPDUXHXVC","download_json":"https://pith.science/pith/FCZGSBSKN422T6HLUJPDUXHXVC.json","view_paper":"https://pith.science/paper/FCZGSBSK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.13584&json=true","fetch_graph":"https://pith.science/api/pith-number/FCZGSBSKN422T6HLUJPDUXHXVC/graph.json","fetch_events":"https://pith.science/api/pith-number/FCZGSBSKN422T6HLUJPDUXHXVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCZGSBSKN422T6HLUJPDUXHXVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCZGSBSKN422T6HLUJPDUXHXVC/action/storage_attestation","attest_author":"https://pith.science/pith/FCZGSBSKN422T6HLUJPDUXHXVC/action/author_attestation","sign_citation":"https://pith.science/pith/FCZGSBSKN422T6HLUJPDUXHXVC/action/citation_signature","submit_replication":"https://pith.science/pith/FCZGSBSKN422T6HLUJPDUXHXVC/action/replication_record"}},"created_at":"2026-06-25T00:18:11.619513+00:00","updated_at":"2026-06-25T00:18:11.619513+00:00"}