{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RE6NZGKJ3WFWTTL352JXWKTEVP","short_pith_number":"pith:RE6NZGKJ","canonical_record":{"source":{"id":"1412.4595","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-15T13:55:11Z","cross_cats_sorted":[],"title_canon_sha256":"bcf20adc4b40825ea77aa53072537e870c7e0331732db36268581f969bc9b539","abstract_canon_sha256":"f66cc4c8c2d3e37ae1db6b44df1a123beec9c5b5165c44f14ea09fcd965287e9"},"schema_version":"1.0"},"canonical_sha256":"893cdc9949dd8b69cd7bee937b2a64abecf753ab2f2d64c75b399b3b099914bf","source":{"kind":"arxiv","id":"1412.4595","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4595","created_at":"2026-05-18T02:31:18Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4595v1","created_at":"2026-05-18T02:31:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4595","created_at":"2026-05-18T02:31:18Z"},{"alias_kind":"pith_short_12","alias_value":"RE6NZGKJ3WFW","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RE6NZGKJ3WFWTTL3","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RE6NZGKJ","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RE6NZGKJ3WFWTTL352JXWKTEVP","target":"record","payload":{"canonical_record":{"source":{"id":"1412.4595","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-15T13:55:11Z","cross_cats_sorted":[],"title_canon_sha256":"bcf20adc4b40825ea77aa53072537e870c7e0331732db36268581f969bc9b539","abstract_canon_sha256":"f66cc4c8c2d3e37ae1db6b44df1a123beec9c5b5165c44f14ea09fcd965287e9"},"schema_version":"1.0"},"canonical_sha256":"893cdc9949dd8b69cd7bee937b2a64abecf753ab2f2d64c75b399b3b099914bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:18.738532Z","signature_b64":"ijw8+Y0+8dq5PH80RFB/ESeekf00+fPUeyIOBHAzm36YRcG6QDKg2nrMmZecrCQcnSU2peuGWChy+joe6qupBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"893cdc9949dd8b69cd7bee937b2a64abecf753ab2f2d64c75b399b3b099914bf","last_reissued_at":"2026-05-18T02:31:18.737946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:18.737946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.4595","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-18T02:31:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ecjzOFa3JS9FKE7fTGOg7iVvFlJrF3c1wwyrMrI3yWxrUamNQho6VYxXeI0zEclDZ76CJ1Houbr04MAlBKxDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:20:53.260128Z"},"content_sha256":"79aba9bcda3925f72bdedf43527e4c7ca43f1d0e086e2ebac7b91f089d6a0268","schema_version":"1.0","event_id":"sha256:79aba9bcda3925f72bdedf43527e4c7ca43f1d0e086e2ebac7b91f089d6a0268"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RE6NZGKJ3WFWTTL352JXWKTEVP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximal-clique partitions and the Roller Coaster Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jonathan Cutler, Luke Pebody","submitted_at":"2014-12-15T13:55:11Z","abstract_excerpt":"A graph $G$ is {\\em well-covered} if every maximal independent set has the same cardinality $q$. Let $i_k(G)$ denote the number of independent sets of cardinality $k$ in $G$. Brown, Dilcher, and Nowakowski conjectured that the independence sequence $(i_0(G), i_1(G), \\ldots, i_q(G))$ was unimodal for any well-ordered graph $G$ with independence number $q$. Michael and Traves disproved this conjecture. Instead they posited the so-called ``Roller Coaster\" Conjecture: that the terms \\[\n  i_{\\left\\lceil\\frac{q}2\\right\\rceil}(G), i_{\\left\\lceil\\frac{q}2\\right\\rceil+1}(G), \\ldots, i_q(G) \\] could be "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4595","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-18T02:31:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QzdZUZXVGBfNVSAb+nwrbgKD5VPZi5Wws+Ob9rxwGgONBWAWFYfZD5LAeYMvFCgDZrD++zqAZ4C1a5VL/x8gDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:20:53.260486Z"},"content_sha256":"081882fe899caaf403024e3264d76aaebf71928c7a42a4c6f26673fa63b5d191","schema_version":"1.0","event_id":"sha256:081882fe899caaf403024e3264d76aaebf71928c7a42a4c6f26673fa63b5d191"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RE6NZGKJ3WFWTTL352JXWKTEVP/bundle.json","state_url":"https://pith.science/pith/RE6NZGKJ3WFWTTL352JXWKTEVP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RE6NZGKJ3WFWTTL352JXWKTEVP/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-02T22:20:53Z","links":{"resolver":"https://pith.science/pith/RE6NZGKJ3WFWTTL352JXWKTEVP","bundle":"https://pith.science/pith/RE6NZGKJ3WFWTTL352JXWKTEVP/bundle.json","state":"https://pith.science/pith/RE6NZGKJ3WFWTTL352JXWKTEVP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RE6NZGKJ3WFWTTL352JXWKTEVP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RE6NZGKJ3WFWTTL352JXWKTEVP","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":"f66cc4c8c2d3e37ae1db6b44df1a123beec9c5b5165c44f14ea09fcd965287e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-15T13:55:11Z","title_canon_sha256":"bcf20adc4b40825ea77aa53072537e870c7e0331732db36268581f969bc9b539"},"schema_version":"1.0","source":{"id":"1412.4595","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4595","created_at":"2026-05-18T02:31:18Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4595v1","created_at":"2026-05-18T02:31:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4595","created_at":"2026-05-18T02:31:18Z"},{"alias_kind":"pith_short_12","alias_value":"RE6NZGKJ3WFW","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RE6NZGKJ3WFWTTL3","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RE6NZGKJ","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:081882fe899caaf403024e3264d76aaebf71928c7a42a4c6f26673fa63b5d191","target":"graph","created_at":"2026-05-18T02:31: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 $G$ is {\\em well-covered} if every maximal independent set has the same cardinality $q$. Let $i_k(G)$ denote the number of independent sets of cardinality $k$ in $G$. Brown, Dilcher, and Nowakowski conjectured that the independence sequence $(i_0(G), i_1(G), \\ldots, i_q(G))$ was unimodal for any well-ordered graph $G$ with independence number $q$. Michael and Traves disproved this conjecture. Instead they posited the so-called ``Roller Coaster\" Conjecture: that the terms \\[\n  i_{\\left\\lceil\\frac{q}2\\right\\rceil}(G), i_{\\left\\lceil\\frac{q}2\\right\\rceil+1}(G), \\ldots, i_q(G) \\] could be ","authors_text":"Jonathan Cutler, Luke Pebody","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-15T13:55:11Z","title":"Maximal-clique partitions and the Roller Coaster Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4595","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:79aba9bcda3925f72bdedf43527e4c7ca43f1d0e086e2ebac7b91f089d6a0268","target":"record","created_at":"2026-05-18T02:31: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":"f66cc4c8c2d3e37ae1db6b44df1a123beec9c5b5165c44f14ea09fcd965287e9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-15T13:55:11Z","title_canon_sha256":"bcf20adc4b40825ea77aa53072537e870c7e0331732db36268581f969bc9b539"},"schema_version":"1.0","source":{"id":"1412.4595","kind":"arxiv","version":1}},"canonical_sha256":"893cdc9949dd8b69cd7bee937b2a64abecf753ab2f2d64c75b399b3b099914bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"893cdc9949dd8b69cd7bee937b2a64abecf753ab2f2d64c75b399b3b099914bf","first_computed_at":"2026-05-18T02:31:18.737946Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:18.737946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ijw8+Y0+8dq5PH80RFB/ESeekf00+fPUeyIOBHAzm36YRcG6QDKg2nrMmZecrCQcnSU2peuGWChy+joe6qupBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:18.738532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.4595","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79aba9bcda3925f72bdedf43527e4c7ca43f1d0e086e2ebac7b91f089d6a0268","sha256:081882fe899caaf403024e3264d76aaebf71928c7a42a4c6f26673fa63b5d191"],"state_sha256":"ad6e4b4bb92df818db5369d3fb81a667cf65b121cb68094d9de689976157296f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zuJ9sx5mb9V4WOZhNhYp5V5wp1M6qk81Wy4/YJpGQ4H692bfRCdmNA9gFPFe2mjF8gp+b7kL1KjiGLJoCMynCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:20:53.262432Z","bundle_sha256":"ff87faeff8066bb00c11b2a6ba86450fbfb13a72f7039ca35745bff4deb32167"}}