{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7QSZBJCURTCU333JQYGQYKGW5E","short_pith_number":"pith:7QSZBJCU","canonical_record":{"source":{"id":"1606.00730","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-02T15:47:51Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0bddbe5b40e293fbcf119599a8d3c28cc15b3a073674f2e5b140966c64e01cad","abstract_canon_sha256":"3541355df7c45114c166ef45e3e0d6dc052097b1f66a40ee5b27da88e01861d4"},"schema_version":"1.0"},"canonical_sha256":"fc2590a4548cc54def69860d0c28d6e933669adf267c3f99e890737d3c083e92","source":{"kind":"arxiv","id":"1606.00730","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00730","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00730v3","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00730","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"pith_short_12","alias_value":"7QSZBJCURTCU","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7QSZBJCURTCU333J","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7QSZBJCU","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7QSZBJCURTCU333JQYGQYKGW5E","target":"record","payload":{"canonical_record":{"source":{"id":"1606.00730","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-02T15:47:51Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"0bddbe5b40e293fbcf119599a8d3c28cc15b3a073674f2e5b140966c64e01cad","abstract_canon_sha256":"3541355df7c45114c166ef45e3e0d6dc052097b1f66a40ee5b27da88e01861d4"},"schema_version":"1.0"},"canonical_sha256":"fc2590a4548cc54def69860d0c28d6e933669adf267c3f99e890737d3c083e92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:38.138360Z","signature_b64":"UpZYb8hXF7CFytIGdnU5S+SoJhRPdU4fazLJP+cjZ+b2FoJyo8GO0qlm+uJ+95YlLUiGG/zxUkxB7CRxROTMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc2590a4548cc54def69860d0c28d6e933669adf267c3f99e890737d3c083e92","last_reissued_at":"2026-05-18T00:15:38.137752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:38.137752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.00730","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-05-18T00:15:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NPQXrgKjlTCzJ/tTvrJszOqc1G7olFnCvAhSuH3etXt/wEynrz8dTQWH6a/ZjEanvAaLcN6eNiPKAmZU4OfQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:50:55.445557Z"},"content_sha256":"4051e535e856c3d195b776248a9e530f4b7467f8d124ab0acc3feab7b3c24833","schema_version":"1.0","event_id":"sha256:4051e535e856c3d195b776248a9e530f4b7467f8d124ab0acc3feab7b3c24833"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7QSZBJCURTCU333JQYGQYKGW5E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Not all simple looking degree sequence problems are easy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Istv\\'an Mikl\\'os, P\\'eter L. Erd\\H{o}s","submitted_at":"2016-06-02T15:47:51Z","abstract_excerpt":"Degree sequence (DS) problems are around for at least hundred twenty years, and with the advent of network science, more and more complicated, structured DS problems were invented. Interestingly enough all those problems so far are computationally easy. It is clear, however, that we will find soon computationally hard DS problems. In this paper we want to find such hard DS problems with relatively simple definition.\n  For a vertex $v$ in the simple graph $G$ denote $d_i(v)$ the number of vertices at distance exactly $i$ from $v$. Then $d_1(v)$ is the usual degree of vertex $v.$ The vector $\\ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00730","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":""},"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-05-18T00:15:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FyYhYrIJKbvIDU4aF+VYVQSzBPYqLGHxsqqCy+4LfSgTrC4jXLKQhJ2FmS4PJCFO/cE5rALfJ3hbloP41QMPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:50:55.446330Z"},"content_sha256":"0d6233b6cf1b1419dea87d8884c4153261455571b28c693c0567b2adb444f090","schema_version":"1.0","event_id":"sha256:0d6233b6cf1b1419dea87d8884c4153261455571b28c693c0567b2adb444f090"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7QSZBJCURTCU333JQYGQYKGW5E/bundle.json","state_url":"https://pith.science/pith/7QSZBJCURTCU333JQYGQYKGW5E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7QSZBJCURTCU333JQYGQYKGW5E/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-06-11T21:50:55Z","links":{"resolver":"https://pith.science/pith/7QSZBJCURTCU333JQYGQYKGW5E","bundle":"https://pith.science/pith/7QSZBJCURTCU333JQYGQYKGW5E/bundle.json","state":"https://pith.science/pith/7QSZBJCURTCU333JQYGQYKGW5E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7QSZBJCURTCU333JQYGQYKGW5E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7QSZBJCURTCU333JQYGQYKGW5E","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":"3541355df7c45114c166ef45e3e0d6dc052097b1f66a40ee5b27da88e01861d4","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-02T15:47:51Z","title_canon_sha256":"0bddbe5b40e293fbcf119599a8d3c28cc15b3a073674f2e5b140966c64e01cad"},"schema_version":"1.0","source":{"id":"1606.00730","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00730","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00730v3","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00730","created_at":"2026-05-18T00:15:38Z"},{"alias_kind":"pith_short_12","alias_value":"7QSZBJCURTCU","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7QSZBJCURTCU333J","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7QSZBJCU","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:0d6233b6cf1b1419dea87d8884c4153261455571b28c693c0567b2adb444f090","target":"graph","created_at":"2026-05-18T00:15:38Z","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":"Degree sequence (DS) problems are around for at least hundred twenty years, and with the advent of network science, more and more complicated, structured DS problems were invented. Interestingly enough all those problems so far are computationally easy. It is clear, however, that we will find soon computationally hard DS problems. In this paper we want to find such hard DS problems with relatively simple definition.\n  For a vertex $v$ in the simple graph $G$ denote $d_i(v)$ the number of vertices at distance exactly $i$ from $v$. Then $d_1(v)$ is the usual degree of vertex $v.$ The vector $\\ma","authors_text":"Istv\\'an Mikl\\'os, P\\'eter L. Erd\\H{o}s","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-02T15:47:51Z","title":"Not all simple looking degree sequence problems are easy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00730","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:4051e535e856c3d195b776248a9e530f4b7467f8d124ab0acc3feab7b3c24833","target":"record","created_at":"2026-05-18T00:15:38Z","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":"3541355df7c45114c166ef45e3e0d6dc052097b1f66a40ee5b27da88e01861d4","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-02T15:47:51Z","title_canon_sha256":"0bddbe5b40e293fbcf119599a8d3c28cc15b3a073674f2e5b140966c64e01cad"},"schema_version":"1.0","source":{"id":"1606.00730","kind":"arxiv","version":3}},"canonical_sha256":"fc2590a4548cc54def69860d0c28d6e933669adf267c3f99e890737d3c083e92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc2590a4548cc54def69860d0c28d6e933669adf267c3f99e890737d3c083e92","first_computed_at":"2026-05-18T00:15:38.137752Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:38.137752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UpZYb8hXF7CFytIGdnU5S+SoJhRPdU4fazLJP+cjZ+b2FoJyo8GO0qlm+uJ+95YlLUiGG/zxUkxB7CRxROTMCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:38.138360Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.00730","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4051e535e856c3d195b776248a9e530f4b7467f8d124ab0acc3feab7b3c24833","sha256:0d6233b6cf1b1419dea87d8884c4153261455571b28c693c0567b2adb444f090"],"state_sha256":"6f468b9047d1b98daee90cc9d69d41815624ae1af2fefea096319794f8c1e065"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lQh9A1m9xs7tRxRpER3s21sCs6NknQF29fMW+IiCRkqljWVqNvrhrLerS5V6SHOepket3cFy0S7WivaCSo9kAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:50:55.450567Z","bundle_sha256":"c7f5e5ea9a2ca716304d0f1f4af6097cd165f79c6fce67e22e4dda356db9fcf0"}}