{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:PSTQOO4DZQ3SO64ZDXZ3DBWOUD","short_pith_number":"pith:PSTQOO4D","canonical_record":{"source":{"id":"cond-mat/0508152","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cond-mat.other","submitted_at":"2005-08-05T15:53:05Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6b2146f36b9fe82a4414333d29d7a735292699ffca7e41ab34b460dd28f0f78c","abstract_canon_sha256":"2958d8ee8ce0b8967aae84e46b2a66596ae5a9844d36b1c415150e0a04f2cdb0"},"schema_version":"1.0"},"canonical_sha256":"7ca7073b83cc37277b991df3b186cea0e2e7546109f50fe5fba48daedfec35a2","source":{"kind":"arxiv","id":"cond-mat/0508152","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cond-mat/0508152","created_at":"2026-07-04T14:22:29Z"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/0508152v1","created_at":"2026-07-04T14:22:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/0508152","created_at":"2026-07-04T14:22:29Z"},{"alias_kind":"pith_short_12","alias_value":"PSTQOO4DZQ3S","created_at":"2026-07-04T14:22:29Z"},{"alias_kind":"pith_short_16","alias_value":"PSTQOO4DZQ3SO64Z","created_at":"2026-07-04T14:22:29Z"},{"alias_kind":"pith_short_8","alias_value":"PSTQOO4D","created_at":"2026-07-04T14:22:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:PSTQOO4DZQ3SO64ZDXZ3DBWOUD","target":"record","payload":{"canonical_record":{"source":{"id":"cond-mat/0508152","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cond-mat.other","submitted_at":"2005-08-05T15:53:05Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6b2146f36b9fe82a4414333d29d7a735292699ffca7e41ab34b460dd28f0f78c","abstract_canon_sha256":"2958d8ee8ce0b8967aae84e46b2a66596ae5a9844d36b1c415150e0a04f2cdb0"},"schema_version":"1.0"},"canonical_sha256":"7ca7073b83cc37277b991df3b186cea0e2e7546109f50fe5fba48daedfec35a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:22:29.801707Z","signature_b64":"3tuRe5iXyyfsyG4eEPTVUurNJoUsWk8/w9yvWSbewtILM6XKJhXP9LwqdmLoEE0i75lKtuB9XPdEvqDfiJaHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ca7073b83cc37277b991df3b186cea0e2e7546109f50fe5fba48daedfec35a2","last_reissued_at":"2026-07-04T14:22:29.801326Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:22:29.801326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cond-mat/0508152","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-04T14:22:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rvzEzOssdi1T1L5nBTUhVgHtuy++Iz8s7QPw2toWAKRAbiEfIOydGeLG2OVGOrFTNORZd+hTsz8Wu4H6Ww3oBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T01:43:00.771205Z"},"content_sha256":"cf38712779543c1916946113566e2fe78e1cc5941e9ef5335ca00fa02aa999b2","schema_version":"1.0","event_id":"sha256:cf38712779543c1916946113566e2fe78e1cc5941e9ef5335ca00fa02aa999b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:PSTQOO4DZQ3SO64ZDXZ3DBWOUD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Universal Scaling Theory for Complexity of Analog Computation","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"cond-mat.other","authors_text":"Joshua Feinberg, Shmuel Fishman, Yaniv S. Avizrats","submitted_at":"2005-08-05T15:53:05Z","abstract_excerpt":"We discuss the computational complexity of solving linear programming problems by means of an analog computer. The latter is modeled by a dynamical system which converges to the optimal vertex solution. We analyze various probability ensembles of linear programming problems. For each one of these we obtain numerically the probability distribution functions of certain quantities which measure the complexity. Remarkably, in the asymptotic limit of very large problems, each of these probability distribution functions reduces to a universal scaling function, depending on a single scaling variable "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/0508152","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/cond-mat/0508152/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-04T14:22:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ROTxmIKxqH8t42eGeP5bfAdeS2YNlQUTCIj6gwU8ZfSSdWLFqk00J8oY3NLio3DI0wHu+t1QUZEC7+1uorJdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T01:43:00.771577Z"},"content_sha256":"e0d09aac81261086c9b87d79c6f540e2e18af291bbd42d55db0769a20931142a","schema_version":"1.0","event_id":"sha256:e0d09aac81261086c9b87d79c6f540e2e18af291bbd42d55db0769a20931142a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PSTQOO4DZQ3SO64ZDXZ3DBWOUD/bundle.json","state_url":"https://pith.science/pith/PSTQOO4DZQ3SO64ZDXZ3DBWOUD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PSTQOO4DZQ3SO64ZDXZ3DBWOUD/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-07T01:43:00Z","links":{"resolver":"https://pith.science/pith/PSTQOO4DZQ3SO64ZDXZ3DBWOUD","bundle":"https://pith.science/pith/PSTQOO4DZQ3SO64ZDXZ3DBWOUD/bundle.json","state":"https://pith.science/pith/PSTQOO4DZQ3SO64ZDXZ3DBWOUD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PSTQOO4DZQ3SO64ZDXZ3DBWOUD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:PSTQOO4DZQ3SO64ZDXZ3DBWOUD","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":"2958d8ee8ce0b8967aae84e46b2a66596ae5a9844d36b1c415150e0a04f2cdb0","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"cond-mat.other","submitted_at":"2005-08-05T15:53:05Z","title_canon_sha256":"6b2146f36b9fe82a4414333d29d7a735292699ffca7e41ab34b460dd28f0f78c"},"schema_version":"1.0","source":{"id":"cond-mat/0508152","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cond-mat/0508152","created_at":"2026-07-04T14:22:29Z"},{"alias_kind":"arxiv_version","alias_value":"cond-mat/0508152v1","created_at":"2026-07-04T14:22:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cond-mat/0508152","created_at":"2026-07-04T14:22:29Z"},{"alias_kind":"pith_short_12","alias_value":"PSTQOO4DZQ3S","created_at":"2026-07-04T14:22:29Z"},{"alias_kind":"pith_short_16","alias_value":"PSTQOO4DZQ3SO64Z","created_at":"2026-07-04T14:22:29Z"},{"alias_kind":"pith_short_8","alias_value":"PSTQOO4D","created_at":"2026-07-04T14:22:29Z"}],"graph_snapshots":[{"event_id":"sha256:e0d09aac81261086c9b87d79c6f540e2e18af291bbd42d55db0769a20931142a","target":"graph","created_at":"2026-07-04T14:22:29Z","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/cond-mat/0508152/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We discuss the computational complexity of solving linear programming problems by means of an analog computer. The latter is modeled by a dynamical system which converges to the optimal vertex solution. We analyze various probability ensembles of linear programming problems. For each one of these we obtain numerically the probability distribution functions of certain quantities which measure the complexity. Remarkably, in the asymptotic limit of very large problems, each of these probability distribution functions reduces to a universal scaling function, depending on a single scaling variable ","authors_text":"Joshua Feinberg, Shmuel Fishman, Yaniv S. Avizrats","cross_cats":["cs.CC"],"headline":"","license":"","primary_cat":"cond-mat.other","submitted_at":"2005-08-05T15:53:05Z","title":"A Universal Scaling Theory for Complexity of Analog Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cond-mat/0508152","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:cf38712779543c1916946113566e2fe78e1cc5941e9ef5335ca00fa02aa999b2","target":"record","created_at":"2026-07-04T14:22:29Z","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":"2958d8ee8ce0b8967aae84e46b2a66596ae5a9844d36b1c415150e0a04f2cdb0","cross_cats_sorted":["cs.CC"],"license":"","primary_cat":"cond-mat.other","submitted_at":"2005-08-05T15:53:05Z","title_canon_sha256":"6b2146f36b9fe82a4414333d29d7a735292699ffca7e41ab34b460dd28f0f78c"},"schema_version":"1.0","source":{"id":"cond-mat/0508152","kind":"arxiv","version":1}},"canonical_sha256":"7ca7073b83cc37277b991df3b186cea0e2e7546109f50fe5fba48daedfec35a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ca7073b83cc37277b991df3b186cea0e2e7546109f50fe5fba48daedfec35a2","first_computed_at":"2026-07-04T14:22:29.801326Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:22:29.801326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3tuRe5iXyyfsyG4eEPTVUurNJoUsWk8/w9yvWSbewtILM6XKJhXP9LwqdmLoEE0i75lKtuB9XPdEvqDfiJaHDg==","signature_status":"signed_v1","signed_at":"2026-07-04T14:22:29.801707Z","signed_message":"canonical_sha256_bytes"},"source_id":"cond-mat/0508152","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf38712779543c1916946113566e2fe78e1cc5941e9ef5335ca00fa02aa999b2","sha256:e0d09aac81261086c9b87d79c6f540e2e18af291bbd42d55db0769a20931142a"],"state_sha256":"02c587ba71402d5cbc06c128c37d65ca2a13b55cbd04b316b970102564ea0f72"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K5YsjiX8Ey9uWUr4clOcVN0j/fFAr6AgJZDLJbnysU0MpEmhdXAp+4upF3xR+2D/sgs16gWIx/ux8ahEJcZxAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T01:43:00.773846Z","bundle_sha256":"2630f5916c078dd2b9f64867dd68ba5addbaacd6aef9413a72be53529aa02411"}}