{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:TMFAV7V73QQHJF5GUT26N6L52N","short_pith_number":"pith:TMFAV7V7","canonical_record":{"source":{"id":"2507.05860","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-07-08T10:40:21Z","cross_cats_sorted":["cs.DM","math.GR"],"title_canon_sha256":"c2b372f7de96db822d7ec16824c2e4863878f93a6b91c20940768c1c9e27946d","abstract_canon_sha256":"5b96b1cf3767fad7a7541f40b90cfaec793147e7ef263025e991655e959a179f"},"schema_version":"1.0"},"canonical_sha256":"9b0a0afebfdc207497a6a4f5e6f97dd3707c16cf459c0aec33873376f936cbaa","source":{"kind":"arxiv","id":"2507.05860","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.05860","created_at":"2026-07-05T11:33:37Z"},{"alias_kind":"arxiv_version","alias_value":"2507.05860v1","created_at":"2026-07-05T11:33:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.05860","created_at":"2026-07-05T11:33:37Z"},{"alias_kind":"pith_short_12","alias_value":"TMFAV7V73QQH","created_at":"2026-07-05T11:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"TMFAV7V73QQHJF5G","created_at":"2026-07-05T11:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"TMFAV7V7","created_at":"2026-07-05T11:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:TMFAV7V73QQHJF5GUT26N6L52N","target":"record","payload":{"canonical_record":{"source":{"id":"2507.05860","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-07-08T10:40:21Z","cross_cats_sorted":["cs.DM","math.GR"],"title_canon_sha256":"c2b372f7de96db822d7ec16824c2e4863878f93a6b91c20940768c1c9e27946d","abstract_canon_sha256":"5b96b1cf3767fad7a7541f40b90cfaec793147e7ef263025e991655e959a179f"},"schema_version":"1.0"},"canonical_sha256":"9b0a0afebfdc207497a6a4f5e6f97dd3707c16cf459c0aec33873376f936cbaa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:33:37.302826Z","signature_b64":"sG8ivJmpIwdmdjOUazkru/6ucL01lHHFhjkKKRIN6Sl38M42ZZBk4ewy4K9wwL6UIzy8VFmgLeFGZxaPh7oFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b0a0afebfdc207497a6a4f5e6f97dd3707c16cf459c0aec33873376f936cbaa","last_reissued_at":"2026-07-05T11:33:37.302429Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:33:37.302429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.05860","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-05T11:33:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"129fbImzdgZKNHS5QrErtkG7xiojcrp9mIDooTZQwb1NYhvrKkBqKcokvu6kLaq5HA4VrvRzCznZ4NEkYk5KCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T00:27:51.168738Z"},"content_sha256":"b367de8a5c740b2d952f8674cb69871d071f1baed274196792bc3f213689b6a1","schema_version":"1.0","event_id":"sha256:b367de8a5c740b2d952f8674cb69871d071f1baed274196792bc3f213689b6a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:TMFAV7V73QQHJF5GUT26N6L52N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Problems on Graphs Defined on Groups","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.GR"],"primary_cat":"cs.CC","authors_text":"Bireswar Das, Dipan Dey, Jinia Ghosh","submitted_at":"2025-07-08T10:40:21Z","abstract_excerpt":"We study the complexity of graph problems on graphs defined on groups, especially power graphs. We observe that an isomorphism invariant problem, such as Hamiltonian Path, Partition into Cliques, Feedback Vertex Set, Subgraph Isomorphism, cannot be NP-complete for power graphs, commuting graphs, enhanced power graphs, directed power graphs, and bounded-degree Cayley graphs, assuming the Exponential Time Hypothesis (ETH). An analogous result holds for isomorphism invariant group problems: no such problem can be NP-complete unless ETH is false. We show that the Weighted Max-Cut problem is NP-com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.05860","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/2507.05860/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-05T11:33:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zYPcWNxrgO81W2quSYOktuvqFKnxY40rGhg7m70dAt2WPpwZaEmZiYvnKOBqvMSmlb8SWZkBYDwZuQ/O5eLoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T00:27:51.169252Z"},"content_sha256":"ae9c8de2b16776feb55863bca083707608628d8a4169379d6f2eff7628e0c7c0","schema_version":"1.0","event_id":"sha256:ae9c8de2b16776feb55863bca083707608628d8a4169379d6f2eff7628e0c7c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TMFAV7V73QQHJF5GUT26N6L52N/bundle.json","state_url":"https://pith.science/pith/TMFAV7V73QQHJF5GUT26N6L52N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TMFAV7V73QQHJF5GUT26N6L52N/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-19T00:27:51Z","links":{"resolver":"https://pith.science/pith/TMFAV7V73QQHJF5GUT26N6L52N","bundle":"https://pith.science/pith/TMFAV7V73QQHJF5GUT26N6L52N/bundle.json","state":"https://pith.science/pith/TMFAV7V73QQHJF5GUT26N6L52N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TMFAV7V73QQHJF5GUT26N6L52N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:TMFAV7V73QQHJF5GUT26N6L52N","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":"5b96b1cf3767fad7a7541f40b90cfaec793147e7ef263025e991655e959a179f","cross_cats_sorted":["cs.DM","math.GR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-07-08T10:40:21Z","title_canon_sha256":"c2b372f7de96db822d7ec16824c2e4863878f93a6b91c20940768c1c9e27946d"},"schema_version":"1.0","source":{"id":"2507.05860","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.05860","created_at":"2026-07-05T11:33:37Z"},{"alias_kind":"arxiv_version","alias_value":"2507.05860v1","created_at":"2026-07-05T11:33:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.05860","created_at":"2026-07-05T11:33:37Z"},{"alias_kind":"pith_short_12","alias_value":"TMFAV7V73QQH","created_at":"2026-07-05T11:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"TMFAV7V73QQHJF5G","created_at":"2026-07-05T11:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"TMFAV7V7","created_at":"2026-07-05T11:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:ae9c8de2b16776feb55863bca083707608628d8a4169379d6f2eff7628e0c7c0","target":"graph","created_at":"2026-07-05T11:33:37Z","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/2507.05860/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the complexity of graph problems on graphs defined on groups, especially power graphs. We observe that an isomorphism invariant problem, such as Hamiltonian Path, Partition into Cliques, Feedback Vertex Set, Subgraph Isomorphism, cannot be NP-complete for power graphs, commuting graphs, enhanced power graphs, directed power graphs, and bounded-degree Cayley graphs, assuming the Exponential Time Hypothesis (ETH). An analogous result holds for isomorphism invariant group problems: no such problem can be NP-complete unless ETH is false. We show that the Weighted Max-Cut problem is NP-com","authors_text":"Bireswar Das, Dipan Dey, Jinia Ghosh","cross_cats":["cs.DM","math.GR"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-07-08T10:40:21Z","title":"On the Complexity of Problems on Graphs Defined on Groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.05860","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:b367de8a5c740b2d952f8674cb69871d071f1baed274196792bc3f213689b6a1","target":"record","created_at":"2026-07-05T11:33:37Z","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":"5b96b1cf3767fad7a7541f40b90cfaec793147e7ef263025e991655e959a179f","cross_cats_sorted":["cs.DM","math.GR"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-07-08T10:40:21Z","title_canon_sha256":"c2b372f7de96db822d7ec16824c2e4863878f93a6b91c20940768c1c9e27946d"},"schema_version":"1.0","source":{"id":"2507.05860","kind":"arxiv","version":1}},"canonical_sha256":"9b0a0afebfdc207497a6a4f5e6f97dd3707c16cf459c0aec33873376f936cbaa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b0a0afebfdc207497a6a4f5e6f97dd3707c16cf459c0aec33873376f936cbaa","first_computed_at":"2026-07-05T11:33:37.302429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:33:37.302429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sG8ivJmpIwdmdjOUazkru/6ucL01lHHFhjkKKRIN6Sl38M42ZZBk4ewy4K9wwL6UIzy8VFmgLeFGZxaPh7oFAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:33:37.302826Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.05860","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b367de8a5c740b2d952f8674cb69871d071f1baed274196792bc3f213689b6a1","sha256:ae9c8de2b16776feb55863bca083707608628d8a4169379d6f2eff7628e0c7c0"],"state_sha256":"d2d5e16650ee046b1ee387ff28bd27b65686bd84736666a165a28df54253c4dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0idZmgt3TOQt4hNEfvIRAv1dHCIcUNmTRbdWmgtwtFPbiaktAKVln1uCYBq1CpnXWLWz+aAbDxN4VaC38JxdCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T00:27:51.173192Z","bundle_sha256":"432366ffe14158fd9a05801631cab331e678ef1e5e92320977a370cb80aed9e2"}}