{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XMVL3ZBXYOL4FGVCKLY57ZI2EG","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":"71563d11e7c9b86ccb1ab155a77b164f2eafb3912be13c81f2b817fd6898a70a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-02-27T12:11:35Z","title_canon_sha256":"9cfd5a7f819acbad8bb9e89322006ce8c9c65a1648b2fe7051c5ba34afbd882d"},"schema_version":"1.0","source":{"id":"1802.09844","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09844","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09844v1","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09844","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"pith_short_12","alias_value":"XMVL3ZBXYOL4","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XMVL3ZBXYOL4FGVC","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XMVL3ZBX","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:d20eaad9ddabaffdbf1cc54f6b532bf58197a68750fe4de842d6fa5a74570f42","target":"graph","created_at":"2026-05-18T00:22:22Z","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"},"paper":{"abstract_excerpt":"We discuss the amount of physical resources required to construct a given graph, where vertices are added sequentially. We naturally identify information -- distinct into instructions and memory -- and randomness as resources. Not surprisingly, we show that, in this framework, threshold graphs are the simplest possible graphs, since the construction of threshold graphs requires a single bit of instructions for each vertex and no use of memory. Large instructions without memory do not bring any advantage. With one bit of instructions and one bit of memory for each vertex, we can construct a fam","authors_text":"Avinash Mocherla, Danial Dervovic, Simone Severini","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-02-27T12:11:35Z","title":"Constructing graphs with limited resources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09844","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:c4faa2a56fd756b5d33d82f7d9a3508b2cb43a87723a4ad50f323237a5f30c92","target":"record","created_at":"2026-05-18T00:22:22Z","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":"71563d11e7c9b86ccb1ab155a77b164f2eafb3912be13c81f2b817fd6898a70a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-02-27T12:11:35Z","title_canon_sha256":"9cfd5a7f819acbad8bb9e89322006ce8c9c65a1648b2fe7051c5ba34afbd882d"},"schema_version":"1.0","source":{"id":"1802.09844","kind":"arxiv","version":1}},"canonical_sha256":"bb2abde437c397c29aa252f1dfe51a219b6e9eec107de69bdc87949a0c85d41a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb2abde437c397c29aa252f1dfe51a219b6e9eec107de69bdc87949a0c85d41a","first_computed_at":"2026-05-18T00:22:22.036222Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:22.036222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MISEDWdb5nUExJ3djzJVb5Ts4sNS2JPQ4LJMKwh1/AfOSvFQamR1/wt0myBgP7MkPm3qam7N8KyPI0eZggJkCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:22.036827Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09844","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4faa2a56fd756b5d33d82f7d9a3508b2cb43a87723a4ad50f323237a5f30c92","sha256:d20eaad9ddabaffdbf1cc54f6b532bf58197a68750fe4de842d6fa5a74570f42"],"state_sha256":"0d476a8d87a697455d5cf7136366cc7401b2cbd11b07e77b66731fda15e7571d"}