{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:DN5CFSYGZR7QCYJ6JS66ABCHYC","short_pith_number":"pith:DN5CFSYG","canonical_record":{"source":{"id":"2407.16831","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2024-07-23T20:40:37Z","cross_cats_sorted":[],"title_canon_sha256":"bb9a0683fa3718cc1a56b247ed153f23a46638c531589919d17270c317ccdac2","abstract_canon_sha256":"be2255ecf595ced79ac820b4d4caca4984e39bc1657c05e0b28ecab7c9bec1c9"},"schema_version":"1.0"},"canonical_sha256":"1b7a22cb06cc7f01613e4cbde00447c0b7bd9d41105925155705ac04574d688c","source":{"kind":"arxiv","id":"2407.16831","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.16831","created_at":"2026-07-05T08:47:57Z"},{"alias_kind":"arxiv_version","alias_value":"2407.16831v1","created_at":"2026-07-05T08:47:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.16831","created_at":"2026-07-05T08:47:57Z"},{"alias_kind":"pith_short_12","alias_value":"DN5CFSYGZR7Q","created_at":"2026-07-05T08:47:57Z"},{"alias_kind":"pith_short_16","alias_value":"DN5CFSYGZR7QCYJ6","created_at":"2026-07-05T08:47:57Z"},{"alias_kind":"pith_short_8","alias_value":"DN5CFSYG","created_at":"2026-07-05T08:47:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:DN5CFSYGZR7QCYJ6JS66ABCHYC","target":"record","payload":{"canonical_record":{"source":{"id":"2407.16831","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2024-07-23T20:40:37Z","cross_cats_sorted":[],"title_canon_sha256":"bb9a0683fa3718cc1a56b247ed153f23a46638c531589919d17270c317ccdac2","abstract_canon_sha256":"be2255ecf595ced79ac820b4d4caca4984e39bc1657c05e0b28ecab7c9bec1c9"},"schema_version":"1.0"},"canonical_sha256":"1b7a22cb06cc7f01613e4cbde00447c0b7bd9d41105925155705ac04574d688c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:47:57.176230Z","signature_b64":"ih7om6am51ihVG0pbFBDLsKJqlrCanunqSSzQervUCgkFXnS7dXJpzIrrFQbGtM4xn+dhAkdHCCEpD2va3mUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b7a22cb06cc7f01613e4cbde00447c0b7bd9d41105925155705ac04574d688c","last_reissued_at":"2026-07-05T08:47:57.175733Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:47:57.175733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.16831","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-05T08:47:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VKez99hUYPGODTIuR5qTZno2NCY8QQgdkw382RptWYTaYharfUTIR0VaRrdTvUqrtxx8Pi4ALXpZiCLzqSIeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T22:57:57.031585Z"},"content_sha256":"2f029239f27de5bd03b127a6cae708dc0832cce0be728075e87f746933f525df","schema_version":"1.0","event_id":"sha256:2f029239f27de5bd03b127a6cae708dc0832cce0be728075e87f746933f525df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:DN5CFSYGZR7QCYJ6JS66ABCHYC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Networks of Networks: Complexity Class Principles Applied to Compound AI Systems Design","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Boris Hanin, Ion Stoica, Jared Quincy Davis, Lingjiao Chen, Matei Zaharia, Peter Bailis","submitted_at":"2024-07-23T20:40:37Z","abstract_excerpt":"As practitioners seek to surpass the current reliability and quality frontier of monolithic models, Compound AI Systems consisting of many language model inference calls are increasingly employed. In this work, we construct systems, which we call Networks of Networks (NoNs) organized around the distinction between generating a proposed answer and verifying its correctness, a fundamental concept in complexity theory that we show empirically extends to Language Models (LMs). We introduce a verifier-based judge NoN with K generators, an instantiation of \"best-of-K\" or \"judge-based\" compound AI sy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.16831","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/2407.16831/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-05T08:47:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FN1/mNQb1s+kN0rdHLmDIhazoQu75etf55WtGDwmCB6XyEdoEYxT8mQQw4IWsf9MDATyUzDpn1ivoMffvll7DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T22:57:57.032493Z"},"content_sha256":"e40289e6b0d18ebe85521087264c80a798e677b0652eaa3f8f1c65148103b110","schema_version":"1.0","event_id":"sha256:e40289e6b0d18ebe85521087264c80a798e677b0652eaa3f8f1c65148103b110"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DN5CFSYGZR7QCYJ6JS66ABCHYC/bundle.json","state_url":"https://pith.science/pith/DN5CFSYGZR7QCYJ6JS66ABCHYC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DN5CFSYGZR7QCYJ6JS66ABCHYC/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-04T22:57:57Z","links":{"resolver":"https://pith.science/pith/DN5CFSYGZR7QCYJ6JS66ABCHYC","bundle":"https://pith.science/pith/DN5CFSYGZR7QCYJ6JS66ABCHYC/bundle.json","state":"https://pith.science/pith/DN5CFSYGZR7QCYJ6JS66ABCHYC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DN5CFSYGZR7QCYJ6JS66ABCHYC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DN5CFSYGZR7QCYJ6JS66ABCHYC","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":"be2255ecf595ced79ac820b4d4caca4984e39bc1657c05e0b28ecab7c9bec1c9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2024-07-23T20:40:37Z","title_canon_sha256":"bb9a0683fa3718cc1a56b247ed153f23a46638c531589919d17270c317ccdac2"},"schema_version":"1.0","source":{"id":"2407.16831","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.16831","created_at":"2026-07-05T08:47:57Z"},{"alias_kind":"arxiv_version","alias_value":"2407.16831v1","created_at":"2026-07-05T08:47:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.16831","created_at":"2026-07-05T08:47:57Z"},{"alias_kind":"pith_short_12","alias_value":"DN5CFSYGZR7Q","created_at":"2026-07-05T08:47:57Z"},{"alias_kind":"pith_short_16","alias_value":"DN5CFSYGZR7QCYJ6","created_at":"2026-07-05T08:47:57Z"},{"alias_kind":"pith_short_8","alias_value":"DN5CFSYG","created_at":"2026-07-05T08:47:57Z"}],"graph_snapshots":[{"event_id":"sha256:e40289e6b0d18ebe85521087264c80a798e677b0652eaa3f8f1c65148103b110","target":"graph","created_at":"2026-07-05T08:47:57Z","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/2407.16831/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"As practitioners seek to surpass the current reliability and quality frontier of monolithic models, Compound AI Systems consisting of many language model inference calls are increasingly employed. In this work, we construct systems, which we call Networks of Networks (NoNs) organized around the distinction between generating a proposed answer and verifying its correctness, a fundamental concept in complexity theory that we show empirically extends to Language Models (LMs). We introduce a verifier-based judge NoN with K generators, an instantiation of \"best-of-K\" or \"judge-based\" compound AI sy","authors_text":"Boris Hanin, Ion Stoica, Jared Quincy Davis, Lingjiao Chen, Matei Zaharia, Peter Bailis","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2024-07-23T20:40:37Z","title":"Networks of Networks: Complexity Class Principles Applied to Compound AI Systems Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.16831","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:2f029239f27de5bd03b127a6cae708dc0832cce0be728075e87f746933f525df","target":"record","created_at":"2026-07-05T08:47:57Z","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":"be2255ecf595ced79ac820b4d4caca4984e39bc1657c05e0b28ecab7c9bec1c9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2024-07-23T20:40:37Z","title_canon_sha256":"bb9a0683fa3718cc1a56b247ed153f23a46638c531589919d17270c317ccdac2"},"schema_version":"1.0","source":{"id":"2407.16831","kind":"arxiv","version":1}},"canonical_sha256":"1b7a22cb06cc7f01613e4cbde00447c0b7bd9d41105925155705ac04574d688c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b7a22cb06cc7f01613e4cbde00447c0b7bd9d41105925155705ac04574d688c","first_computed_at":"2026-07-05T08:47:57.175733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:47:57.175733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ih7om6am51ihVG0pbFBDLsKJqlrCanunqSSzQervUCgkFXnS7dXJpzIrrFQbGtM4xn+dhAkdHCCEpD2va3mUBA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:47:57.176230Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.16831","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f029239f27de5bd03b127a6cae708dc0832cce0be728075e87f746933f525df","sha256:e40289e6b0d18ebe85521087264c80a798e677b0652eaa3f8f1c65148103b110"],"state_sha256":"1435bfbce5bf4f0c676ffe8d78ee484aa02a9594efb265018ee8f95f644c81d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rshai8gtMvIn1sXmDQfH/WpjahS10g+6bb1IeuMwWoVqzQQbhm0ccoT4YiNTekSi2qAswVkN80OUfL1EKck8CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T22:57:57.037822Z","bundle_sha256":"a6d560d29c05791fb3946a353316e78ecfb11ab08f6d3e5f1690970032bb3904"}}