{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:UFBAJUVNAGDGNPPGBG2EISSHEB","short_pith_number":"pith:UFBAJUVN","canonical_record":{"source":{"id":"2605.15550","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NI","submitted_at":"2026-05-15T02:43:35Z","cross_cats_sorted":[],"title_canon_sha256":"4eaa7865c3135d478544c887c042f9e8e4ac50d5adb622682cbf8440ea4721db","abstract_canon_sha256":"9a7985d4187e1ffab0cc87b54d2feefebb6f35507131fd80c609ec72fc36ef4a"},"schema_version":"1.0"},"canonical_sha256":"a14204d2ad018666bde609b4444a472046d34b00f3b7c4cf2e0d2843a43366a9","source":{"kind":"arxiv","id":"2605.15550","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15550","created_at":"2026-05-20T00:01:04Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15550v1","created_at":"2026-05-20T00:01:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15550","created_at":"2026-05-20T00:01:04Z"},{"alias_kind":"pith_short_12","alias_value":"UFBAJUVNAGDG","created_at":"2026-05-20T00:01:04Z"},{"alias_kind":"pith_short_16","alias_value":"UFBAJUVNAGDGNPPG","created_at":"2026-05-20T00:01:04Z"},{"alias_kind":"pith_short_8","alias_value":"UFBAJUVN","created_at":"2026-05-20T00:01:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:UFBAJUVNAGDGNPPGBG2EISSHEB","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15550","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NI","submitted_at":"2026-05-15T02:43:35Z","cross_cats_sorted":[],"title_canon_sha256":"4eaa7865c3135d478544c887c042f9e8e4ac50d5adb622682cbf8440ea4721db","abstract_canon_sha256":"9a7985d4187e1ffab0cc87b54d2feefebb6f35507131fd80c609ec72fc36ef4a"},"schema_version":"1.0"},"canonical_sha256":"a14204d2ad018666bde609b4444a472046d34b00f3b7c4cf2e0d2843a43366a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:04.906832Z","signature_b64":"Mq3NU1s5LA1f2G5qFn2d3NFRW65+OY2+d3UwG5xmWwEe1QiSAEurtC0NckHEGguG9qKr0404fkTXeUSqru+nCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a14204d2ad018666bde609b4444a472046d34b00f3b7c4cf2e0d2843a43366a9","last_reissued_at":"2026-05-20T00:01:04.905842Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:04.905842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15550","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-05-20T00:01:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CgEgUX/77iWOwGd43wuepXwkCw8+/OcPBRD/II0R4K7FTqPKiDajftMuNxx7SUubSSYsOeLFaAfKcwHYjkzuAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T06:21:15.131815Z"},"content_sha256":"f7089d3063f0e186f611fb632dd05dde9a7c1890f7f48535d5ded8ed2164551f","schema_version":"1.0","event_id":"sha256:f7089d3063f0e186f611fb632dd05dde9a7c1890f7f48535d5ded8ed2164551f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:UFBAJUVNAGDGNPPGBG2EISSHEB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TG-DIN: Theory-Guided Demand Inference Network for Generalizable QoS Measurement and Prediction","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"A neural network infers latent user demand from QoS measurements by embedding scheduling and queuing rules as a differentiable theory layer.","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Feng Ye, Fuliang Yang","submitted_at":"2026-05-15T02:43:35Z","abstract_excerpt":"In this paper, we introduce TG-DIN, a theory-guided demand inference network that infers latent user demand from observable network quality-of-service (QoS) measurements. Rather than directly predicting QoS outcomes using black-box models, TG-DIN explicitly models latent demand as an intermediate variable and links it to observable behavior through a differentiable theory layer grounded in scheduling and queuing principles. This design yields an interpretable, mechanism-consistent representation of user demand that is directly applicable to downstream tasks such as congestion diagnosis, resour"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"TG-DIN explicitly models latent demand as an intermediate variable and links it to observable behavior through a differentiable theory layer grounded in scheduling and queuing principles. This design yields an interpretable, mechanism-consistent representation of user demand that is directly applicable to downstream tasks such as congestion diagnosis, resource allocation, capacity planning, and policy evaluation.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The differentiable theory layer grounded in scheduling and queuing principles accurately captures the real mechanisms that connect latent demand to observable QoS measurements in both synthetic and real network settings.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A neural network with a theory-guided differentiable layer infers hidden demand from QoS data for improved generalization across network conditions.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A neural network infers latent user demand from QoS measurements by embedding scheduling and queuing rules as a differentiable theory layer.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9f574ea45df3d2dc8be784fa1b4532c244a9ff93b658576b07a3eb86c24bc685"},"source":{"id":"2605.15550","kind":"arxiv","version":1},"verdict":{"id":"66211b20-5244-464b-ae19-ba4de4b85ade","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T20:00:27.183811Z","strongest_claim":"TG-DIN explicitly models latent demand as an intermediate variable and links it to observable behavior through a differentiable theory layer grounded in scheduling and queuing principles. This design yields an interpretable, mechanism-consistent representation of user demand that is directly applicable to downstream tasks such as congestion diagnosis, resource allocation, capacity planning, and policy evaluation.","one_line_summary":"A neural network with a theory-guided differentiable layer infers hidden demand from QoS data for improved generalization across network conditions.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The differentiable theory layer grounded in scheduling and queuing principles accurately captures the real mechanisms that connect latent demand to observable QoS measurements in both synthetic and real network settings.","pith_extraction_headline":"A neural network infers latent user demand from QoS measurements by embedding scheduling and queuing rules as a differentiable theory layer."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15550/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T20:31:19.247999Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T20:11:05.136658Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T19:34:36.248440Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T17:41:56.095622Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"2432a756a570125f4e23bb311fa14961746913c2151d3f5b48e569a62389d17a"},"references":{"count":37,"sample":[{"doi":"","year":2024,"title":"Abd AlRhman AlQiam, Yuanjun Yao, Zhaodong Wang, Satyajeet Singh Ahuja, Ying Zhang, Sanjay G Rao, Bruno Ribeiro, and Mohit Tawarmalani. 2024. Transfer- able neural wan te for changing topologies. InPro","work_id":"047b0172-6f23-4e8a-8363-7a39909bbf87","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/3474369.3486864","year":2021,"title":"A Framework for Cluster and Classifier Evaluation in the Absence of Reference Labels","work_id":"6df709d4-7cfe-42f0-bb44-c109010b2812","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Ons Aouedi, Van An Le, Kandaraj Piamrat, and Yusheng Ji. 2025. Deep learning on network traffic prediction: Recent advances, analysis, and future directions. ACM computing surveys57, 6 (2025), 1–37","work_id":"12866cd4-9c5a-4f12-897f-4b8d31ef3b7e","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"Athula Balachandran, Vyas Sekar, Aditya Akella, Srinivasan Seshan, Ion Stoica, and Hui Zhang. 2013. Developing a predictive model of quality of experience for internet video.ACM SIGCOMM Computer Commu","work_id":"4d28ad23-ee1b-4dbd-991f-3b3ea779c65f","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2000,"title":"Giuseppe Bianchi. 2000. Performance analysis of the IEEE 802.11 distributed coordination function.IEEE Journal on Selected Areas in Communications18, 3 (2000), 535–547","work_id":"9626a8a5-b469-4bcd-b748-7163091ce394","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":37,"snapshot_sha256":"f782941b739f50e7d3621e770b1c526a08b156a662cc5a2bf84d1ac4c0440aa1","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":"66211b20-5244-464b-ae19-ba4de4b85ade"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:01:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6PiiQnf6fs7zq9RXgzmzJc80NeDKlvGblI8iVMi85DfpFZZejzVqN2qsrIXKJP5MUyzVei/E+27kuSqcIN92AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T06:21:15.133090Z"},"content_sha256":"3f7f83d3fc91ed303c22040e988ef5921e8a47b911765b5d4412be462bd3f67f","schema_version":"1.0","event_id":"sha256:3f7f83d3fc91ed303c22040e988ef5921e8a47b911765b5d4412be462bd3f67f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UFBAJUVNAGDGNPPGBG2EISSHEB/bundle.json","state_url":"https://pith.science/pith/UFBAJUVNAGDGNPPGBG2EISSHEB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UFBAJUVNAGDGNPPGBG2EISSHEB/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-05-22T06:21:15Z","links":{"resolver":"https://pith.science/pith/UFBAJUVNAGDGNPPGBG2EISSHEB","bundle":"https://pith.science/pith/UFBAJUVNAGDGNPPGBG2EISSHEB/bundle.json","state":"https://pith.science/pith/UFBAJUVNAGDGNPPGBG2EISSHEB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UFBAJUVNAGDGNPPGBG2EISSHEB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UFBAJUVNAGDGNPPGBG2EISSHEB","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":"9a7985d4187e1ffab0cc87b54d2feefebb6f35507131fd80c609ec72fc36ef4a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NI","submitted_at":"2026-05-15T02:43:35Z","title_canon_sha256":"4eaa7865c3135d478544c887c042f9e8e4ac50d5adb622682cbf8440ea4721db"},"schema_version":"1.0","source":{"id":"2605.15550","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15550","created_at":"2026-05-20T00:01:04Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15550v1","created_at":"2026-05-20T00:01:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15550","created_at":"2026-05-20T00:01:04Z"},{"alias_kind":"pith_short_12","alias_value":"UFBAJUVNAGDG","created_at":"2026-05-20T00:01:04Z"},{"alias_kind":"pith_short_16","alias_value":"UFBAJUVNAGDGNPPG","created_at":"2026-05-20T00:01:04Z"},{"alias_kind":"pith_short_8","alias_value":"UFBAJUVN","created_at":"2026-05-20T00:01:04Z"}],"graph_snapshots":[{"event_id":"sha256:3f7f83d3fc91ed303c22040e988ef5921e8a47b911765b5d4412be462bd3f67f","target":"graph","created_at":"2026-05-20T00:01:04Z","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":"TG-DIN explicitly models latent demand as an intermediate variable and links it to observable behavior through a differentiable theory layer grounded in scheduling and queuing principles. This design yields an interpretable, mechanism-consistent representation of user demand that is directly applicable to downstream tasks such as congestion diagnosis, resource allocation, capacity planning, and policy evaluation."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The differentiable theory layer grounded in scheduling and queuing principles accurately captures the real mechanisms that connect latent demand to observable QoS measurements in both synthetic and real network settings."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A neural network with a theory-guided differentiable layer infers hidden demand from QoS data for improved generalization across network conditions."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A neural network infers latent user demand from QoS measurements by embedding scheduling and queuing rules as a differentiable theory layer."}],"snapshot_sha256":"9f574ea45df3d2dc8be784fa1b4532c244a9ff93b658576b07a3eb86c24bc685"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T20:31:19.247999Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T20:11:05.136658Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T19:34:36.248440Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T17:41:56.095622Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.15550/integrity.json","findings":[],"snapshot_sha256":"2432a756a570125f4e23bb311fa14961746913c2151d3f5b48e569a62389d17a","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we introduce TG-DIN, a theory-guided demand inference network that infers latent user demand from observable network quality-of-service (QoS) measurements. Rather than directly predicting QoS outcomes using black-box models, TG-DIN explicitly models latent demand as an intermediate variable and links it to observable behavior through a differentiable theory layer grounded in scheduling and queuing principles. This design yields an interpretable, mechanism-consistent representation of user demand that is directly applicable to downstream tasks such as congestion diagnosis, resour","authors_text":"Feng Ye, Fuliang Yang","cross_cats":[],"headline":"A neural network infers latent user demand from QoS measurements by embedding scheduling and queuing rules as a differentiable theory layer.","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NI","submitted_at":"2026-05-15T02:43:35Z","title":"TG-DIN: Theory-Guided Demand Inference Network for Generalizable QoS Measurement and Prediction"},"references":{"count":37,"internal_anchors":0,"resolved_work":37,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Abd AlRhman AlQiam, Yuanjun Yao, Zhaodong Wang, Satyajeet Singh Ahuja, Ying Zhang, Sanjay G Rao, Bruno Ribeiro, and Mohit Tawarmalani. 2024. Transfer- able neural wan te for changing topologies. InPro","work_id":"047b0172-6f23-4e8a-8363-7a39909bbf87","year":2024},{"cited_arxiv_id":"","doi":"10.1145/3474369.3486864","is_internal_anchor":false,"ref_index":2,"title":"A Framework for Cluster and Classifier Evaluation in the Absence of Reference Labels","work_id":"6df709d4-7cfe-42f0-bb44-c109010b2812","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Ons Aouedi, Van An Le, Kandaraj Piamrat, and Yusheng Ji. 2025. Deep learning on network traffic prediction: Recent advances, analysis, and future directions. ACM computing surveys57, 6 (2025), 1–37","work_id":"12866cd4-9c5a-4f12-897f-4b8d31ef3b7e","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Athula Balachandran, Vyas Sekar, Aditya Akella, Srinivasan Seshan, Ion Stoica, and Hui Zhang. 2013. Developing a predictive model of quality of experience for internet video.ACM SIGCOMM Computer Commu","work_id":"4d28ad23-ee1b-4dbd-991f-3b3ea779c65f","year":2013},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Giuseppe Bianchi. 2000. Performance analysis of the IEEE 802.11 distributed coordination function.IEEE Journal on Selected Areas in Communications18, 3 (2000), 535–547","work_id":"9626a8a5-b469-4bcd-b748-7163091ce394","year":2000}],"snapshot_sha256":"f782941b739f50e7d3621e770b1c526a08b156a662cc5a2bf84d1ac4c0440aa1"},"source":{"id":"2605.15550","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T20:00:27.183811Z","id":"66211b20-5244-464b-ae19-ba4de4b85ade","model_set":{"reader":"grok-4.3"},"one_line_summary":"A neural network with a theory-guided differentiable layer infers hidden demand from QoS data for improved generalization across network conditions.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A neural network infers latent user demand from QoS measurements by embedding scheduling and queuing rules as a differentiable theory layer.","strongest_claim":"TG-DIN explicitly models latent demand as an intermediate variable and links it to observable behavior through a differentiable theory layer grounded in scheduling and queuing principles. This design yields an interpretable, mechanism-consistent representation of user demand that is directly applicable to downstream tasks such as congestion diagnosis, resource allocation, capacity planning, and policy evaluation.","weakest_assumption":"The differentiable theory layer grounded in scheduling and queuing principles accurately captures the real mechanisms that connect latent demand to observable QoS measurements in both synthetic and real network settings."}},"verdict_id":"66211b20-5244-464b-ae19-ba4de4b85ade"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f7089d3063f0e186f611fb632dd05dde9a7c1890f7f48535d5ded8ed2164551f","target":"record","created_at":"2026-05-20T00:01:04Z","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":"9a7985d4187e1ffab0cc87b54d2feefebb6f35507131fd80c609ec72fc36ef4a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.NI","submitted_at":"2026-05-15T02:43:35Z","title_canon_sha256":"4eaa7865c3135d478544c887c042f9e8e4ac50d5adb622682cbf8440ea4721db"},"schema_version":"1.0","source":{"id":"2605.15550","kind":"arxiv","version":1}},"canonical_sha256":"a14204d2ad018666bde609b4444a472046d34b00f3b7c4cf2e0d2843a43366a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a14204d2ad018666bde609b4444a472046d34b00f3b7c4cf2e0d2843a43366a9","first_computed_at":"2026-05-20T00:01:04.905842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:04.905842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mq3NU1s5LA1f2G5qFn2d3NFRW65+OY2+d3UwG5xmWwEe1QiSAEurtC0NckHEGguG9qKr0404fkTXeUSqru+nCg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:04.906832Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15550","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7089d3063f0e186f611fb632dd05dde9a7c1890f7f48535d5ded8ed2164551f","sha256:3f7f83d3fc91ed303c22040e988ef5921e8a47b911765b5d4412be462bd3f67f"],"state_sha256":"1a0a3d32dc6bb334af77ad7e2df7d03f4ec8616b658680b9139da166d673dddb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gkcit9p+jpEEaovXfl0qLUYQuyfPogddKhuC0CFvQ/CsNNOeGVxqbhraqGZqyCu5XVYJW6nG3tZ5xPqs1sT7Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T06:21:15.137384Z","bundle_sha256":"05266e6d77dafbe659f6f5eced7e01a9f0ad6bb052bb7717a2c03d1add8a9c68"}}