{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:6JT3GCAO6EG5YPQ3P55A4ZGIO4","short_pith_number":"pith:6JT3GCAO","canonical_record":{"source":{"id":"2105.11620","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2021-05-25T02:36:13Z","cross_cats_sorted":["cs.HC","cs.NI"],"title_canon_sha256":"e22f3b202d75d5eaa73d4e1f803412988a2747f42627451f556162daad1e1611","abstract_canon_sha256":"5e825cfaad349b60288c9a6c03ee41defb3f447d62b8ebad0876003cf3b43d59"},"schema_version":"1.0"},"canonical_sha256":"f267b3080ef10ddc3e1b7f7a0e64c8770773b11707feff56ae648dfa6c79dc94","source":{"kind":"arxiv","id":"2105.11620","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.11620","created_at":"2026-07-05T04:36:46Z"},{"alias_kind":"arxiv_version","alias_value":"2105.11620v3","created_at":"2026-07-05T04:36:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.11620","created_at":"2026-07-05T04:36:46Z"},{"alias_kind":"pith_short_12","alias_value":"6JT3GCAO6EG5","created_at":"2026-07-05T04:36:46Z"},{"alias_kind":"pith_short_16","alias_value":"6JT3GCAO6EG5YPQ3","created_at":"2026-07-05T04:36:46Z"},{"alias_kind":"pith_short_8","alias_value":"6JT3GCAO","created_at":"2026-07-05T04:36:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:6JT3GCAO6EG5YPQ3P55A4ZGIO4","target":"record","payload":{"canonical_record":{"source":{"id":"2105.11620","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2021-05-25T02:36:13Z","cross_cats_sorted":["cs.HC","cs.NI"],"title_canon_sha256":"e22f3b202d75d5eaa73d4e1f803412988a2747f42627451f556162daad1e1611","abstract_canon_sha256":"5e825cfaad349b60288c9a6c03ee41defb3f447d62b8ebad0876003cf3b43d59"},"schema_version":"1.0"},"canonical_sha256":"f267b3080ef10ddc3e1b7f7a0e64c8770773b11707feff56ae648dfa6c79dc94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:36:46.007751Z","signature_b64":"9377d/6imVL5Y8qpvZWZpGsaLqCLX6x6JieUBL79p5/sCK6ZCosExgZqT6qmX8ui1TDeBI4zRyiQULL1XST+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f267b3080ef10ddc3e1b7f7a0e64c8770773b11707feff56ae648dfa6c79dc94","last_reissued_at":"2026-07-05T04:36:46.007347Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:36:46.007347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2105.11620","source_version":3,"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-05T04:36:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"85RZ/F6e7zAZKso+qClZhguSOAtuL4ldHzMXn8PFZZXO0v3BYixLaq4VaQB/crxN6j9pKyZ0oHj1Kfwd9AwzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T09:21:51.794234Z"},"content_sha256":"c2370fe4e3fc49b966b25813d5430ab05acd30e77308e2bca7fd631cbcf19ff1","schema_version":"1.0","event_id":"sha256:c2370fe4e3fc49b966b25813d5430ab05acd30e77308e2bca7fd631cbcf19ff1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:6JT3GCAO6EG5YPQ3P55A4ZGIO4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Comparative Synthesis: Learning Near-Optimal Network Designs by Query","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.HC","cs.NI"],"primary_cat":"cs.PL","authors_text":"Chuan Jiang, Sanjay G. Rao, Xiaokang Qiu, Yanjun Wang, Zixuan Li","submitted_at":"2021-05-25T02:36:13Z","abstract_excerpt":"When managing wide-area networks, network architects must decide how to balance multiple conflicting metrics, and ensure fair allocations to competing traffic while prioritizing critical traffic. The state of practice poses challenges since architects must precisely encode their intent into formal optimization models using abstract notions such as utility functions, and ad-hoc manually tuned knobs. In this paper, we present the first effort to synthesize optimal network designs with indeterminate objectives using an interactive program-synthesis-based approach. We make three contributions. Fir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.11620","kind":"arxiv","version":3},"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/2105.11620/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-05T04:36:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8KR7AuH7fZwXuVElC5/LnE/rJcIs/ME/aWFap1EoprjtB2JIWM57eYkBUOYJG4tC9VB8dGHPrMa+bu7lRK72CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T09:21:51.794926Z"},"content_sha256":"29ae152537e8fe9a37e59bd273af9bfe3286d51cae8c100002302507246f0337","schema_version":"1.0","event_id":"sha256:29ae152537e8fe9a37e59bd273af9bfe3286d51cae8c100002302507246f0337"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6JT3GCAO6EG5YPQ3P55A4ZGIO4/bundle.json","state_url":"https://pith.science/pith/6JT3GCAO6EG5YPQ3P55A4ZGIO4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6JT3GCAO6EG5YPQ3P55A4ZGIO4/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-04T09:21:51Z","links":{"resolver":"https://pith.science/pith/6JT3GCAO6EG5YPQ3P55A4ZGIO4","bundle":"https://pith.science/pith/6JT3GCAO6EG5YPQ3P55A4ZGIO4/bundle.json","state":"https://pith.science/pith/6JT3GCAO6EG5YPQ3P55A4ZGIO4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6JT3GCAO6EG5YPQ3P55A4ZGIO4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:6JT3GCAO6EG5YPQ3P55A4ZGIO4","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":"5e825cfaad349b60288c9a6c03ee41defb3f447d62b8ebad0876003cf3b43d59","cross_cats_sorted":["cs.HC","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2021-05-25T02:36:13Z","title_canon_sha256":"e22f3b202d75d5eaa73d4e1f803412988a2747f42627451f556162daad1e1611"},"schema_version":"1.0","source":{"id":"2105.11620","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.11620","created_at":"2026-07-05T04:36:46Z"},{"alias_kind":"arxiv_version","alias_value":"2105.11620v3","created_at":"2026-07-05T04:36:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.11620","created_at":"2026-07-05T04:36:46Z"},{"alias_kind":"pith_short_12","alias_value":"6JT3GCAO6EG5","created_at":"2026-07-05T04:36:46Z"},{"alias_kind":"pith_short_16","alias_value":"6JT3GCAO6EG5YPQ3","created_at":"2026-07-05T04:36:46Z"},{"alias_kind":"pith_short_8","alias_value":"6JT3GCAO","created_at":"2026-07-05T04:36:46Z"}],"graph_snapshots":[{"event_id":"sha256:29ae152537e8fe9a37e59bd273af9bfe3286d51cae8c100002302507246f0337","target":"graph","created_at":"2026-07-05T04:36:46Z","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/2105.11620/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"When managing wide-area networks, network architects must decide how to balance multiple conflicting metrics, and ensure fair allocations to competing traffic while prioritizing critical traffic. The state of practice poses challenges since architects must precisely encode their intent into formal optimization models using abstract notions such as utility functions, and ad-hoc manually tuned knobs. In this paper, we present the first effort to synthesize optimal network designs with indeterminate objectives using an interactive program-synthesis-based approach. We make three contributions. Fir","authors_text":"Chuan Jiang, Sanjay G. Rao, Xiaokang Qiu, Yanjun Wang, Zixuan Li","cross_cats":["cs.HC","cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2021-05-25T02:36:13Z","title":"Comparative Synthesis: Learning Near-Optimal Network Designs by Query"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.11620","kind":"arxiv","version":3},"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:c2370fe4e3fc49b966b25813d5430ab05acd30e77308e2bca7fd631cbcf19ff1","target":"record","created_at":"2026-07-05T04:36:46Z","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":"5e825cfaad349b60288c9a6c03ee41defb3f447d62b8ebad0876003cf3b43d59","cross_cats_sorted":["cs.HC","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2021-05-25T02:36:13Z","title_canon_sha256":"e22f3b202d75d5eaa73d4e1f803412988a2747f42627451f556162daad1e1611"},"schema_version":"1.0","source":{"id":"2105.11620","kind":"arxiv","version":3}},"canonical_sha256":"f267b3080ef10ddc3e1b7f7a0e64c8770773b11707feff56ae648dfa6c79dc94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f267b3080ef10ddc3e1b7f7a0e64c8770773b11707feff56ae648dfa6c79dc94","first_computed_at":"2026-07-05T04:36:46.007347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:36:46.007347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9377d/6imVL5Y8qpvZWZpGsaLqCLX6x6JieUBL79p5/sCK6ZCosExgZqT6qmX8ui1TDeBI4zRyiQULL1XST+Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:36:46.007751Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.11620","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2370fe4e3fc49b966b25813d5430ab05acd30e77308e2bca7fd631cbcf19ff1","sha256:29ae152537e8fe9a37e59bd273af9bfe3286d51cae8c100002302507246f0337"],"state_sha256":"0218450c2d75fc0321d9b369c2bc983dab90737c700ff2dc8be100c8a2c9ea2b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oAonGzAuBhn9bbC1WXnhbKXR4VYhygcBlzoOLHKm56d0vqUUjvPHaF14mW0q1Ui+YWA1GUSOb7FhTVsql8U5Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T09:21:51.801644Z","bundle_sha256":"ae9bf584ac943695699241e03c2267a87c083cc7719a6346a38e9bf1864ca7fb"}}