Pith Number

pith:S6YQVOIW

pith:2026:S6YQVOIWFW3Q6O7VB6INVRTSP5

not attested not anchored not stored refs resolved

Revisiting the Maximum Defective Clique Problem: Faster Branching and a Tighter Upper Bound

Kaiqiang Yu, Kewu Yang, Shengxin Liu, Zhaoquan Gu

BBRes speeds up exact search for maximum k-defective cliques by pruning tractable branches early.

arxiv:2605.16948 v1 · 2026-05-16 · cs.DB

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{S6YQVOIWFW3Q6O7VB6INVRTSP5}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp

2 Internet Archive

3 Author claim open · sign in to claim

4 Citations open

5 Replications open

✓ Portable graph bundle live · download bundle · merged state

The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

BBRes achieves an improved theoretical worst-case time complexity and at least 2X speedup over state-of-the-art methods on a substantial fraction of the datasets.

C2weakest assumption

The claim that a non-trivial fraction of intermediate sub-problems generated during branching are both non-trivial and solvable in polynomial time by the specialized solver, allowing the early-termination rule to prune the search tree without missing optimal solutions.

C3one line summary

BBRes improves exact maximum k-defective clique search with early-termination branching and a tighter double-coloring-plus-max-flow upper bound, claiming better worst-case time and at least 2X empirical speedup on many instances.

References

62 extracted · 62 resolved · 0 Pith anchors

[1] https://github.com/Thaumaturge2020/ BBRes/

[2] Mohiuddin Ahmed, Abdun Naser Mahmood, and Md Rafiqul Islam. 2016. A survey of anomaly detection techniques in financial domain.Future Generation Computer Systems55 (2016), 278–288 2016

[3] Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. 1993.Network Flows: Theory, Algorithms, and Applications. Prentice Hall 1993

[4] Ravindra K Ahuja and James B Orlin. 1995. A capacity scaling algorithm for the constrained maximum flow problem.Networks25, 2 (1995), 89–98 1995

[5] Ravindra K Ahujia, Thomas L Magnanti, and James B Orlin. 1993. Network flows: Theory, algorithms and applications.New Jersey: Rentice-Hall3 (1993) 1993

Formal links

2 machine-checked theorem links

Receipt and verification

First computed	2026-05-20T00:03:32.384877Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

97b10ab9162db70f3bf50f90dac6727f69b26c13a308b10741131f5ab60229a6

Aliases

arxiv: 2605.16948 · arxiv_version: 2605.16948v1 · doi: 10.48550/arxiv.2605.16948 · pith_short_12: S6YQVOIWFW3Q · pith_short_16: S6YQVOIWFW3Q6O7V · pith_short_8: S6YQVOIW

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/S6YQVOIWFW3Q6O7VB6INVRTSP5 \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 97b10ab9162db70f3bf50f90dac6727f69b26c13a308b10741131f5ab60229a6

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "0a6b69d562e69acffe1097650c590b322198e51e54181093ed9395c0f3efd80b",
    "cross_cats_sorted": [],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.DB",
    "submitted_at": "2026-05-16T11:58:39Z",
    "title_canon_sha256": "c6b86b45251d6fc791c66eabab844f701ad420f70bcadfe51b4005cf06a7c5fd"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.16948",
    "kind": "arxiv",
    "version": 1
  }
}