{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7KXCJNEI4SAHHS6LIQF6NVVWVM","short_pith_number":"pith:7KXCJNEI","canonical_record":{"source":{"id":"1612.03736","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-12T15:14:38Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b2f53dfe80c9f16019fe4df23b2bc01c4f193b2becd9b3bc63caf7d78f17bbba","abstract_canon_sha256":"8c9b5ad8fe4a44a5c51b2ca6862d96dd4c7244cd372839e8c0d370c49d4ca05d"},"schema_version":"1.0"},"canonical_sha256":"faae24b488e48073cbcb440be6d6b6ab286009fdca5270093854078905fecea7","source":{"kind":"arxiv","id":"1612.03736","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03736","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03736v1","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03736","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"pith_short_12","alias_value":"7KXCJNEI4SAH","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7KXCJNEI4SAHHS6L","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7KXCJNEI","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7KXCJNEI4SAHHS6LIQF6NVVWVM","target":"record","payload":{"canonical_record":{"source":{"id":"1612.03736","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-12T15:14:38Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b2f53dfe80c9f16019fe4df23b2bc01c4f193b2becd9b3bc63caf7d78f17bbba","abstract_canon_sha256":"8c9b5ad8fe4a44a5c51b2ca6862d96dd4c7244cd372839e8c0d370c49d4ca05d"},"schema_version":"1.0"},"canonical_sha256":"faae24b488e48073cbcb440be6d6b6ab286009fdca5270093854078905fecea7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:18.463875Z","signature_b64":"CZXRZK+wWPjzm0KDjKwRPj4rqdsQOrJIMazjm3f3qcDLryniDHFYhXs88hXqWj/DT5EvmC8WnVRemL0RjHMRCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"faae24b488e48073cbcb440be6d6b6ab286009fdca5270093854078905fecea7","last_reissued_at":"2026-05-18T00:55:18.463261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:18.463261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.03736","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-05-18T00:55:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T0Cmefk52ivCpZyc/9+SK17vVGOfvw/IMnAUgyek1VGbDU82uNiMoKiESxLC6v5GrX+L4GCbwvh9B/KLNYQKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:54:19.840727Z"},"content_sha256":"45849babb1a00ca1217fe1e3b3d49bce4a56dfb70dc02371fed02ba2e00203dd","schema_version":"1.0","event_id":"sha256:45849babb1a00ca1217fe1e3b3d49bce4a56dfb70dc02371fed02ba2e00203dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7KXCJNEI4SAHHS6LIQF6NVVWVM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Roller-Coaster Conjecture Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Eugen Mandrescu, Vadim E. Levit","submitted_at":"2016-12-12T15:14:38Z","abstract_excerpt":"A graph is well-covered if all its maximal independent sets are of the same cardinality (Plummer, 1970). If G is a well-covered graph, has at least two vertices, and G-v is well-covered for every vertex v, then G is a 1-well-covered graph (Staples, 1975). We call G a {\\lambda}-quasi-regularizable graph if {\\lambda} |S| =< |N(S)| for every independent set S of G. The independence polynomial I(G;x) is the generating function of independent sets in a graph G (Gutman & Harary, 1983). The Roller-Coaster Conjecture (Michael & Travis, 2003), saying that for every permutation {\\sigma} of the set {({\\a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03736","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":""},"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:55:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EvcbgqT7jl1BFq2vy6esP5bRYVmp3us41llNblSIp2jHFbiE8hZKEk8xmn8loDTbwWRqfYO2z7vtUITY9ve8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:54:19.841162Z"},"content_sha256":"ca74f9ddd2baf4c0d55cb82b3a770ab28b44ec4d111241effb1633cabddb675c","schema_version":"1.0","event_id":"sha256:ca74f9ddd2baf4c0d55cb82b3a770ab28b44ec4d111241effb1633cabddb675c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7KXCJNEI4SAHHS6LIQF6NVVWVM/bundle.json","state_url":"https://pith.science/pith/7KXCJNEI4SAHHS6LIQF6NVVWVM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7KXCJNEI4SAHHS6LIQF6NVVWVM/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-05-29T19:54:19Z","links":{"resolver":"https://pith.science/pith/7KXCJNEI4SAHHS6LIQF6NVVWVM","bundle":"https://pith.science/pith/7KXCJNEI4SAHHS6LIQF6NVVWVM/bundle.json","state":"https://pith.science/pith/7KXCJNEI4SAHHS6LIQF6NVVWVM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7KXCJNEI4SAHHS6LIQF6NVVWVM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7KXCJNEI4SAHHS6LIQF6NVVWVM","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":"8c9b5ad8fe4a44a5c51b2ca6862d96dd4c7244cd372839e8c0d370c49d4ca05d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-12T15:14:38Z","title_canon_sha256":"b2f53dfe80c9f16019fe4df23b2bc01c4f193b2becd9b3bc63caf7d78f17bbba"},"schema_version":"1.0","source":{"id":"1612.03736","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03736","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03736v1","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03736","created_at":"2026-05-18T00:55:18Z"},{"alias_kind":"pith_short_12","alias_value":"7KXCJNEI4SAH","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7KXCJNEI4SAHHS6L","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7KXCJNEI","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:ca74f9ddd2baf4c0d55cb82b3a770ab28b44ec4d111241effb1633cabddb675c","target":"graph","created_at":"2026-05-18T00:55:18Z","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":"A graph is well-covered if all its maximal independent sets are of the same cardinality (Plummer, 1970). If G is a well-covered graph, has at least two vertices, and G-v is well-covered for every vertex v, then G is a 1-well-covered graph (Staples, 1975). We call G a {\\lambda}-quasi-regularizable graph if {\\lambda} |S| =< |N(S)| for every independent set S of G. The independence polynomial I(G;x) is the generating function of independent sets in a graph G (Gutman & Harary, 1983). The Roller-Coaster Conjecture (Michael & Travis, 2003), saying that for every permutation {\\sigma} of the set {({\\a","authors_text":"Eugen Mandrescu, Vadim E. Levit","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-12T15:14:38Z","title":"The Roller-Coaster Conjecture Revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03736","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:45849babb1a00ca1217fe1e3b3d49bce4a56dfb70dc02371fed02ba2e00203dd","target":"record","created_at":"2026-05-18T00:55:18Z","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":"8c9b5ad8fe4a44a5c51b2ca6862d96dd4c7244cd372839e8c0d370c49d4ca05d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-12T15:14:38Z","title_canon_sha256":"b2f53dfe80c9f16019fe4df23b2bc01c4f193b2becd9b3bc63caf7d78f17bbba"},"schema_version":"1.0","source":{"id":"1612.03736","kind":"arxiv","version":1}},"canonical_sha256":"faae24b488e48073cbcb440be6d6b6ab286009fdca5270093854078905fecea7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"faae24b488e48073cbcb440be6d6b6ab286009fdca5270093854078905fecea7","first_computed_at":"2026-05-18T00:55:18.463261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:18.463261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CZXRZK+wWPjzm0KDjKwRPj4rqdsQOrJIMazjm3f3qcDLryniDHFYhXs88hXqWj/DT5EvmC8WnVRemL0RjHMRCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:18.463875Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.03736","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45849babb1a00ca1217fe1e3b3d49bce4a56dfb70dc02371fed02ba2e00203dd","sha256:ca74f9ddd2baf4c0d55cb82b3a770ab28b44ec4d111241effb1633cabddb675c"],"state_sha256":"5702c6a6f5c2d3b3424c828a55442b01c422da6b82edd0ec03688ce40bff1e3b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oiKiZ7p6mE/PSp3OK0y1J269y52gIwoTAPRqCEno/RfqE+XqTvypgQz/aQ+7qZI9G16Vil8yujlOt+8Sukb9Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T19:54:19.844048Z","bundle_sha256":"1f2d67e7913e8ca4961abc9e0113dbd6fb2819fd120af9bcec9a07081694033c"}}