{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LAY5REU3FF7RAKVAXNCK3B6JEF","short_pith_number":"pith:LAY5REU3","canonical_record":{"source":{"id":"2604.13353","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2026-04-14T23:23:46Z","cross_cats_sorted":[],"title_canon_sha256":"3efb0ec70e100e30f7b6736375e8344e2c4c593551bdd67e5ce39474abe4d8a9","abstract_canon_sha256":"b1b791c5ac0601925f9bb432b4a30cfcbaf91621a925ce4f3e33d0bda574feae"},"schema_version":"1.0"},"canonical_sha256":"5831d8929b297f102aa0bb44ad87c9214419dd17fc880625faae6a63efecba1d","source":{"kind":"arxiv","id":"2604.13353","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.13353","created_at":"2026-05-20T00:04:31Z"},{"alias_kind":"arxiv_version","alias_value":"2604.13353v2","created_at":"2026-05-20T00:04:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.13353","created_at":"2026-05-20T00:04:31Z"},{"alias_kind":"pith_short_12","alias_value":"LAY5REU3FF7R","created_at":"2026-05-20T00:04:31Z"},{"alias_kind":"pith_short_16","alias_value":"LAY5REU3FF7RAKVA","created_at":"2026-05-20T00:04:31Z"},{"alias_kind":"pith_short_8","alias_value":"LAY5REU3","created_at":"2026-05-20T00:04:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LAY5REU3FF7RAKVAXNCK3B6JEF","target":"record","payload":{"canonical_record":{"source":{"id":"2604.13353","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2026-04-14T23:23:46Z","cross_cats_sorted":[],"title_canon_sha256":"3efb0ec70e100e30f7b6736375e8344e2c4c593551bdd67e5ce39474abe4d8a9","abstract_canon_sha256":"b1b791c5ac0601925f9bb432b4a30cfcbaf91621a925ce4f3e33d0bda574feae"},"schema_version":"1.0"},"canonical_sha256":"5831d8929b297f102aa0bb44ad87c9214419dd17fc880625faae6a63efecba1d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:31.600595Z","signature_b64":"kj3nuzFzj1CcGqs2E2UlvlS5ul93c1SFSsbWEQ+M3DL8BtoQ8kliDHKC12ghV8RwJzOamuBFg9aun928F2tCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5831d8929b297f102aa0bb44ad87c9214419dd17fc880625faae6a63efecba1d","last_reissued_at":"2026-05-20T00:04:31.599758Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:31.599758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.13353","source_version":2,"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-05-20T00:04:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"55BfmlDx3tIV6O7aG6sF4so16+NJRS98tYESUBJzqO+Fk2YftAEPAqYZUhDeCh9icSiuK59CyNNCn8QHqQAmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T00:09:05.712070Z"},"content_sha256":"9bd7f4863522238e15bc26af129e5385a4d0579c4c98a0f4fd2c5949061ad8a6","schema_version":"1.0","event_id":"sha256:9bd7f4863522238e15bc26af129e5385a4d0579c4c98a0f4fd2c5949061ad8a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LAY5REU3FF7RAKVAXNCK3B6JEF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cross-Domain Query Translation for Network Troubleshooting: A Multi-Agent LLM Framework with Privacy Preservation and Self-Reflection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Multi-agent LLM system classifies network queries, anonymizes PII, and translates expert advice for users.","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Brigitte Jaumard, Karthikeyan Premkumar, Nguyen Phuc Tran, Salman Memon","submitted_at":"2026-04-14T23:23:46Z","abstract_excerpt":"This paper presents a hierarchical multi-agent LLM architecture to bridge communication gaps between non-technical end users and telecommunications domain experts in private network environments. We propose a cross-domain query translation framework that leverages specialized language models coordinated through multi-agent reflection-based reasoning. The resulting system addresses three critical challenges: (1) accurately classify user queries related to telecommunications network issues using a dual-stage hierarchical approach, (2) preserve user privacy through the anonymization of semantical"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The resulting system addresses three critical challenges: (1) accurately classify user queries related to telecommunications network issues using a dual-stage hierarchical approach, (2) preserve user privacy through the anonymization of semantically relevant personally identifiable information (PII) while maintaining diagnostic utility, and (3) translate technical expert responses into user-comprehensible language.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the proposed semantic-preserving anonymization techniques can simultaneously respect k-anonymity and differential privacy principles while retaining enough diagnostic utility for accurate expert responses, and that the multi-agent self-reflection loop will reliably improve outputs without introducing new errors.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A hierarchical multi-agent LLM framework with self-reflection and semantic-preserving anonymization translates cross-domain queries for network troubleshooting and was evaluated on 10,000 unseen scenarios.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Multi-agent LLM system classifies network queries, anonymizes PII, and translates expert advice for users.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"bdb07f74fda103249710d23f82244fde3a78c23918cd50d4a5d5dcb7351b413e"},"source":{"id":"2604.13353","kind":"arxiv","version":2},"verdict":{"id":"c52b7c4b-b330-40c6-91d2-008d4c18d060","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T13:41:22.608740Z","strongest_claim":"The resulting system addresses three critical challenges: (1) accurately classify user queries related to telecommunications network issues using a dual-stage hierarchical approach, (2) preserve user privacy through the anonymization of semantically relevant personally identifiable information (PII) while maintaining diagnostic utility, and (3) translate technical expert responses into user-comprehensible language.","one_line_summary":"A hierarchical multi-agent LLM framework with self-reflection and semantic-preserving anonymization translates cross-domain queries for network troubleshooting and was evaluated on 10,000 unseen scenarios.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the proposed semantic-preserving anonymization techniques can simultaneously respect k-anonymity and differential privacy principles while retaining enough diagnostic utility for accurate expert responses, and that the multi-agent self-reflection loop will reliably improve outputs without introducing new errors.","pith_extraction_headline":"Multi-agent LLM system classifies network queries, anonymizes PII, and translates expert advice for users."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.13353/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":"c52b7c4b-b330-40c6-91d2-008d4c18d060"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:04:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n3eCxLhQvm7c+jf0H0sKWxlFqQ9x0QWPV2PDQOIWmzUxOiybwTWSXExGUUf4m9Z/2YhdUJah3g63IVxijS0kCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T00:09:05.713026Z"},"content_sha256":"eaeb2a4d602e5df5fd951b62dc6769acd366d0ca435a4cbbedfcd1ed519b5802","schema_version":"1.0","event_id":"sha256:eaeb2a4d602e5df5fd951b62dc6769acd366d0ca435a4cbbedfcd1ed519b5802"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LAY5REU3FF7RAKVAXNCK3B6JEF/bundle.json","state_url":"https://pith.science/pith/LAY5REU3FF7RAKVAXNCK3B6JEF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LAY5REU3FF7RAKVAXNCK3B6JEF/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-06-07T00:09:05Z","links":{"resolver":"https://pith.science/pith/LAY5REU3FF7RAKVAXNCK3B6JEF","bundle":"https://pith.science/pith/LAY5REU3FF7RAKVAXNCK3B6JEF/bundle.json","state":"https://pith.science/pith/LAY5REU3FF7RAKVAXNCK3B6JEF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LAY5REU3FF7RAKVAXNCK3B6JEF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LAY5REU3FF7RAKVAXNCK3B6JEF","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":"b1b791c5ac0601925f9bb432b4a30cfcbaf91621a925ce4f3e33d0bda574feae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2026-04-14T23:23:46Z","title_canon_sha256":"3efb0ec70e100e30f7b6736375e8344e2c4c593551bdd67e5ce39474abe4d8a9"},"schema_version":"1.0","source":{"id":"2604.13353","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.13353","created_at":"2026-05-20T00:04:31Z"},{"alias_kind":"arxiv_version","alias_value":"2604.13353v2","created_at":"2026-05-20T00:04:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.13353","created_at":"2026-05-20T00:04:31Z"},{"alias_kind":"pith_short_12","alias_value":"LAY5REU3FF7R","created_at":"2026-05-20T00:04:31Z"},{"alias_kind":"pith_short_16","alias_value":"LAY5REU3FF7RAKVA","created_at":"2026-05-20T00:04:31Z"},{"alias_kind":"pith_short_8","alias_value":"LAY5REU3","created_at":"2026-05-20T00:04:31Z"}],"graph_snapshots":[{"event_id":"sha256:eaeb2a4d602e5df5fd951b62dc6769acd366d0ca435a4cbbedfcd1ed519b5802","target":"graph","created_at":"2026-05-20T00:04:31Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The resulting system addresses three critical challenges: (1) accurately classify user queries related to telecommunications network issues using a dual-stage hierarchical approach, (2) preserve user privacy through the anonymization of semantically relevant personally identifiable information (PII) while maintaining diagnostic utility, and (3) translate technical expert responses into user-comprehensible language."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the proposed semantic-preserving anonymization techniques can simultaneously respect k-anonymity and differential privacy principles while retaining enough diagnostic utility for accurate expert responses, and that the multi-agent self-reflection loop will reliably improve outputs without introducing new errors."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A hierarchical multi-agent LLM framework with self-reflection and semantic-preserving anonymization translates cross-domain queries for network troubleshooting and was evaluated on 10,000 unseen scenarios."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Multi-agent LLM system classifies network queries, anonymizes PII, and translates expert advice for users."}],"snapshot_sha256":"bdb07f74fda103249710d23f82244fde3a78c23918cd50d4a5d5dcb7351b413e"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.13353/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper presents a hierarchical multi-agent LLM architecture to bridge communication gaps between non-technical end users and telecommunications domain experts in private network environments. We propose a cross-domain query translation framework that leverages specialized language models coordinated through multi-agent reflection-based reasoning. The resulting system addresses three critical challenges: (1) accurately classify user queries related to telecommunications network issues using a dual-stage hierarchical approach, (2) preserve user privacy through the anonymization of semantical","authors_text":"Brigitte Jaumard, Karthikeyan Premkumar, Nguyen Phuc Tran, Salman Memon","cross_cats":[],"headline":"Multi-agent LLM system classifies network queries, anonymizes PII, and translates expert advice for users.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2026-04-14T23:23:46Z","title":"Cross-Domain Query Translation for Network Troubleshooting: A Multi-Agent LLM Framework with Privacy Preservation and Self-Reflection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.13353","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T13:41:22.608740Z","id":"c52b7c4b-b330-40c6-91d2-008d4c18d060","model_set":{"reader":"grok-4.3"},"one_line_summary":"A hierarchical multi-agent LLM framework with self-reflection and semantic-preserving anonymization translates cross-domain queries for network troubleshooting and was evaluated on 10,000 unseen scenarios.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Multi-agent LLM system classifies network queries, anonymizes PII, and translates expert advice for users.","strongest_claim":"The resulting system addresses three critical challenges: (1) accurately classify user queries related to telecommunications network issues using a dual-stage hierarchical approach, (2) preserve user privacy through the anonymization of semantically relevant personally identifiable information (PII) while maintaining diagnostic utility, and (3) translate technical expert responses into user-comprehensible language.","weakest_assumption":"That the proposed semantic-preserving anonymization techniques can simultaneously respect k-anonymity and differential privacy principles while retaining enough diagnostic utility for accurate expert responses, and that the multi-agent self-reflection loop will reliably improve outputs without introducing new errors."}},"verdict_id":"c52b7c4b-b330-40c6-91d2-008d4c18d060"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9bd7f4863522238e15bc26af129e5385a4d0579c4c98a0f4fd2c5949061ad8a6","target":"record","created_at":"2026-05-20T00:04:31Z","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":"b1b791c5ac0601925f9bb432b4a30cfcbaf91621a925ce4f3e33d0bda574feae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2026-04-14T23:23:46Z","title_canon_sha256":"3efb0ec70e100e30f7b6736375e8344e2c4c593551bdd67e5ce39474abe4d8a9"},"schema_version":"1.0","source":{"id":"2604.13353","kind":"arxiv","version":2}},"canonical_sha256":"5831d8929b297f102aa0bb44ad87c9214419dd17fc880625faae6a63efecba1d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5831d8929b297f102aa0bb44ad87c9214419dd17fc880625faae6a63efecba1d","first_computed_at":"2026-05-20T00:04:31.599758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:04:31.599758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kj3nuzFzj1CcGqs2E2UlvlS5ul93c1SFSsbWEQ+M3DL8BtoQ8kliDHKC12ghV8RwJzOamuBFg9aun928F2tCDA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:04:31.600595Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.13353","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bd7f4863522238e15bc26af129e5385a4d0579c4c98a0f4fd2c5949061ad8a6","sha256:eaeb2a4d602e5df5fd951b62dc6769acd366d0ca435a4cbbedfcd1ed519b5802"],"state_sha256":"2845e017697152834c14b30aac9bec432791d72e56f7ac27cba86e8f5c22181d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oZGrclCqJ5IDeXw5hsprITn8A7EZCma2xwT0rlu0qptck1mjXDsnVPO166PXjgquE+f0TjlbIAhTRONFWRC1Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T00:09:05.717192Z","bundle_sha256":"416798c3fa8d5b1f976aa3533661ec46dd775d9afbc44162917c423201871b7e"}}