{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:B2VZLW4UKNUKEXK5CFUKNDDHMR","short_pith_number":"pith:B2VZLW4U","canonical_record":{"source":{"id":"1401.2978","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-13T20:50:30Z","cross_cats_sorted":[],"title_canon_sha256":"7dd2de18a6e9406b9a3acb52d1d02b2934865f631c3c5860b2f16cce98c46150","abstract_canon_sha256":"f9698b96278a29fc1303c067e7193c0467b79c65ae59ded343687db1bfc6d856"},"schema_version":"1.0"},"canonical_sha256":"0eab95db945368a25d5d1168a68c676462a551f08620d9f533280284ed5768f4","source":{"kind":"arxiv","id":"1401.2978","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2978","created_at":"2026-05-18T01:25:30Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2978v2","created_at":"2026-05-18T01:25:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2978","created_at":"2026-05-18T01:25:30Z"},{"alias_kind":"pith_short_12","alias_value":"B2VZLW4UKNUK","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"B2VZLW4UKNUKEXK5","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"B2VZLW4U","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:B2VZLW4UKNUKEXK5CFUKNDDHMR","target":"record","payload":{"canonical_record":{"source":{"id":"1401.2978","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-13T20:50:30Z","cross_cats_sorted":[],"title_canon_sha256":"7dd2de18a6e9406b9a3acb52d1d02b2934865f631c3c5860b2f16cce98c46150","abstract_canon_sha256":"f9698b96278a29fc1303c067e7193c0467b79c65ae59ded343687db1bfc6d856"},"schema_version":"1.0"},"canonical_sha256":"0eab95db945368a25d5d1168a68c676462a551f08620d9f533280284ed5768f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:30.964706Z","signature_b64":"Gg5M/E+tG9F5GF2xrD1j6jp5sBEhLjSGa3LnUZtK9kSG2guaphG0FOAK54mUtNa1NoUCAPsW/jqqpqSp06xBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0eab95db945368a25d5d1168a68c676462a551f08620d9f533280284ed5768f4","last_reissued_at":"2026-05-18T01:25:30.964236Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:30.964236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.2978","source_version":2,"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-18T01:25:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M1g+0Yd/VRkkpkahstX45mgI5a82FvyTRJybbTUsq4vFyCPrG2wYiR8Po3abMopvEDdhbrrSKypPf15HuyjICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:30:25.435586Z"},"content_sha256":"2107efdda181a2ef0c831f01aad586268128adaa43bb88a7a9279385e532366c","schema_version":"1.0","event_id":"sha256:2107efdda181a2ef0c831f01aad586268128adaa43bb88a7a9279385e532366c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:B2VZLW4UKNUKEXK5CFUKNDDHMR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scheduling Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Caroline J. Klivans, Felix Breuer","submitted_at":"2014-01-13T20:50:30Z","abstract_excerpt":"We introduce the notion of a scheduling problem which is a boolean function $S$ over atomic formulas of the form $x_i \\leq x_j$. Considering the $x_i$ as jobs to be performed, an integer assignment satisfying $S$ schedules the jobs subject to the constraints of the atomic formulas. The scheduling counting function counts the number of solutions to $S$. We prove that this counting function is a polynomial in the number of time slots allowed. Scheduling polynomials include the chromatic polynomial of a graph, the zeta polynomial of a lattice, the Billera-Jia-Reiner polynomial of a matroid.\n  To "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2978","kind":"arxiv","version":2},"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-18T01:25:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r/cxsLx/AH9O6JjPARJopywVB0JbMBuKUw/Q0jhZZlWQlcuhLI1Y3T4WCaK+bLc8ONqJFtKxCNRjB3hknOYFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:30:25.435932Z"},"content_sha256":"6d6cfa6a0e80163f2ea5ba6472bc1679a693d6da0087fbe6906ed4f3e468d2f5","schema_version":"1.0","event_id":"sha256:6d6cfa6a0e80163f2ea5ba6472bc1679a693d6da0087fbe6906ed4f3e468d2f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B2VZLW4UKNUKEXK5CFUKNDDHMR/bundle.json","state_url":"https://pith.science/pith/B2VZLW4UKNUKEXK5CFUKNDDHMR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B2VZLW4UKNUKEXK5CFUKNDDHMR/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-20T05:30:25Z","links":{"resolver":"https://pith.science/pith/B2VZLW4UKNUKEXK5CFUKNDDHMR","bundle":"https://pith.science/pith/B2VZLW4UKNUKEXK5CFUKNDDHMR/bundle.json","state":"https://pith.science/pith/B2VZLW4UKNUKEXK5CFUKNDDHMR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B2VZLW4UKNUKEXK5CFUKNDDHMR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:B2VZLW4UKNUKEXK5CFUKNDDHMR","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":"f9698b96278a29fc1303c067e7193c0467b79c65ae59ded343687db1bfc6d856","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-13T20:50:30Z","title_canon_sha256":"7dd2de18a6e9406b9a3acb52d1d02b2934865f631c3c5860b2f16cce98c46150"},"schema_version":"1.0","source":{"id":"1401.2978","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2978","created_at":"2026-05-18T01:25:30Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2978v2","created_at":"2026-05-18T01:25:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2978","created_at":"2026-05-18T01:25:30Z"},{"alias_kind":"pith_short_12","alias_value":"B2VZLW4UKNUK","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"B2VZLW4UKNUKEXK5","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"B2VZLW4U","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:6d6cfa6a0e80163f2ea5ba6472bc1679a693d6da0087fbe6906ed4f3e468d2f5","target":"graph","created_at":"2026-05-18T01:25:30Z","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 introduce the notion of a scheduling problem which is a boolean function $S$ over atomic formulas of the form $x_i \\leq x_j$. Considering the $x_i$ as jobs to be performed, an integer assignment satisfying $S$ schedules the jobs subject to the constraints of the atomic formulas. The scheduling counting function counts the number of solutions to $S$. We prove that this counting function is a polynomial in the number of time slots allowed. Scheduling polynomials include the chromatic polynomial of a graph, the zeta polynomial of a lattice, the Billera-Jia-Reiner polynomial of a matroid.\n  To ","authors_text":"Caroline J. Klivans, Felix Breuer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-13T20:50:30Z","title":"Scheduling Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2978","kind":"arxiv","version":2},"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:2107efdda181a2ef0c831f01aad586268128adaa43bb88a7a9279385e532366c","target":"record","created_at":"2026-05-18T01:25:30Z","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":"f9698b96278a29fc1303c067e7193c0467b79c65ae59ded343687db1bfc6d856","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-13T20:50:30Z","title_canon_sha256":"7dd2de18a6e9406b9a3acb52d1d02b2934865f631c3c5860b2f16cce98c46150"},"schema_version":"1.0","source":{"id":"1401.2978","kind":"arxiv","version":2}},"canonical_sha256":"0eab95db945368a25d5d1168a68c676462a551f08620d9f533280284ed5768f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0eab95db945368a25d5d1168a68c676462a551f08620d9f533280284ed5768f4","first_computed_at":"2026-05-18T01:25:30.964236Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:30.964236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gg5M/E+tG9F5GF2xrD1j6jp5sBEhLjSGa3LnUZtK9kSG2guaphG0FOAK54mUtNa1NoUCAPsW/jqqpqSp06xBBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:30.964706Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2978","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2107efdda181a2ef0c831f01aad586268128adaa43bb88a7a9279385e532366c","sha256:6d6cfa6a0e80163f2ea5ba6472bc1679a693d6da0087fbe6906ed4f3e468d2f5"],"state_sha256":"b67d9e1ee00a501994ba99448752dec6b51e3d48b719d53d5d7063d7abad85b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tmmgQK135ACDZMdJlKbsXmyElQcoJAHBxVRPp3cJqObWcufBhnB7q7KAGIz6jBpenYXu7+Mslr9Kp3BGWlF6CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T05:30:25.437941Z","bundle_sha256":"82fe64963ab20659b17f3b426d2daa0b5b2ca89b76941efc686d2335d9d7dc77"}}